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/loopAccelerationFastUPR/twoLoops_firstPart.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:21:04,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:21:04,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:21:04,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:21:04,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:21:04,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:21:04,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:21:04,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:21:04,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:21:04,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:21:04,228 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:21:04,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:21:04,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:21:04,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:21:04,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:21:04,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:21:04,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:21:04,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:21:04,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:21:04,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:21:04,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:21:04,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:21:04,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:21:04,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:21:04,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:21:04,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:21:04,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:21:04,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:21:04,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:21:04,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:21:04,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:21:04,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:21:04,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:21:04,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:21:04,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:21:04,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:21:04,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:21:04,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:21:04,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:21:04,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:21:04,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:21:04,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:21:04,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:21:04,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:21:04,329 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:21:04,329 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:21:04,330 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationFastUPR/twoLoops_firstPart.bpl [2019-08-05 11:21:04,330 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationFastUPR/twoLoops_firstPart.bpl' [2019-08-05 11:21:04,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:21:04,363 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:21:04,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:04,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:21:04,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:21:04,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (1/1) ... [2019-08-05 11:21:04,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (1/1) ... [2019-08-05 11:21:04,396 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:21:04,396 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:21:04,397 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:21:04,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:04,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:21:04,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:21:04,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:21:04,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (1/1) ... [2019-08-05 11:21:04,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (1/1) ... [2019-08-05 11:21:04,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (1/1) ... [2019-08-05 11:21:04,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (1/1) ... [2019-08-05 11:21:04,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (1/1) ... [2019-08-05 11:21:04,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (1/1) ... [2019-08-05 11:21:04,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (1/1) ... [2019-08-05 11:21:04,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:21:04,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:21:04,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:21:04,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:21:04,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (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:04,494 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:21:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:21:04,494 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:21:04,743 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:21:04,744 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:21:04,745 INFO L202 PluginConnector]: Adding new model twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:04 BoogieIcfgContainer [2019-08-05 11:21:04,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:21:04,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:21:04,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:21:04,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:21:04,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:04" (1/2) ... [2019-08-05 11:21:04,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccecb0e and model type twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:21:04, skipping insertion in model container [2019-08-05 11:21:04,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:04" (2/2) ... [2019-08-05 11:21:04,753 INFO L109 eAbstractionObserver]: Analyzing ICFG twoLoops_firstPart.bpl [2019-08-05 11:21:04,763 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:21:04,769 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:21:04,785 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:21:04,810 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:21:04,811 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:21:04,812 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:21:04,812 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:21:04,812 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:21:04,812 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:21:04,812 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:21:04,813 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:21:04,813 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:21:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:21:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:21:04,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:04,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:21:04,841 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 11:21:04,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:04,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:21:04,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:05,000 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:05,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:05,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:21:05,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:21:05,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:21:05,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:05,021 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:21:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:05,074 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:21:05,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:21:05,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:21:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:05,087 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:21:05,088 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:21:05,090 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:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:21:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:21:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:21:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:21:05,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:21:05,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:05,126 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:21:05,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:21:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:21:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:21:05,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:05,127 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:21:05,127 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 11:21:05,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:05,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:05,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:05,279 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:05,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:05,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:21:05,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:05,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:05,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:05,282 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:21:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:05,332 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:21:05,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:05,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:21:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:05,334 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:21:05,334 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:21:05,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:21:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:21:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:21:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:21:05,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:21:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:05,338 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:21:05,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:21:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:21:05,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:05,339 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:21:05,339 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:05,340 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 11:21:05,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:05,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:21:05,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:05,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:05,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:21:05,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:21:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:21:05,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:05,449 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:21:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:05,483 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:21:05,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:05,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:21:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:05,484 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:21:05,484 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:21:05,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:21:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:21:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:21:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:21:05,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:21:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:05,488 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:21:05,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:21:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:21:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:21:05,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:05,489 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:21:05,490 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:05,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:05,490 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 11:21:05,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:05,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:21:05,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:05,598 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:05,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:05,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:21:05,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:21:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:21:05,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:05,601 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 11:21:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:05,633 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:21:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:21:05,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:21:05,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:05,636 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:21:05,636 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:21:05,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:21:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:21:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:21:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:21:05,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:21:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:05,640 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:21:05,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:21:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:21:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:21:05,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:05,641 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:21:05,641 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 11:21:05,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:05,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:21:05,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:05,869 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:05,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:05,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:21:05,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:21:05,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:21:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:05,872 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:21:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:05,947 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:21:05,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:21:05,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:21:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:05,948 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:21:05,949 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:21:05,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:21:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:21:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:21:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:21:05,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:21:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:05,955 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:21:05,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:21:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:21:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:21:05,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:05,956 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:21:05,956 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:05,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:05,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 11:21:05,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:05,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:21:05,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:06,149 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:06,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:06,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:21:06,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:21:06,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:21:06,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:06,151 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 11:21:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:06,200 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:21:06,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:21:06,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 11:21:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:06,202 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:21:06,202 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:21:06,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:21:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:21:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:21:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:21:06,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:21:06,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:06,206 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:21:06,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:21:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:21:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:21:06,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:06,207 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 11:21:06,207 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:06,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:06,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 11:21:06,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:06,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:21:06,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:06,474 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:06,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:06,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:21:06,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:21:06,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:21:06,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:06,478 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 11:21:06,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:06,523 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:21:06,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:21:06,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 11:21:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:06,524 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:21:06,525 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:21:06,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:21:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:21:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:21:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:21:06,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:21:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:06,529 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:21:06,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:21:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:21:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:21:06,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:06,530 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 11:21:06,530 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:06,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:06,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 11:21:06,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:06,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:21:06,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:06,673 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:06,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:06,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:21:06,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:21:06,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:21:06,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:21:06,675 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 11:21:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:06,733 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:21:06,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:21:06,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 11:21:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:06,734 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:21:06,735 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:21:06,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:21:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:21:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:21:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:21:06,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:21:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:06,739 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:21:06,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:21:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:21:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:21:06,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:06,740 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 11:21:06,740 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:06,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:06,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 11:21:06,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:06,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:21:06,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:07,254 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:07,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:07,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:21:07,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:21:07,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:21:07,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:21:07,256 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 11:21:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:07,306 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:21:07,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:21:07,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 11:21:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:07,307 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:21:07,307 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:21:07,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:21:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:21:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:21:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:21:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:21:07,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:21:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:07,311 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:21:07,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:21:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:21:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:21:07,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:07,312 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 11:21:07,312 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:07,312 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 11:21:07,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:07,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:21:07,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:07,541 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:07,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:07,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:21:07,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:21:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:21:07,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:21:07,544 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 11:21:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:07,589 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:21:07,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:21:07,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 11:21:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:07,591 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:21:07,591 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:21:07,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:21:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:21:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:21:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:21:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:21:07,595 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:21:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:07,596 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:21:07,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:21:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:21:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:21:07,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:07,597 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 11:21:07,597 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 11:21:07,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:07,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:21:07,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:07,788 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:07,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:07,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:21:07,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:21:07,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:21:07,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:21:07,790 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 11:21:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:07,828 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:21:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:21:07,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 11:21:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:07,829 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:21:07,830 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:21:07,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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:07,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:21:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:21:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:21:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:21:07,833 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:21:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:07,833 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:21:07,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:21:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:21:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:21:07,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:07,834 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 11:21:07,835 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:07,835 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 11:21:07,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:07,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:21:07,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,113 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:08,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:21:08,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:21:08,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:21:08,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:21:08,116 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 11:21:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,147 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:21:08,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:21:08,147 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 11:21:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,148 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:21:08,148 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:21:08,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 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:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:21:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:21:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:21:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:21:08,151 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:21:08,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,152 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:21:08,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:21:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:21:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:21:08,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,153 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 11:21:08,153 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 11:21:08,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,358 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:08,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:21:08,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:21:08,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:21:08,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:08,360 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 11:21:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,408 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:21:08,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:21:08,412 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 11:21:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,412 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:21:08,412 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:21:08,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:21:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:21:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:21:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:21:08,416 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:21:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,416 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:21:08,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:21:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:21:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:21:08,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,417 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 11:21:08,417 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 11:21:08,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,675 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:08,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:21:08,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:21:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:21:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:21:08,676 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 11:21:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,736 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:21:08,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:21:08,737 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 11:21:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,738 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:21:08,738 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:21:08,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 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:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:21:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:21:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:21:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:21:08,744 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:21:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,744 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:21:08,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:21:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:21:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:21:08,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,745 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 11:21:08,745 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,746 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 11:21:08,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,980 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:08,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:21:08,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:21:08,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:21:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:21:08,982 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 11:21:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,034 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:21:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:21:09,035 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 11:21:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,036 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:21:09,037 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:21:09,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:21:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:21:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:21:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:21:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:21:09,041 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:21:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,041 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:21:09,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:21:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:21:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:21:09,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,042 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 11:21:09,043 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 11:21:09,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:09,288 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:09,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:09,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:21:09,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:21:09,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:21:09,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:21:09,291 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 11:21:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,588 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:21:09,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:21:09,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 11:21:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,589 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:21:09,590 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:21:09,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:21:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:21:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:21:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:21:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:21:09,594 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:21:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,594 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:21:09,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:21:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:21:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:21:09,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,595 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 11:21:09,596 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 11:21:09,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:09,814 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:09,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:09,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:21:09,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:21:09,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:21:09,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:21:09,816 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 11:21:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,874 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:21:09,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:21:09,875 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 11:21:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,876 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:21:09,876 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:21:09,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 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:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:21:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:21:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:21:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:21:09,879 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:21:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,879 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:21:09,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:21:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:21:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:21:09,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,880 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 11:21:09,880 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,881 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 11:21:09,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:10,440 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:10,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:10,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:21:10,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:21:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:21:10,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:21:10,442 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 11:21:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:10,507 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:21:10,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:21:10,507 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 11:21:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:10,507 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:21:10,508 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:21:10,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:21:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:21:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:21:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:21:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:21:10,512 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:21:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:10,512 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:21:10,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:21:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:21:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:21:10,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:10,513 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 11:21:10,513 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 11:21:10,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:10,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:21:10,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:10,969 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:10,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:10,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:21:10,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:21:10,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:21:10,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:21:10,971 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 11:21:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:11,019 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:21:11,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:21:11,020 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 11:21:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:11,021 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:21:11,021 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:21:11,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 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:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:21:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:21:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:21:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:21:11,025 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 11:21:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:11,026 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:21:11,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:21:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:21:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:21:11,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:11,027 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 11:21:11,027 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 11:21:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:11,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:21:11,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:11,348 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:11,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:11,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:21:11,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:21:11,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:21:11,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:21:11,350 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 11:21:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:11,381 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:21:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:21:11,382 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 11:21:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:11,383 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:21:11,383 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:21:11,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 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:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:21:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:21:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:21:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:21:11,388 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 11:21:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:11,388 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:21:11,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:21:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:21:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:21:11,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:11,389 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 11:21:11,389 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:11,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 11:21:11,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:11,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:21:11,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:11,714 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:11,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:11,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:21:11,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:21:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:21:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:21:11,716 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 11:21:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:11,758 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:21:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:21:11,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 11:21:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:11,760 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:21:11,760 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:21:11,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:21:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:21:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:21:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:21:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:21:11,764 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 11:21:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:11,764 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:21:11,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:21:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:21:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:21:11,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:11,766 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 11:21:11,766 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:11,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 11:21:11,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:11,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:21:11,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:12,237 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:12,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:12,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:21:12,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:21:12,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:21:12,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:21:12,239 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 11:21:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:12,471 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:21:12,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:21:12,473 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 11:21:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:12,473 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:21:12,473 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:21:12,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:21:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:21:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:21:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:21:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:21:12,477 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 11:21:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:12,477 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:21:12,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:21:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:21:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:21:12,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:12,478 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 11:21:12,478 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 11:21:12,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:12,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:21:12,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:12,882 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:12,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:12,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:21:12,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:21:12,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:21:12,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:21:12,884 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 11:21:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:12,952 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:21:12,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:21:12,952 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 11:21:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:12,953 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:21:12,953 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:21:12,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:21:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:21:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:21:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:21:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:21:12,958 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 11:21:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:12,958 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:21:12,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:21:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:21:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:21:12,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:12,959 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 11:21:12,959 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:12,959 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 11:21:12,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:12,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:21:12,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:13,267 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:13,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:13,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:21:13,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:21:13,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:21:13,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:21:13,269 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 11:21:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:13,339 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:21:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:21:13,340 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 11:21:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:13,341 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:21:13,341 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:21:13,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 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:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:21:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:21:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:21:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:21:13,346 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 11:21:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:13,347 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:21:13,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:21:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:21:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:21:13,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:13,348 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 11:21:13,348 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:13,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:13,348 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 11:21:13,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:13,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:21:13,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:14,012 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:14,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:14,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:21:14,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:21:14,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:21:14,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:14,014 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 11:21:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:14,078 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:21:14,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:21:14,078 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 11:21:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:14,079 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:21:14,079 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:21:14,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:21:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:21:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:21:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:21:14,083 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 11:21:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:14,083 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:21:14,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:21:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:21:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:21:14,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:14,085 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 11:21:14,085 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 11:21:14,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:14,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:21:14,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:14,732 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:14,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:14,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:21:14,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:21:14,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:21:14,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:21:14,734 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 11:21:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:14,787 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:21:14,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:21:14,787 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 11:21:14,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:14,788 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:21:14,788 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:21:14,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:21:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:21:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:21:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:21:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:21:14,792 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 11:21:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:14,792 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:21:14,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:21:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:21:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:21:14,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:14,793 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 11:21:14,793 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 11:21:14,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:14,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:21:14,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,635 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:15,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:15,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:21:15,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:21:15,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:21:15,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:15,637 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 11:21:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,826 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:21:15,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:21:15,827 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 11:21:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,827 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:21:15,827 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:21:15,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:21:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:21:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:21:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:21:15,830 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 11:21:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,831 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:21:15,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:21:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:21:15,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:21:15,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,832 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 11:21:15,832 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 11:21:15,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,237 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:16,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:21:16,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:21:16,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:21:16,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:21:16,239 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 11:21:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,296 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:21:16,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:21:16,296 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 11:21:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,297 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:21:16,297 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:21:16,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:21:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:21:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:21:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:21:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:21:16,302 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 11:21:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,302 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:21:16,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:21:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:21:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:21:16,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,303 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 11:21:16,303 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 11:21:16,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,695 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:16,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:21:16,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:21:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:21:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:16,697 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 11:21:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,771 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:21:16,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:21:16,772 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 11:21:16,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,773 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:21:16,773 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:21:16,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:21:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:21:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:21:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:21:16,777 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 11:21:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,778 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:21:16,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:21:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:21:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:21:16,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,782 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 11:21:16,782 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 11:21:16,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:17,646 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:17,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:17,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:21:17,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:21:17,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:21:17,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:21:17,647 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 11:21:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:17,898 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:21:17,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:21:17,899 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 11:21:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:17,899 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:21:17,899 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:21:17,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:21:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:21:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:21:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:21:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:21:17,902 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 11:21:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:17,902 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:21:17,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:21:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:21:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:21:17,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:17,903 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 11:21:17,903 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:17,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 11:21:17,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:17,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:21:17,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:18,410 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:18,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:18,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:21:18,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:21:18,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:21:18,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:18,411 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 11:21:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:18,468 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:21:18,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:21:18,469 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 11:21:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:18,469 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:21:18,470 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:21:18,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:18,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:21:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:21:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:21:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:21:18,473 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 11:21:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:18,474 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:21:18,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:21:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:21:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:21:18,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:18,474 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 11:21:18,474 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 11:21:18,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:18,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:21:18,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:18,920 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:18,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:18,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:21:18,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:21:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:21:18,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:21:18,922 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 11:21:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:18,984 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:21:18,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:21:18,985 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 11:21:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:18,986 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:21:18,986 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:21:18,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 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:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:21:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:21:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:21:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:21:18,991 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 11:21:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:18,991 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:21:18,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:21:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:21:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:21:18,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:18,992 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 11:21:18,992 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:18,993 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 11:21:18,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,434 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:19,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:21:19,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:21:19,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:21:19,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:21:19,437 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 11:21:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,495 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:21:19,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:21:19,495 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 11:21:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,495 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:21:19,495 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:21:19,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 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:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:21:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:21:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:21:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:21:19,499 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 11:21:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,499 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:21:19,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:21:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:21:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:21:19,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,500 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 11:21:19,500 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 11:21:19,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:20,159 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:20,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:20,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:21:20,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:21:20,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:21:20,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:21:20,161 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 11:21:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:20,210 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:21:20,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:21:20,210 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 11:21:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:20,211 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:21:20,211 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:21:20,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:21:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:21:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:21:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:21:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:21:20,215 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 11:21:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:20,215 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:21:20,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:21:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:21:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:21:20,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:20,215 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 11:21:20,216 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:20,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:20,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 11:21:20,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:20,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:21:20,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:20,897 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:20,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:20,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:21:20,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:21:20,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:21:20,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:20,899 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 11:21:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:20,958 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:21:20,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:21:20,959 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 11:21:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:20,959 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:21:20,960 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:21:20,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:21:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:21:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:21:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:21:20,965 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 11:21:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:20,966 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:21:20,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:21:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:21:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:21:20,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:20,967 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 11:21:20,967 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:20,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:20,967 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 11:21:20,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:20,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:21:20,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:21,575 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:21,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:21,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:21:21,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:21:21,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:21:21,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:21:21,577 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 11:21:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:21,678 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:21:21,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:21:21,678 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 11:21:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:21,679 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:21:21,679 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:21:21,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 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:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:21:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:21:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:21:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:21:21,682 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 11:21:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:21,682 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:21:21,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:21:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:21:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:21:21,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:21,683 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 11:21:21,683 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:21,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:21,683 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 11:21:21,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:23,572 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:23,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:23,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:21:23,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:21:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:21:23,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:23,574 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 11:21:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:23,645 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:21:23,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:21:23,646 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 11:21:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:23,647 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:21:23,647 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:21:23,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:21:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:21:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:21:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:21:23,650 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 11:21:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:23,651 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:21:23,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:21:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:21:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:21:23,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:23,652 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 11:21:23,652 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 11:21:23,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:23,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:21:23,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:24,363 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:24,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:24,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:21:24,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:21:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:21:24,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:21:24,365 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 11:21:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:24,428 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:21:24,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:21:24,432 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 11:21:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:24,433 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:21:24,433 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:21:24,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:21:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:21:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:21:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:21:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:21:24,435 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 11:21:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:24,436 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:21:24,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:21:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:21:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:21:24,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:24,437 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 11:21:24,437 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 11:21:24,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:24,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:21:24,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:25,623 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:25,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:25,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:21:25,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:21:25,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:21:25,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:21:25,625 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 11:21:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:25,682 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:21:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:21:25,682 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 11:21:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:25,683 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:21:25,683 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:21:25,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:21:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:21:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:21:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:21:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:21:25,687 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 11:21:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:25,687 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:21:25,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:21:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:21:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:21:25,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:25,688 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 11:21:25,688 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:25,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 11:21:25,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:25,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:21:25,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:26,328 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:26,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:26,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:21:26,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:21:26,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:21:26,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:21:26,329 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 11:21:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:26,388 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:21:26,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:21:26,388 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 11:21:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:26,389 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:21:26,389 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:21:26,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:21:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:21:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:21:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:21:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:21:26,392 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 11:21:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:26,393 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:21:26,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:21:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:21:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:21:26,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:26,393 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 11:21:26,394 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:26,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:26,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 11:21:26,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:26,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:21:26,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:27,149 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:27,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:27,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:21:27,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:21:27,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:21:27,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:21:27,151 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 11:21:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:27,286 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:21:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:21:27,286 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 11:21:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:27,287 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:21:27,287 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:21:27,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:21:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:21:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:21:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:21:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:21:27,291 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 11:21:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:27,292 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:21:27,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:21:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:21:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:21:27,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:27,293 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 11:21:27,293 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:27,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 11:21:27,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:27,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:21:27,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:28,235 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:28,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:28,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:21:28,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:21:28,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:21:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:21:28,238 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 11:21:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:28,305 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:21:28,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:21:28,305 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 11:21:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:28,306 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:21:28,306 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:21:28,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 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:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:21:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:21:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:21:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:21:28,309 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 11:21:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:28,309 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:21:28,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:21:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:21:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:21:28,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:28,310 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 11:21:28,310 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:28,311 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 11:21:28,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:28,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:21:28,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:29,031 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:29,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:29,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:21:29,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:21:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:21:29,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:21:29,033 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 11:21:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:29,087 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:21:29,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:21:29,088 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 11:21:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:29,089 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:21:29,089 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:21:29,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:21:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:21:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:21:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:21:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:21:29,093 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 11:21:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:29,093 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:21:29,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:21:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:21:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:21:29,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:29,094 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 11:21:29,094 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:29,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 11:21:29,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:29,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:21:29,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:29,975 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:29,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:29,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:21:29,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:21:29,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:21:29,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:21:29,977 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 11:21:30,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:30,059 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:21:30,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:21:30,059 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 11:21:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:30,060 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:21:30,060 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:21:30,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 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:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:21:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:21:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:21:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:21:30,064 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 11:21:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:30,064 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:21:30,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:21:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:21:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:21:30,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:30,065 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 11:21:30,065 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 11:21:30,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:30,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:21:30,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:30,943 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:30,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:30,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:21:30,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:21:30,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:21:30,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:21:30,945 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 11:21:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:31,011 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:21:31,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:21:31,011 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 11:21:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:31,012 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:21:31,012 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:21:31,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:21:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:21:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:21:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:21:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:21:31,015 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 11:21:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:31,016 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:21:31,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:21:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:21:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:21:31,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:31,017 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 11:21:31,017 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 11:21:31,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:31,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:21:31,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:31,973 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:31,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:31,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:21:31,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:21:31,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:21:31,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:21:31,974 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 11:21:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:32,241 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:21:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:21:32,241 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 11:21:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:32,242 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:21:32,242 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:21:32,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 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:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:21:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:21:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:21:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:21:32,245 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 11:21:32,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:32,245 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:21:32,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:21:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:21:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:21:32,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:32,246 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 11:21:32,247 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:32,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:32,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 11:21:32,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:32,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:21:32,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:33,370 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:33,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:33,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:21:33,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:21:33,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:21:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:21:33,371 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 11:21:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:33,439 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:21:33,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:21:33,440 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 11:21:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:33,441 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:21:33,441 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:21:33,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:21:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:21:33,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:21:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:21:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:21:33,444 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 11:21:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:33,444 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:21:33,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:21:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:21:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:21:33,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:33,445 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 11:21:33,446 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:33,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:33,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 11:21:33,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:33,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:21:33,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:34,449 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:34,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:34,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:21:34,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:21:34,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:21:34,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:21:34,450 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 11:21:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:34,523 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:21:34,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:21:34,523 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 11:21:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:34,524 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:21:34,524 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:21:34,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:21:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:21:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:21:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:21:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:21:34,528 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 11:21:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:34,528 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:21:34,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:21:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:21:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:21:34,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:34,529 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 11:21:34,529 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:34,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:34,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 11:21:34,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:34,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:21:34,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:35,425 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:35,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:35,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:21:35,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:21:35,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:21:35,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:21:35,427 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 11:21:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:35,506 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:21:35,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:21:35,507 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 11:21:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:35,508 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:21:35,508 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:21:35,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 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:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:21:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:21:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:21:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:21:35,511 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 11:21:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:35,511 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:21:35,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:21:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:21:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:21:35,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:35,512 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 11:21:35,512 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:35,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 11:21:35,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:35,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:21:35,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:36,845 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:36,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:36,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:21:36,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:21:36,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:21:36,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:21:36,847 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 11:21:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:36,907 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:21:36,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:21:36,907 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 11:21:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:36,908 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:21:36,908 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:21:36,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:21:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:21:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:21:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:21:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:21:36,912 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 11:21:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:36,912 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:21:36,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:21:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:21:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:21:36,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:36,914 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 11:21:36,914 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:36,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:36,915 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 11:21:36,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:36,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:21:36,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:38,239 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:38,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:38,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:21:38,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:21:38,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:21:38,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:21:38,241 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 11:21:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:38,316 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:21:38,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:21:38,316 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 11:21:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:38,317 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:21:38,318 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:21:38,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:21:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:21:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:21:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:21:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:21:38,320 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 11:21:38,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:38,321 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:21:38,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:21:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:21:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:21:38,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:38,321 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 11:21:38,322 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:38,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:38,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 11:21:38,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:38,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:21:38,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:40,008 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:40,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:40,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:21:40,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:21:40,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:21:40,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:21:40,010 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 11:21:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:40,080 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:21:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:21:40,080 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 11:21:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:40,081 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:21:40,081 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:21:40,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:21:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:21:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:21:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:21:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:21:40,084 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 11:21:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:40,085 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:21:40,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:21:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:21:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:21:40,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:40,086 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 11:21:40,086 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 11:21:40,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:40,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:21:40,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:41,191 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:41,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:41,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:21:41,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:21:41,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:21:41,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:21:41,192 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 11:21:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:41,276 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:21:41,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:21:41,276 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 11:21:41,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:41,277 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:21:41,277 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:21:41,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 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:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:21:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:21:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:21:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:21:41,280 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 11:21:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:41,280 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:21:41,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:21:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:21:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:21:41,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:41,281 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 11:21:41,281 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:41,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:41,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 11:21:41,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:41,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:21:41,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:42,427 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:42,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:42,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:21:42,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:21:42,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:21:42,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:21:42,428 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 11:21:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:42,504 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:21:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:21:42,505 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 11:21:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:42,506 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:21:42,506 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:21:42,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 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:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:21:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:21:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:21:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:21:42,509 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 11:21:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:42,509 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:21:42,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:21:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:21:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:21:42,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:42,510 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 11:21:42,511 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 11:21:42,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:42,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:21:42,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:44,032 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:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:44,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:21:44,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:21:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:21:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:21:44,034 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 11:21:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:44,147 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:21:44,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:21:44,148 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 11:21:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:44,149 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:21:44,149 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:21:44,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:21:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:21:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:21:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:21:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:21:44,151 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 11:21:44,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:44,152 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:21:44,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:21:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:21:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:21:44,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:44,153 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 11:21:44,153 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:44,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:44,153 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 11:21:44,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:44,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:21:44,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:45,298 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:45,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:45,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:21:45,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:21:45,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:21:45,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:21:45,299 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 11:21:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:45,390 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:21:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:21:45,391 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 11:21:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:45,392 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:21:45,392 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:21:45,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 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:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:21:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:21:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:21:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:21:45,395 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 11:21:45,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:45,396 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:21:45,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:21:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:21:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:21:45,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:45,396 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 11:21:45,397 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 11:21:45,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:45,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:21:45,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:46,612 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:46,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:46,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:21:46,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:21:46,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:21:46,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:21:46,613 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 11:21:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:46,694 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:21:46,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:21:46,695 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 11:21:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:46,696 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:21:46,696 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:21:46,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 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:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:21:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:21:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:21:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:21:46,700 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 11:21:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:46,700 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:21:46,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:21:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:21:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:21:46,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:46,701 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 11:21:46,701 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 11:21:46,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:46,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:21:46,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:48,328 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:48,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:48,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:21:48,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:21:48,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:21:48,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:21:48,330 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 11:21:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:48,408 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:21:48,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:21:48,408 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 11:21:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:48,409 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:21:48,409 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:21:48,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:21:48,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:21:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:21:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:21:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:21:48,412 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 11:21:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:48,413 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:21:48,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:21:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:21:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:21:48,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:48,414 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 11:21:48,414 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:48,414 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 11:21:48,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:48,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:21:48,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:49,996 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:49,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:49,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:21:49,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:21:49,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:21:49,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:21:49,997 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 11:21:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:50,066 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:21:50,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:21:50,066 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 11:21:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:50,067 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:21:50,067 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:21:50,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:21:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:21:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:21:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:21:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:21:50,070 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 11:21:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:50,071 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:21:50,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:21:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:21:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:21:50,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:50,071 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 11:21:50,071 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:50,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:50,072 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 11:21:50,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:50,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:21:50,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:51,435 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:51,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:51,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:21:51,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:21:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:21:51,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:21:51,437 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 11:21:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,542 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:21:51,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:21:51,542 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 11:21:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,543 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:21:51,543 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:21:51,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 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:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:21:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:21:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:21:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:21:51,547 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 11:21:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:51,547 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:21:51,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:21:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:21:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:21:51,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:51,547 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 11:21:51,548 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 11:21:51,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:51,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:21:51,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:52,942 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:52,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:52,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:21:52,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:21:52,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:21:52,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:21:52,943 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 11:21:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:53,104 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:21:53,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:21:53,104 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 11:21:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:53,105 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:21:53,105 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:21:53,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:21:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:21:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:21:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:21:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:21:53,107 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 11:21:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:53,107 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:21:53,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:21:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:21:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:21:53,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:53,107 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 11:21:53,108 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 11:21:53,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:53,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:21:53,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:54,662 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:54,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:54,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:21:54,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:21:54,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:21:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:21:54,663 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 11:21:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:54,770 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:21:54,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:21:54,770 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 11:21:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:54,771 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:21:54,771 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:21:54,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:21:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:21:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:21:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:21:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:21:54,774 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 11:21:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:54,775 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:21:54,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:21:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:21:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:21:54,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:54,776 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 11:21:54,776 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:54,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 11:21:54,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:54,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:21:54,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:56,178 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:21:56,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:56,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:21:56,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:21:56,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:21:56,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:21:56,179 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 11:21:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:56,279 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:21:56,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:21:56,280 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 11:21:56,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:56,281 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:21:56,281 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:21:56,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:21:56,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:21:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:21:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:21:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:21:56,283 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 11:21:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:56,283 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:21:56,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:21:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:21:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:21:56,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:56,284 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 11:21:56,284 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 11:21:56,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:56,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:21:56,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:57,729 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:21:57,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:57,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:21:57,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:21:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:21:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:21:57,731 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 11:21:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:57,839 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:21:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:21:57,840 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 11:21:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:57,840 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:21:57,841 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:21:57,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 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:21:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:21:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:21:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:21:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:21:57,844 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 11:21:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:57,844 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:21:57,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:21:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:21:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:21:57,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:57,845 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 11:21:57,846 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 11:21:57,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:57,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:21:57,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:59,626 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:21:59,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:59,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:21:59,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:21:59,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:21:59,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:21:59,628 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 11:21:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:59,725 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:21:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:21:59,725 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 11:21:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:59,726 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:21:59,726 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:21:59,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:21:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:21:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:21:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:21:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:21:59,729 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 11:21:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:59,730 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:21:59,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:21:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:21:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:21:59,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:59,730 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 11:21:59,731 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 11:21:59,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:59,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:21:59,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:01,326 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:01,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:01,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:22:01,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:22:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:22:01,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:22:01,327 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 11:22:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:01,431 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:22:01,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:22:01,432 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 11:22:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:01,433 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:22:01,433 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:22:01,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:22:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:22:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:22:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:22:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:22:01,435 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 11:22:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:01,436 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:22:01,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:22:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:22:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:22:01,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:01,436 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 11:22:01,436 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:01,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:01,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 11:22:01,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:01,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:22:01,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:03,615 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:03,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:03,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:22:03,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:22:03,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:22:03,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:22:03,617 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 11:22:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:03,709 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:22:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:22:03,709 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 11:22:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:03,710 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:22:03,710 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:22:03,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:22:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:22:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:22:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:22:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:22:03,713 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 11:22:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:03,713 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:22:03,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:22:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:22:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:22:03,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:03,715 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 11:22:03,715 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:03,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 11:22:03,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:03,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:22:03,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:05,506 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:05,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:05,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:22:05,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:22:05,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:22:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:22:05,508 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 11:22:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:05,610 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:22:05,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:22:05,610 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 11:22:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:05,611 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:22:05,611 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:22:05,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 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:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:22:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:22:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:22:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:22:05,614 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 11:22:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:05,614 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:22:05,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:22:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:22:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:22:05,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:05,615 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 11:22:05,615 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 11:22:05,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:05,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:22:05,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:07,245 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:07,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:07,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:22:07,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:22:07,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:22:07,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:22:07,247 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 11:22:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:07,325 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:22:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:22:07,326 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 11:22:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:07,327 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:22:07,327 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:22:07,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:22:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:22:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:22:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:22:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:22:07,329 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 11:22:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:07,330 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:22:07,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:22:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:22:07,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:22:07,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:07,331 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 11:22:07,331 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:07,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:07,332 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 11:22:07,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:07,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:22:07,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:09,189 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:09,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:09,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:22:09,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:22:09,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:22:09,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:22:09,190 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 11:22:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:09,289 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:22:09,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:22:09,289 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 11:22:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:09,290 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:22:09,290 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:22:09,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:22:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:22:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:22:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:22:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:22:09,294 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 11:22:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:09,294 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:22:09,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:22:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:22:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:22:09,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:09,295 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 11:22:09,295 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 11:22:09,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:09,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:22:09,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:11,089 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:11,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:11,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:22:11,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:22:11,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:22:11,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:22:11,091 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 11:22:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:11,201 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:22:11,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:22:11,202 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 11:22:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:11,203 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:22:11,203 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:22:11,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 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:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:22:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:22:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:22:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:22:11,205 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 11:22:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:11,206 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:22:11,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:22:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:22:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:22:11,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:11,207 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 11:22:11,207 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:11,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 11:22:11,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:11,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:22:11,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:13,060 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:13,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:13,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:22:13,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:22:13,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:22:13,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:22:13,061 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 11:22:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:13,157 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:22:13,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:22:13,157 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 11:22:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:13,158 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:22:13,158 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:22:13,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:22:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:22:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:22:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:22:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:22:13,162 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 11:22:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:13,163 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:22:13,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:22:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:22:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:22:13,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:13,163 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 11:22:13,164 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:13,164 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 11:22:13,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:13,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:22:13,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:15,361 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:15,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:15,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:22:15,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:22:15,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:22:15,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:22:15,363 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 11:22:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:15,474 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:22:15,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:22:15,475 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 11:22:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:15,476 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:22:15,476 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:22:15,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:22:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:22:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:22:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:22:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:22:15,479 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 11:22:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:15,479 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:22:15,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:22:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:22:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:22:15,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:15,480 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 11:22:15,480 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:15,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 11:22:15,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:15,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:22:15,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:17,396 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:17,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:17,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:22:17,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:22:17,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:22:17,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:22:17,397 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 11:22:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:17,495 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:22:17,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:22:17,496 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 11:22:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:17,496 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:22:17,497 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:22:17,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 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:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:22:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:22:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:22:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:22:17,500 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 11:22:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:17,500 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:22:17,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:22:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:22:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:22:17,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:17,501 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 11:22:17,501 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:17,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:17,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 11:22:17,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:17,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:22:17,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:19,985 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:19,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:19,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:22:19,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:22:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:22:19,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:22:19,987 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 11:22:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:20,073 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:22:20,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:22:20,074 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 11:22:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:20,075 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:22:20,075 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:22:20,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:22:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:22:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:22:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:22:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:22:20,078 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 11:22:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:20,078 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:22:20,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:22:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:22:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:22:20,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:20,079 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 11:22:20,079 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 11:22:20,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:20,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:22:20,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:22,393 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:22,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:22,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:22:22,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:22:22,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:22:22,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:22:22,394 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 11:22:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:22,504 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:22:22,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:22:22,505 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 11:22:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:22,506 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:22:22,506 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:22:22,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:22:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:22:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:22:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:22:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:22:22,508 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 11:22:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:22,509 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:22:22,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:22:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:22:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:22:22,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:22,510 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 11:22:22,510 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 11:22:22,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:22,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:22:22,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:24,778 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:24,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:24,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:22:24,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:22:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:22:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:22:24,779 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 11:22:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:24,884 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:22:24,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:22:24,884 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 11:22:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:24,885 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:22:24,885 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:22:24,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:22:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:22:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:22:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:22:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:22:24,888 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 11:22:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:24,888 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:22:24,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:22:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:22:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:22:24,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:24,889 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 11:22:24,890 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:24,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:24,890 INFO L82 PathProgramCache]: Analyzing trace with hash 253907654, now seen corresponding path program 77 times [2019-08-05 11:22:24,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:24,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:22:24,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:26,964 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:26,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:26,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:22:26,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:22:26,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:22:26,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:22:26,966 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 11:22:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:27,481 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:22:27,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:22:27,481 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 11:22:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:27,482 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:22:27,482 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:22:27,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 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:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:22:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:22:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:22:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:22:27,485 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 11:22:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:27,486 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:22:27,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:22:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:22:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:22:27,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:27,487 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 11:22:27,487 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:27,487 INFO L82 PathProgramCache]: Analyzing trace with hash -718799264, now seen corresponding path program 78 times [2019-08-05 11:22:27,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:27,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:22:27,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:29,853 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:29,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:29,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:22:29,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:22:29,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:22:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:22:29,855 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 11:22:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:30,067 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:22:30,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:22:30,067 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 11:22:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:30,068 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:22:30,068 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:22:30,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 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:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:22:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:22:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:22:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:22:30,073 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 11:22:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:30,073 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:22:30,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:22:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:22:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:22:30,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:30,074 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 11:22:30,074 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:30,074 INFO L82 PathProgramCache]: Analyzing trace with hash -807942650, now seen corresponding path program 79 times [2019-08-05 11:22:30,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:30,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:22:30,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:32,315 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:32,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:32,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:22:32,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:22:32,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:22:32,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:22:32,317 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 11:22:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:32,432 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:22:32,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:22:32,432 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 11:22:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:32,433 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:22:32,433 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:22:32,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:22:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:22:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:22:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:22:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:22:32,437 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 11:22:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:32,437 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:22:32,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:22:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:22:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:22:32,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:32,438 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 11:22:32,438 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:32,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:32,438 INFO L82 PathProgramCache]: Analyzing trace with hash 723579680, now seen corresponding path program 80 times [2019-08-05 11:22:32,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:32,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:22:32,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:36,128 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:36,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:36,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:22:36,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:22:36,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:22:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:22:36,130 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 11:22:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:37,074 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:22:37,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:22:37,074 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 11:22:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:37,075 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:22:37,075 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:22:37,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:22:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:22:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:22:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:22:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:22:37,077 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 11:22:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:37,078 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:22:37,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:22:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:22:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:22:37,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:37,078 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 11:22:37,079 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:37,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:37,079 INFO L82 PathProgramCache]: Analyzing trace with hash 956131654, now seen corresponding path program 81 times [2019-08-05 11:22:37,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:37,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:22:37,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:39,976 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:39,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:39,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:22:39,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:22:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:22:39,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:22:39,978 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 11:22:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:40,149 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:22:40,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:22:40,149 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 11:22:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:40,150 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:22:40,150 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:22:40,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:22:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:22:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:22:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:22:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:22:40,153 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 11:22:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:40,153 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:22:40,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:22:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:22:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:22:40,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:40,154 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 11:22:40,154 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:40,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:40,154 INFO L82 PathProgramCache]: Analyzing trace with hash -424691744, now seen corresponding path program 82 times [2019-08-05 11:22:40,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:40,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:22:40,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:43,269 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:43,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:43,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:22:43,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:22:43,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:22:43,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:22:43,271 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 11:22:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:43,405 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:22:43,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:22:43,406 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 11:22:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:43,406 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:22:43,407 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:22:43,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:22:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:22:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:22:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:22:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:22:43,409 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 11:22:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:43,409 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:22:43,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:22:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:22:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:22:43,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:43,410 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 11:22:43,411 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash -280544122, now seen corresponding path program 83 times [2019-08-05 11:22:43,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:43,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:22:43,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:45,929 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:45,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:45,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:22:45,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:22:45,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:22:45,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:22:45,931 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 11:22:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:46,145 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:22:46,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:22:46,146 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 11:22:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:46,146 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:22:46,146 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:22:46,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:22:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:22:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:22:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:22:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:22:46,149 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 11:22:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:46,150 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:22:46,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:22:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:22:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:22:46,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:46,151 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 11:22:46,151 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:46,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash -106935136, now seen corresponding path program 84 times [2019-08-05 11:22:46,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:46,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:22:46,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:48,551 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:48,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:48,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:22:48,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:22:48,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:22:48,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:22:48,553 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 11:22:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:48,684 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:22:48,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:22:48,684 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 11:22:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:48,685 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:22:48,685 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:22:48,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:22:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:22:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:22:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:22:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:22:48,688 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 11:22:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:48,688 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:22:48,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:22:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:22:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:22:48,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:48,689 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 11:22:48,690 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:48,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash 979976134, now seen corresponding path program 85 times [2019-08-05 11:22:48,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:48,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:22:48,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:51,289 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:51,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:51,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:22:51,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:22:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:22:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:22:51,291 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 11:22:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:51,486 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:22:51,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:22:51,486 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 11:22:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:51,487 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:22:51,487 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:22:51,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:22:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:22:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:22:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:22:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:22:51,490 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 11:22:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:51,490 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:22:51,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:22:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:22:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:22:51,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:51,491 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 11:22:51,491 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:51,492 INFO L82 PathProgramCache]: Analyzing trace with hash 314487136, now seen corresponding path program 86 times [2019-08-05 11:22:51,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:51,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:22:51,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:54,021 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:22:54,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:54,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:22:54,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:22:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:22:54,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:22:54,023 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 11:22:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:54,154 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:22:54,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:22:54,154 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 11:22:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:54,155 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:22:54,155 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:22:54,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:22:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:22:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:22:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:22:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:22:54,158 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 11:22:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:54,158 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:22:54,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:22:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:22:54,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:22:54,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:54,159 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 11:22:54,159 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:54,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:54,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164678, now seen corresponding path program 87 times [2019-08-05 11:22:54,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:54,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:22:54,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:56,914 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:22:56,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:56,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:22:56,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:22:56,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:22:56,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:22:56,916 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 11:22:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:57,022 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:22:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:22:57,022 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 11:22:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:57,023 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:22:57,023 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:22:57,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 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:22:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:22:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:22:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:22:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:22:57,026 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 11:22:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:57,026 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:22:57,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:22:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:22:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:22:57,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:57,027 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 11:22:57,027 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:57,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364704, now seen corresponding path program 88 times [2019-08-05 11:22:57,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:57,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:22:57,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:59,733 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:22:59,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:59,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:22:59,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:22:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:22:59,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:22:59,735 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 11:23:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:00,009 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:23:00,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:23:00,010 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 11:23:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:00,010 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:23:00,011 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:23:00,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:23:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:23:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 11:23:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:23:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:23:00,014 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 11:23:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:00,014 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:23:00,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:23:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:23:00,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:23:00,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:00,015 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 11:23:00,015 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:00,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663622, now seen corresponding path program 89 times [2019-08-05 11:23:00,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:00,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:23:00,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:02,706 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:02,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:02,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:23:02,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:23:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:23:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:23:02,708 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 11:23:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:02,836 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:23:02,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:23:02,837 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 11:23:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:02,838 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:23:02,838 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:23:02,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:23:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:23:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:23:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:23:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:23:02,840 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 11:23:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:02,841 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:23:02,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:23:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:23:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:23:02,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:02,842 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 11:23:02,842 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:02,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:02,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930080, now seen corresponding path program 90 times [2019-08-05 11:23:02,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:02,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:23:02,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:05,737 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:05,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:05,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:23:05,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:23:05,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:23:05,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:23:05,739 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 11:23:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:05,841 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:23:05,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:23:05,842 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 11:23:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:05,843 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:23:05,843 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:23:05,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:23:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:23:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 11:23:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:23:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:23:05,846 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 11:23:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:05,847 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:23:05,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:23:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:23:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:23:05,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:05,848 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 11:23:05,848 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash 854092166, now seen corresponding path program 91 times [2019-08-05 11:23:05,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:05,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:23:05,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:08,804 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:08,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:08,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:23:08,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:23:08,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:23:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:23:08,806 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 11:23:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:08,931 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:23:08,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:23:08,932 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 11:23:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:08,933 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:23:08,933 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:23:08,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:23:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:23:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:23:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:23:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:23:08,935 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 11:23:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:08,936 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:23:08,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:23:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:23:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:23:08,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:08,936 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 11:23:08,937 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash 707051424, now seen corresponding path program 92 times [2019-08-05 11:23:08,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:08,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:23:08,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:12,472 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:12,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:12,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:23:12,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:23:12,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:23:12,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:23:12,474 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 11:23:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:12,624 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:23:12,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:23:12,625 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 11:23:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:12,626 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:23:12,626 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:23:12,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:23:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:23:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 11:23:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:23:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:23:12,628 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 11:23:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:12,628 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:23:12,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:23:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:23:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:23:12,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:12,629 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 11:23:12,629 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:12,629 INFO L82 PathProgramCache]: Analyzing trace with hash 443755718, now seen corresponding path program 93 times [2019-08-05 11:23:12,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:12,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:23:12,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:15,878 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:15,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:15,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:23:15,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:23:15,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:23:15,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:23:15,880 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 11:23:16,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:16,001 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:23:16,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:23:16,001 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 11:23:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:16,002 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:23:16,002 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:23:16,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:23:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:23:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:23:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:23:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:23:16,005 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 11:23:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:16,006 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:23:16,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:23:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:23:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:23:16,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:16,007 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 11:23:16,007 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:16,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash 871523424, now seen corresponding path program 94 times [2019-08-05 11:23:16,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:16,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:23:16,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:19,486 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:19,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:19,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:23:19,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:23:19,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:23:19,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:23:19,487 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 11:23:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:19,631 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:23:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:23:19,631 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 11:23:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:19,632 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:23:19,632 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:23:19,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:23:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:23:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 11:23:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:23:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:23:19,635 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 11:23:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:19,635 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:23:19,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:23:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:23:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:23:19,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:19,636 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 11:23:19,636 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:19,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:19,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420422, now seen corresponding path program 95 times [2019-08-05 11:23:19,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:19,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:23:19,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:23,018 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:23,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:23,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:23:23,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:23:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:23:23,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:23:23,020 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 11:23:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:23,149 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:23:23,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:23:23,150 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 11:23:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:23,151 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:23:23,151 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:23:23,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:23:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:23:23,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:23:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:23:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:23:23,153 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 11:23:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:23,154 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:23:23,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:23:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:23:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:23:23,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:23,155 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 11:23:23,155 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash 15325472, now seen corresponding path program 96 times [2019-08-05 11:23:23,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:23,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:23:23,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:26,470 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:26,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:26,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:23:26,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:23:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:23:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:23:26,471 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 11:23:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:26,626 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:23:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:23:26,627 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 11:23:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:26,628 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:23:26,628 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:23:26,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 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:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:23:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 11:23:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:23:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:23:26,631 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 11:23:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:26,631 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:23:26,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:23:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:23:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:23:26,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:26,632 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 11:23:26,633 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:26,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:26,633 INFO L82 PathProgramCache]: Analyzing trace with hash 475087686, now seen corresponding path program 97 times [2019-08-05 11:23:26,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:26,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:23:26,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:29,886 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:29,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:29,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:23:29,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:23:29,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:23:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:23:29,888 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 11:23:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:30,071 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:23:30,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:23:30,072 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 11:23:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:30,073 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:23:30,073 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:23:30,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:23:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:23:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 11:23:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:23:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:23:30,076 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 11:23:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:30,077 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:23:30,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:23:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:23:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:23:30,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:30,077 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 11:23:30,078 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814432, now seen corresponding path program 98 times [2019-08-05 11:23:30,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:30,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:23:30,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:33,572 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:33,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:33,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:23:33,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:23:33,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:23:33,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:23:33,573 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 11:23:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:33,709 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:23:33,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:23:33,710 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 11:23:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:33,711 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:23:33,711 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:23:33,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:23:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:23:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 11:23:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:23:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:23:33,714 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 11:23:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:33,714 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:23:33,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:23:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:23:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:23:33,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:33,715 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 11:23:33,715 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:33,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:33,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670598, now seen corresponding path program 99 times [2019-08-05 11:23:33,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:33,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:23:33,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:37,299 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:37,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:37,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:23:37,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:23:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:23:37,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:23:37,301 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 11:23:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:37,470 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:23:37,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:23:37,471 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 11:23:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:37,472 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:23:37,472 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:23:37,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:23:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:23:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 11:23:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:23:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:23:37,475 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 11:23:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:37,475 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:23:37,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:23:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:23:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:23:37,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:37,476 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 11:23:37,476 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:37,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080928, now seen corresponding path program 100 times [2019-08-05 11:23:37,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:37,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:23:37,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:40,938 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:40,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:40,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:23:40,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:23:40,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:23:40,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:23:40,939 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 11:23:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:41,074 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:23:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:23:41,074 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 11:23:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:41,075 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:23:41,075 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:23:41,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:23:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:23:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 11:23:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:23:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:23:41,079 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 11:23:41,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:41,079 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:23:41,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:23:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:23:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:23:41,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:41,080 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 11:23:41,080 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:41,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833862, now seen corresponding path program 101 times [2019-08-05 11:23:41,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:41,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:23:41,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:44,634 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:44,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:44,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:23:44,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:23:44,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:23:44,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:23:44,636 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 11:23:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:44,803 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:23:44,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:23:44,804 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 11:23:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:44,805 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:23:44,805 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:23:44,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 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:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:23:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:23:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:23:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:23:44,808 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 11:23:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:44,808 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:23:44,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:23:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:23:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:23:44,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:44,809 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 11:23:44,809 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:44,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076704, now seen corresponding path program 102 times [2019-08-05 11:23:44,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:44,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:23:44,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:48,719 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:48,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:23:48,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:23:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:23:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:23:48,721 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 11:23:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:48,924 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:23:48,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:23:48,924 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 11:23:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:48,925 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:23:48,925 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:23:48,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:23:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:23:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 11:23:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:23:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:23:48,928 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 11:23:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:48,930 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:23:48,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:23:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:23:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:23:48,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:48,931 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 11:23:48,931 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash 748670214, now seen corresponding path program 103 times [2019-08-05 11:23:48,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:48,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:23:48,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:52,701 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:52,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:52,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:23:52,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:23:52,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:23:52,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:23:52,703 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 11:23:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:52,876 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:23:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:23:52,877 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 11:23:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:52,878 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:23:52,878 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:23:52,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:23:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:23:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 11:23:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:23:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:23:52,881 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 11:23:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:52,881 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:23:52,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:23:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:23:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:23:52,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:52,882 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 11:23:52,882 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:52,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938208, now seen corresponding path program 104 times [2019-08-05 11:23:52,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:52,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:23:52,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:57,092 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:23:57,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:57,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:23:57,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:23:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:23:57,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:23:57,094 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 11:23:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:57,303 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:23:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:23:57,304 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 11:23:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:57,304 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:23:57,304 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:23:57,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:23:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:23:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 11:23:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:23:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:23:57,308 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 11:23:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:57,308 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:23:57,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:23:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:23:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:23:57,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:57,309 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 11:23:57,309 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:57,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492346, now seen corresponding path program 105 times [2019-08-05 11:23:57,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:57,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:23:57,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:01,030 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:01,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:01,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:24:01,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:24:01,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:24:01,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:24:01,032 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 11:24:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:01,226 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:24:01,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:24:01,226 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 11:24:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:01,227 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:24:01,227 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:24:01,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:24:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:24:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:24:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:24:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:24:01,230 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 11:24:01,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:01,231 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:24:01,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:24:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:24:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:24:01,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:01,231 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 11:24:01,232 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash -132755232, now seen corresponding path program 106 times [2019-08-05 11:24:01,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:01,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:24:01,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:05,013 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:05,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:05,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:24:05,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:24:05,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:24:05,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:24:05,015 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 11:24:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:05,179 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:24:05,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:24:05,180 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 11:24:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:05,180 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:24:05,181 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:24:05,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 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:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:24:05,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 11:24:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:24:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:24:05,184 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 11:24:05,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:05,184 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:24:05,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:24:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:24:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:24:05,185 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:05,185 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 11:24:05,185 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash 179553158, now seen corresponding path program 107 times [2019-08-05 11:24:05,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:05,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:24:05,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:09,130 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:09,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:09,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:24:09,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:24:09,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:24:09,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:24:09,132 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 11:24:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:09,321 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:24:09,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:24:09,322 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 11:24:09,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:09,323 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:24:09,323 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:24:09,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:24:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:24:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:24:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:24:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:24:09,325 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 11:24:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:09,326 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:24:09,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:24:09,326 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:24:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:24:09,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:09,327 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 11:24:09,327 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:09,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:09,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178656, now seen corresponding path program 108 times [2019-08-05 11:24:09,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:09,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:24:09,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:13,319 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:13,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:13,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:24:13,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:24:13,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:24:13,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:24:13,321 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 11:24:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:13,480 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:24:13,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:24:13,481 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 11:24:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:13,482 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:24:13,482 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:24:13,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 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:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:24:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 11:24:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:24:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:24:13,485 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 11:24:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:13,485 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:24:13,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:24:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:24:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:24:13,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:13,487 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 11:24:13,487 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:13,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:13,487 INFO L82 PathProgramCache]: Analyzing trace with hash 751830726, now seen corresponding path program 109 times [2019-08-05 11:24:13,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:13,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:24:13,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:17,497 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:17,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:17,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:24:17,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:24:17,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:24:17,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:24:17,499 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 11:24:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:17,716 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:24:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:24:17,717 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 11:24:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:17,717 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:24:17,717 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:24:17,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 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:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:24:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:24:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:24:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:24:17,720 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 11:24:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:17,720 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:24:17,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:24:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:24:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:24:17,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:17,721 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 11:24:17,721 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:17,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914080, now seen corresponding path program 110 times [2019-08-05 11:24:17,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:17,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:24:17,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:21,751 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:21,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:21,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:24:21,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:24:21,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:24:21,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:24:21,754 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 11:24:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:21,952 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:24:21,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:24:21,952 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 11:24:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:21,953 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:24:21,953 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:24:21,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:24:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:24:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 11:24:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:24:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:24:21,956 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 11:24:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:21,956 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:24:21,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:24:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:24:21,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:24:21,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:21,957 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 11:24:21,957 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:21,958 INFO L82 PathProgramCache]: Analyzing trace with hash 954759686, now seen corresponding path program 111 times [2019-08-05 11:24:21,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:21,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:24:21,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:26,080 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:26,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:26,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:24:26,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:24:26,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:24:26,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:24:26,081 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 11:24:26,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:26,256 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:24:26,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:24:26,256 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 11:24:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:26,257 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:24:26,257 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:24:26,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 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:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:24:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 11:24:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:24:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:24:26,260 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 11:24:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:26,260 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:24:26,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:24:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:24:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:24:26,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:26,261 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 11:24:26,261 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash -467222752, now seen corresponding path program 112 times [2019-08-05 11:24:26,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:26,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:24:26,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:30,488 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:30,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:30,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:24:30,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:24:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:24:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:24:30,489 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 11:24:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:30,728 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:24:30,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:24:30,728 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 11:24:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:30,729 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:24:30,729 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:24:30,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:24:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:24:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 11:24:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:24:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:24:30,731 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 11:24:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:30,732 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:24:30,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:24:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:24:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:24:30,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:30,732 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 11:24:30,733 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005370, now seen corresponding path program 113 times [2019-08-05 11:24:30,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:30,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:24:30,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:34,970 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:34,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:34,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:24:34,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:24:34,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:24:34,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:24:34,971 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 11:24:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:35,157 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:24:35,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:24:35,158 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 11:24:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:35,158 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:24:35,159 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:24:35,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:24:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:24:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 11:24:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:24:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:24:35,162 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 11:24:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:35,162 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:24:35,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:24:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:24:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:24:35,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:35,164 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 11:24:35,164 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:35,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439136, now seen corresponding path program 114 times [2019-08-05 11:24:35,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:35,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:24:35,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:39,500 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:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 11:24:39,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 11:24:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 11:24:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:24:39,501 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 11:24:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:39,685 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:24:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 11:24:39,686 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 11:24:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:39,686 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:24:39,687 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:24:39,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:24:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:24:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 11:24:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:24:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 11:24:39,689 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 11:24:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:39,689 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 11:24:39,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 11:24:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 11:24:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:24:39,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:39,690 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 11:24:39,691 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:39,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash 954069126, now seen corresponding path program 115 times [2019-08-05 11:24:39,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:39,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:24:39,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:44,068 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:44,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:44,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 11:24:44,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 11:24:44,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 11:24:44,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:24:44,070 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-05 11:24:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:44,279 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 11:24:44,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 11:24:44,280 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 11:24:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:44,280 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:24:44,280 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:24:44,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:24:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:24:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 11:24:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:24:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:24:44,283 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 11:24:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:44,284 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:24:44,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 11:24:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:24:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:24:44,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:44,284 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 11:24:44,284 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash -488630112, now seen corresponding path program 116 times [2019-08-05 11:24:44,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:44,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:24:44,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:48,862 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:48,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:48,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 11:24:48,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 11:24:48,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 11:24:48,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:24:48,865 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2019-08-05 11:24:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:49,136 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:24:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 11:24:49,136 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2019-08-05 11:24:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:49,137 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:24:49,137 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:24:49,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:24:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:24:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 11:24:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:24:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 11:24:49,140 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 11:24:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:49,140 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 11:24:49,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 11:24:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 11:24:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 11:24:49,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:49,141 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2019-08-05 11:24:49,141 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:49,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333766, now seen corresponding path program 117 times [2019-08-05 11:24:49,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:49,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 11:24:49,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:53,676 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:24:53,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:53,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-05 11:24:53,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 11:24:53,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 11:24:53,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 11:24:53,678 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2019-08-05 11:24:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:53,884 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 11:24:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-05 11:24:53,885 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2019-08-05 11:24:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:53,886 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:24:53,886 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:24:53,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 11:24:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:24:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 11:24:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:24:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:24:53,889 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-05 11:24:53,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:53,889 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:24:53,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-05 11:24:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:24:53,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:24:53,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:53,890 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2019-08-05 11:24:53,890 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:53,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:53,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164640, now seen corresponding path program 118 times [2019-08-05 11:24:53,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:53,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 11:24:53,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:58,475 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:24:58,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:58,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2019-08-05 11:24:58,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-08-05 11:24:58,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-08-05 11:24:58,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 11:24:58,476 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2019-08-05 11:24:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:58,670 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 11:24:58,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-08-05 11:24:58,671 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2019-08-05 11:24:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:58,672 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:24:58,672 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:24:58,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 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:24:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:24:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 11:24:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:24:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 11:24:58,674 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2019-08-05 11:24:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:58,675 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 11:24:58,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-08-05 11:24:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 11:24:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 11:24:58,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:58,676 INFO L399 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2019-08-05 11:24:58,676 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:58,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432826, now seen corresponding path program 119 times [2019-08-05 11:24:58,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:58,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 11:24:58,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:25:03,337 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:25:03,337 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:25:03,341 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:25:03,341 INFO L202 PluginConnector]: Adding new model twoLoops_firstPart.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:25:03 BoogieIcfgContainer [2019-08-05 11:25:03,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:25:03,344 INFO L168 Benchmark]: Toolchain (without parser) took 238980.40 ms. Allocated memory was 141.6 MB in the beginning and 584.1 MB in the end (delta: 442.5 MB). Free memory was 111.0 MB in the beginning and 383.3 MB in the end (delta: -272.3 MB). Peak memory consumption was 170.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:25:03,344 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory is still 111.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:25:03,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.44 ms. Allocated memory is still 141.6 MB. Free memory was 111.0 MB in the beginning and 108.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:25:03,345 INFO L168 Benchmark]: Boogie Preprocessor took 21.50 ms. Allocated memory is still 141.6 MB. Free memory was 108.8 MB in the beginning and 108.0 MB in the end (delta: 872.5 kB). Peak memory consumption was 872.5 kB. Max. memory is 7.1 GB. [2019-08-05 11:25:03,346 INFO L168 Benchmark]: RCFGBuilder took 323.08 ms. Allocated memory is still 141.6 MB. Free memory was 108.0 MB in the beginning and 99.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:25:03,346 INFO L168 Benchmark]: TraceAbstraction took 238595.09 ms. Allocated memory was 141.6 MB in the beginning and 584.1 MB in the end (delta: 442.5 MB). Free memory was 98.6 MB in the beginning and 383.3 MB in the end (delta: -284.7 MB). Peak memory consumption was 157.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:25:03,349 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.23 ms. Allocated memory is still 141.6 MB. Free memory is still 111.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.44 ms. Allocated memory is still 141.6 MB. Free memory was 111.0 MB in the beginning and 108.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.50 ms. Allocated memory is still 141.6 MB. Free memory was 108.8 MB in the beginning and 108.0 MB in the end (delta: 872.5 kB). Peak memory consumption was 872.5 kB. Max. memory is 7.1 GB. * RCFGBuilder took 323.08 ms. Allocated memory is still 141.6 MB. Free memory was 108.0 MB in the beginning and 99.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238595.09 ms. Allocated memory was 141.6 MB in the beginning and 584.1 MB in the end (delta: 442.5 MB). Free memory was 98.6 MB in the beginning and 383.3 MB in the end (delta: -284.7 MB). Peak memory consumption was 157.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 119,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 121 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 238.5s OverallTime, 120 OverallIterations, 119 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 358 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 11232 SolverSat, 225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7259 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 214.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=119, 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, 119 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 216.4s InterpolantComputationTime, 7378 NumberOfCodeBlocks, 7378 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 7259 ConstructedInterpolants, 0 QuantifiedInterpolants, 1735139 SizeOfPredicates, 119 NumberOfNonLiveVariables, 21777 ConjunctsInSsa, 7259 ConjunctsInUnsatCore, 119 InterpolantComputations, 1 PerfectInterpolantSequences, 0/280840 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown