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/loopAccelerationWerner/nestedLoopWithAssertion.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:17:26,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:17:26,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:17:26,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:17:26,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:17:26,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:17:26,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:17:26,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:17:26,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:17:26,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:17:26,222 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:17:26,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:17:26,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:17:26,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:17:26,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:17:26,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:17:26,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:17:26,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:17:26,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:17:26,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:17:26,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:17:26,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:17:26,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:17:26,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:17:26,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:17:26,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:17:26,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:17:26,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:17:26,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:17:26,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:17:26,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:17:26,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:17:26,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:17:26,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:17:26,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:17:26,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:17:26,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:17:26,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:17:26,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:17:26,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:17:26,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:17:26,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:17:26,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:17:26,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:17:26,293 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:17:26,293 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:17:26,294 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/nestedLoopWithAssertion.bpl [2019-08-05 11:17:26,294 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/nestedLoopWithAssertion.bpl' [2019-08-05 11:17:26,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:17:26,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:17:26,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:17:26,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:17:26,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:17:26,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (1/1) ... [2019-08-05 11:17:26,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (1/1) ... [2019-08-05 11:17:26,355 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:17:26,356 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:17:26,356 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:17:26,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:17:26,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:17:26,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:17:26,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:17:26,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (1/1) ... [2019-08-05 11:17:26,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (1/1) ... [2019-08-05 11:17:26,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (1/1) ... [2019-08-05 11:17:26,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (1/1) ... [2019-08-05 11:17:26,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (1/1) ... [2019-08-05 11:17:26,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (1/1) ... [2019-08-05 11:17:26,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (1/1) ... [2019-08-05 11:17:26,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:17:26,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:17:26,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:17:26,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:17:26,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (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:17:26,446 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:17:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:17:26,446 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:17:26,646 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:17:26,647 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:17:26,648 INFO L202 PluginConnector]: Adding new model nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:17:26 BoogieIcfgContainer [2019-08-05 11:17:26,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:17:26,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:17:26,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:17:26,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:17:26,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:26" (1/2) ... [2019-08-05 11:17:26,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7085ce3a and model type nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:17:26, skipping insertion in model container [2019-08-05 11:17:26,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:17:26" (2/2) ... [2019-08-05 11:17:26,656 INFO L109 eAbstractionObserver]: Analyzing ICFG nestedLoopWithAssertion.bpl [2019-08-05 11:17:26,665 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:17:26,672 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 11:17:26,690 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 11:17:26,722 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:17:26,724 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:17:26,724 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:17:26,724 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:17:26,724 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:17:26,725 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:17:26,725 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:17:26,725 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:17:26,725 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:17:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 11:17:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:17:26,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:26,758 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:17:26,761 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:26,768 INFO L82 PathProgramCache]: Analyzing trace with hash 30240, now seen corresponding path program 1 times [2019-08-05 11:17:26,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:26,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:17:26,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:26,934 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:17:26,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:17:26,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:17:26,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:17:26,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:17:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:17:26,956 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-05 11:17:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:27,075 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 11:17:27,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:17:27,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:17:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:27,093 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:17:27,093 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:17:27,103 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:17:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:17:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:17:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:17:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 11:17:27,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 3 [2019-08-05 11:17:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:27,142 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 11:17:27,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:17:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 11:17:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:17:27,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:27,143 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:17:27,144 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:27,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:27,144 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2019-08-05 11:17:27,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:27,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:17:27,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:27,211 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:17:27,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:17:27,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:17:27,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:17:27,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:17:27,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:17:27,217 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 3 states. [2019-08-05 11:17:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:27,290 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 11:17:27,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:17:27,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:17:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:27,292 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:17:27,292 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:17:27,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:17:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:17:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:17:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:17:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:17:27,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 4 [2019-08-05 11:17:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:27,299 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:17:27,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:17:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:17:27,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:17:27,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:27,301 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:17:27,301 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:27,302 INFO L82 PathProgramCache]: Analyzing trace with hash 28756324, now seen corresponding path program 1 times [2019-08-05 11:17:27,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:27,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:17:27,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:27,425 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:17:27,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:27,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:17:27,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:17:27,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:17:27,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:17:27,427 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2019-08-05 11:17:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:27,479 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 11:17:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:17:27,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:17:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:27,480 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:17:27,481 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:17:27,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:17:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:17:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:17:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:17:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 11:17:27,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 5 [2019-08-05 11:17:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:27,485 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 11:17:27,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:17:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 11:17:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:17:27,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:27,486 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:17:27,486 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:27,487 INFO L82 PathProgramCache]: Analyzing trace with hash 891444102, now seen corresponding path program 2 times [2019-08-05 11:17:27,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:27,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:17:27,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:17:27,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:17:27,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:17:27,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:17:27,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:17:27,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:17:27,583 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 4 states. [2019-08-05 11:17:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:27,640 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-08-05 11:17:27,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:17:27,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:17:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:27,641 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:17:27,641 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:17:27,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:17:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:17:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:17:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:17:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:17:27,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 6 [2019-08-05 11:17:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:27,647 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:17:27,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:17:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:17:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:17:27,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:27,648 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 11:17:27,648 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1228485470, now seen corresponding path program 1 times [2019-08-05 11:17:27,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:27,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:17:27,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:27,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:27,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:17:27,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:17:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:17:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:17:27,733 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2019-08-05 11:17:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:27,790 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 11:17:27,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:17:27,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 11:17:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:27,793 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:17:27,794 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:17:27,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:17:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:17:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:17:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:17:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-05 11:17:27,797 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2019-08-05 11:17:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:27,797 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-05 11:17:27,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:17:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-05 11:17:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:17:27,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:27,798 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2019-08-05 11:17:27,799 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:27,799 INFO L82 PathProgramCache]: Analyzing trace with hash -630528896, now seen corresponding path program 2 times [2019-08-05 11:17:27,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:27,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:17:27,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:27,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:27,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:17:27,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:17:27,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:17:27,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:17:27,945 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 6 states. [2019-08-05 11:17:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:28,040 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-08-05 11:17:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:17:28,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:17:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:28,041 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:17:28,041 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:17:28,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:17:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:17:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:17:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:17:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-08-05 11:17:28,045 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2019-08-05 11:17:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:28,045 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-08-05 11:17:28,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:17:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-08-05 11:17:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:17:28,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:28,046 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-05 11:17:28,046 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:28,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:28,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1869567902, now seen corresponding path program 3 times [2019-08-05 11:17:28,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:28,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:17:28,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:28,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:28,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:17:28,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:17:28,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:17:28,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:17:28,217 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2019-08-05 11:17:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:28,258 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-08-05 11:17:28,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:17:28,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:17:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:28,260 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:17:28,260 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:17:28,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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:17:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:17:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:17:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:17:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-08-05 11:17:28,264 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2019-08-05 11:17:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:28,265 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-08-05 11:17:28,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:17:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-08-05 11:17:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:17:28,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:28,266 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1] [2019-08-05 11:17:28,266 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:28,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:28,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2063157312, now seen corresponding path program 4 times [2019-08-05 11:17:28,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:28,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:17:28,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:28,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:28,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:17:28,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:17:28,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:17:28,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:17:28,424 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2019-08-05 11:17:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:28,516 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-08-05 11:17:28,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:17:28,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 11:17:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:28,517 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:17:28,517 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:17:28,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:17:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:17:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:17:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:17:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-08-05 11:17:28,521 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2019-08-05 11:17:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:28,523 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-08-05 11:17:28,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:17:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-08-05 11:17:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:17:28,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:28,525 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2019-08-05 11:17:28,525 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash -525505570, now seen corresponding path program 5 times [2019-08-05 11:17:28,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:28,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:17:28,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:28,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:28,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:17:28,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:17:28,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:17:28,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:17:28,702 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 9 states. [2019-08-05 11:17:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:28,744 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-08-05 11:17:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:17:28,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 11:17:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:28,747 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:17:28,748 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:17:28,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:17:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:17:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:17:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:17:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-05 11:17:28,751 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2019-08-05 11:17:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:28,751 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-05 11:17:28,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:17:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-05 11:17:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:17:28,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:28,752 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 2, 1, 1, 1] [2019-08-05 11:17:28,753 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:28,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:28,753 INFO L82 PathProgramCache]: Analyzing trace with hash 830323712, now seen corresponding path program 6 times [2019-08-05 11:17:28,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:28,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:17:28,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:29,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:29,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:17:29,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:17:29,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:17:29,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:17:29,032 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 10 states. [2019-08-05 11:17:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:29,224 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-08-05 11:17:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:17:29,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:17:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:29,225 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:17:29,225 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:17:29,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:17:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:17:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:17:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:17:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-08-05 11:17:29,229 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-08-05 11:17:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:29,229 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-08-05 11:17:29,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:17:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-08-05 11:17:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:17:29,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:29,230 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2019-08-05 11:17:29,230 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:29,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash -88641506, now seen corresponding path program 7 times [2019-08-05 11:17:29,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:29,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:17:29,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:29,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:29,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:17:29,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:17:29,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:17:29,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:17:29,388 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-08-05 11:17:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:29,433 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-08-05 11:17:29,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:17:29,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-08-05 11:17:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:29,434 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:17:29,434 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:17:29,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:17:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:17:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:17:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:17:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-08-05 11:17:29,438 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-08-05 11:17:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:29,438 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-08-05 11:17:29,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:17:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-08-05 11:17:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:17:29,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:29,439 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 2, 1, 1, 1] [2019-08-05 11:17:29,440 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:29,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1488207808, now seen corresponding path program 8 times [2019-08-05 11:17:29,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:29,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:17:29,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 11 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:29,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:29,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:17:29,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:17:29,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:17:29,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:17:29,634 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 12 states. [2019-08-05 11:17:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:29,688 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-08-05 11:17:29,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:17:29,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-08-05 11:17:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:29,692 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:17:29,692 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:17:29,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:17:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:17:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:17:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:17:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-08-05 11:17:29,696 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2019-08-05 11:17:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:29,696 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-08-05 11:17:29,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:17:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-08-05 11:17:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:17:29,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:29,699 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2019-08-05 11:17:29,699 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1169071010, now seen corresponding path program 9 times [2019-08-05 11:17:29,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:29,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:17:29,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:29,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:29,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:17:29,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:17:29,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:17:29,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:17:29,905 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 13 states. [2019-08-05 11:17:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:29,951 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-08-05 11:17:29,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:17:29,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-08-05 11:17:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:29,951 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:17:29,952 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:17:29,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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:17:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:17:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:17:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:17:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-08-05 11:17:29,956 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-08-05 11:17:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:29,956 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-08-05 11:17:29,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:17:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-08-05 11:17:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:17:29,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:29,957 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 2, 1, 1, 1] [2019-08-05 11:17:29,957 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1940335744, now seen corresponding path program 10 times [2019-08-05 11:17:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:29,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:17:29,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 13 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:30,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:30,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:17:30,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:17:30,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:17:30,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:17:30,177 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-08-05 11:17:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:30,202 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-08-05 11:17:30,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:17:30,202 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-08-05 11:17:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:30,203 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:17:30,203 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:17:30,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:17:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:17:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:17:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:17:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-08-05 11:17:30,207 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2019-08-05 11:17:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:30,207 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-08-05 11:17:30,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:17:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-08-05 11:17:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:17:30,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:30,208 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2019-08-05 11:17:30,208 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:30,209 INFO L82 PathProgramCache]: Analyzing trace with hash -79738722, now seen corresponding path program 11 times [2019-08-05 11:17:30,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:30,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:17:30,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 14 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:30,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:30,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:17:30,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:17:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:17:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:17:30,460 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 15 states. [2019-08-05 11:17:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:30,488 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-08-05 11:17:30,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:17:30,488 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-08-05 11:17:30,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:30,489 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:17:30,490 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:17:30,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:17:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:17:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:17:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:17:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-08-05 11:17:30,493 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2019-08-05 11:17:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:30,494 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-08-05 11:17:30,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:17:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-08-05 11:17:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:17:30,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:30,495 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 2, 1, 1, 1] [2019-08-05 11:17:30,495 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:30,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1764194112, now seen corresponding path program 12 times [2019-08-05 11:17:30,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:30,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:17:30,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 15 proven. 91 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:30,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:30,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:17:30,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:17:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:17:30,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:17:30,705 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 16 states. [2019-08-05 11:17:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:30,736 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-08-05 11:17:30,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:17:30,737 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-08-05 11:17:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:30,738 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:17:30,738 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:17:30,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:17:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:17:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:17:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:17:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-08-05 11:17:30,742 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2019-08-05 11:17:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:30,742 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-08-05 11:17:30,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:17:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-08-05 11:17:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:17:30,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:30,744 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1] [2019-08-05 11:17:30,745 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:30,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:30,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1203430178, now seen corresponding path program 13 times [2019-08-05 11:17:30,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:30,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:17:30,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 16 proven. 105 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:30,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:30,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:17:30,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:17:30,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:17:30,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:17:30,951 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 17 states. [2019-08-05 11:17:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:31,208 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-08-05 11:17:31,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:17:31,208 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-08-05 11:17:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:31,209 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:17:31,209 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:17:31,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:17:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:17:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:17:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:17:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-08-05 11:17:31,212 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2019-08-05 11:17:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:31,212 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-08-05 11:17:31,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:17:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-08-05 11:17:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:17:31,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:31,213 INFO L399 BasicCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1] [2019-08-05 11:17:31,214 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:31,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1289497344, now seen corresponding path program 14 times [2019-08-05 11:17:31,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:31,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:17:31,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 17 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:31,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:31,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:17:31,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:17:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:17:31,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:17:31,449 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 18 states. [2019-08-05 11:17:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:31,489 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-08-05 11:17:31,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:17:31,490 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-08-05 11:17:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:31,491 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:17:31,491 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:17:31,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 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:17:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:17:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:17:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:17:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-08-05 11:17:31,495 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2019-08-05 11:17:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:31,495 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-08-05 11:17:31,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:17:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-08-05 11:17:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:17:31,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:31,496 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1] [2019-08-05 11:17:31,496 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:31,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:31,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1260839198, now seen corresponding path program 15 times [2019-08-05 11:17:31,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:31,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:17:31,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 136 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:31,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:31,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:17:31,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:17:31,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:17:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:17:31,690 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 19 states. [2019-08-05 11:17:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:31,724 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-08-05 11:17:31,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:17:31,724 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-08-05 11:17:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:31,725 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:17:31,725 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:17:31,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 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:17:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:17:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:17:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:17:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-08-05 11:17:31,729 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2019-08-05 11:17:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:31,729 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-08-05 11:17:31,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:17:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-08-05 11:17:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:17:31,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:31,730 INFO L399 BasicCegarLoop]: trace histogram [17, 2, 2, 1, 1, 1] [2019-08-05 11:17:31,731 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash 372436672, now seen corresponding path program 16 times [2019-08-05 11:17:31,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:31,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:17:31,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 19 proven. 153 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:32,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:32,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:17:32,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:17:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:17:32,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:17:32,270 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 20 states. [2019-08-05 11:17:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:32,302 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-08-05 11:17:32,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:17:32,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-08-05 11:17:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:32,303 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:17:32,303 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:17:32,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 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:17:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:17:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:17:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:17:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-08-05 11:17:32,309 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2019-08-05 11:17:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:32,309 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-08-05 11:17:32,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:17:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-08-05 11:17:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:17:32,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:32,310 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1] [2019-08-05 11:17:32,311 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:32,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1398237858, now seen corresponding path program 17 times [2019-08-05 11:17:32,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:32,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:17:32,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 171 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:32,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:32,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:17:32,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:17:32,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:17:32,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:17:32,755 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 21 states. [2019-08-05 11:17:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:32,810 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-08-05 11:17:32,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:17:32,810 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-08-05 11:17:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:32,811 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:17:32,811 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:17:32,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 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:17:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:17:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:17:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:17:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-08-05 11:17:32,815 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2019-08-05 11:17:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:32,816 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-08-05 11:17:32,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:17:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-08-05 11:17:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:17:32,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:32,817 INFO L399 BasicCegarLoop]: trace histogram [19, 2, 2, 1, 1, 1] [2019-08-05 11:17:32,817 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash -454573440, now seen corresponding path program 18 times [2019-08-05 11:17:32,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:32,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:17:32,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 21 proven. 190 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:33,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:33,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:17:33,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:17:33,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:17:33,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:17:33,097 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 22 states. [2019-08-05 11:17:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:33,141 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-08-05 11:17:33,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:17:33,143 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-08-05 11:17:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:33,144 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:17:33,144 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:17:33,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 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:17:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:17:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:17:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:17:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-08-05 11:17:33,147 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2019-08-05 11:17:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:33,147 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-08-05 11:17:33,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:17:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-08-05 11:17:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:17:33,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:33,148 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2019-08-05 11:17:33,148 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:33,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1265747554, now seen corresponding path program 19 times [2019-08-05 11:17:33,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:33,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:17:33,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 22 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:33,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:33,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:17:33,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:17:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:17:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:17:33,460 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 23 states. [2019-08-05 11:17:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:33,541 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-08-05 11:17:33,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:17:33,541 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2019-08-05 11:17:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:33,542 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:17:33,542 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:17:33,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:17:33,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:17:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:17:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:17:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-08-05 11:17:33,547 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2019-08-05 11:17:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:33,547 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-08-05 11:17:33,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:17:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-08-05 11:17:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:17:33,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:33,548 INFO L399 BasicCegarLoop]: trace histogram [21, 2, 2, 1, 1, 1] [2019-08-05 11:17:33,548 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:33,549 INFO L82 PathProgramCache]: Analyzing trace with hash -642341312, now seen corresponding path program 20 times [2019-08-05 11:17:33,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:33,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:17:33,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 23 proven. 231 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:33,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:33,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:17:33,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:17:33,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:17:33,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:17:33,829 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 24 states. [2019-08-05 11:17:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:33,900 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-08-05 11:17:33,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:17:33,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-08-05 11:17:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:33,901 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:17:33,901 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:17:33,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:17:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:17:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:17:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:17:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-08-05 11:17:33,905 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2019-08-05 11:17:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:33,905 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-08-05 11:17:33,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:17:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-08-05 11:17:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:17:33,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:33,906 INFO L399 BasicCegarLoop]: trace histogram [22, 2, 2, 1, 1, 1] [2019-08-05 11:17:33,906 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:33,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:33,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1503383006, now seen corresponding path program 21 times [2019-08-05 11:17:33,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:33,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:17:33,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 24 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:34,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:34,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:17:34,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:17:34,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:17:34,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:17:34,255 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 25 states. [2019-08-05 11:17:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:34,477 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-08-05 11:17:34,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:17:34,477 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-08-05 11:17:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:34,478 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:17:34,478 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:17:34,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 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:17:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:17:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:17:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:17:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-08-05 11:17:34,482 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2019-08-05 11:17:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:34,482 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-08-05 11:17:34,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:17:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-08-05 11:17:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:17:34,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:34,483 INFO L399 BasicCegarLoop]: trace histogram [23, 2, 2, 1, 1, 1] [2019-08-05 11:17:34,483 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash -698639872, now seen corresponding path program 22 times [2019-08-05 11:17:34,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:34,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:17:34,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 25 proven. 276 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:34,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:34,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:17:34,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:17:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:17:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:34,808 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 26 states. [2019-08-05 11:17:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:34,847 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-08-05 11:17:34,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:17:34,847 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-08-05 11:17:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:34,848 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:17:34,848 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:17:34,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:17:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:17:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:17:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-08-05 11:17:34,852 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2019-08-05 11:17:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:34,853 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-08-05 11:17:34,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:17:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-08-05 11:17:34,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:17:34,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:34,853 INFO L399 BasicCegarLoop]: trace histogram [24, 2, 2, 1, 1, 1] [2019-08-05 11:17:34,854 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash -241872354, now seen corresponding path program 23 times [2019-08-05 11:17:34,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:34,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:17:34,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 26 proven. 300 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:35,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:35,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:17:35,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:17:35,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:17:35,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:35,412 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 27 states. [2019-08-05 11:17:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:35,482 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-08-05 11:17:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:17:35,483 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 31 [2019-08-05 11:17:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:35,483 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:17:35,483 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:17:35,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:17:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:17:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:17:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-08-05 11:17:35,486 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2019-08-05 11:17:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:35,487 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-08-05 11:17:35,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:17:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-08-05 11:17:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:17:35,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:35,487 INFO L399 BasicCegarLoop]: trace histogram [25, 2, 2, 1, 1, 1] [2019-08-05 11:17:35,488 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:35,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1033018816, now seen corresponding path program 24 times [2019-08-05 11:17:35,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:35,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:17:35,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 27 proven. 325 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:36,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:36,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:17:36,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:17:36,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:17:36,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:17:36,162 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 28 states. [2019-08-05 11:17:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:36,209 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-08-05 11:17:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:17:36,209 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2019-08-05 11:17:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:36,210 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:17:36,210 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:17:36,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 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:17:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:17:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:17:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:17:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-08-05 11:17:36,214 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 32 [2019-08-05 11:17:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:36,214 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-08-05 11:17:36,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:17:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-08-05 11:17:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:17:36,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:36,215 INFO L399 BasicCegarLoop]: trace histogram [26, 2, 2, 1, 1, 1] [2019-08-05 11:17:36,215 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:36,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1899939422, now seen corresponding path program 25 times [2019-08-05 11:17:36,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:36,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:17:36,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 28 proven. 351 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:36,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:36,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:17:36,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:17:36,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:17:36,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:17:36,950 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 29 states. [2019-08-05 11:17:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:37,001 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-08-05 11:17:37,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:17:37,002 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-08-05 11:17:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:37,003 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:17:37,003 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:17:37,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:17:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:17:37,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:17:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:17:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-08-05 11:17:37,006 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2019-08-05 11:17:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:37,007 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-08-05 11:17:37,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:17:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-08-05 11:17:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:17:37,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:37,007 INFO L399 BasicCegarLoop]: trace histogram [27, 2, 2, 1, 1, 1] [2019-08-05 11:17:37,008 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:37,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:37,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1290292864, now seen corresponding path program 26 times [2019-08-05 11:17:37,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:37,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:17:37,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 29 proven. 378 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:37,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:37,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:17:37,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:17:37,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:17:37,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:17:37,643 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 30 states. [2019-08-05 11:17:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:37,679 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-08-05 11:17:37,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:17:37,680 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-08-05 11:17:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:37,680 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:17:37,680 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:17:37,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:17:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:17:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:17:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:17:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-08-05 11:17:37,685 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2019-08-05 11:17:37,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:37,685 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-08-05 11:17:37,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:17:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-08-05 11:17:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:17:37,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:37,686 INFO L399 BasicCegarLoop]: trace histogram [28, 2, 2, 1, 1, 1] [2019-08-05 11:17:37,686 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1403245922, now seen corresponding path program 27 times [2019-08-05 11:17:37,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:37,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:17:37,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 30 proven. 406 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:38,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:38,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:17:38,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:17:38,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:17:38,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:17:38,345 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 31 states. [2019-08-05 11:17:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:38,394 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-08-05 11:17:38,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:17:38,394 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 35 [2019-08-05 11:17:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:38,395 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:17:38,395 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:17:38,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:17:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:17:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:17:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:17:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-08-05 11:17:38,398 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 35 [2019-08-05 11:17:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:38,398 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-08-05 11:17:38,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:17:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-08-05 11:17:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:17:38,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:38,399 INFO L399 BasicCegarLoop]: trace histogram [29, 2, 2, 1, 1, 1] [2019-08-05 11:17:38,399 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:38,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:38,399 INFO L82 PathProgramCache]: Analyzing trace with hash -609823424, now seen corresponding path program 28 times [2019-08-05 11:17:38,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:38,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:17:38,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 31 proven. 435 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:38,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:38,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:17:38,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:17:38,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:17:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:17:38,958 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 32 states. [2019-08-05 11:17:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:39,068 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-08-05 11:17:39,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:17:39,069 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2019-08-05 11:17:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:39,070 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:17:39,070 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:17:39,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:17:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:17:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:17:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:17:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-08-05 11:17:39,073 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 36 [2019-08-05 11:17:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:39,074 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-08-05 11:17:39,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:17:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-08-05 11:17:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:17:39,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:39,074 INFO L399 BasicCegarLoop]: trace histogram [30, 2, 2, 1, 1, 1] [2019-08-05 11:17:39,075 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:39,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1783529762, now seen corresponding path program 29 times [2019-08-05 11:17:39,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:39,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:17:39,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 32 proven. 465 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:39,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:39,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:17:39,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:17:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:17:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:17:39,767 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 33 states. [2019-08-05 11:17:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:39,824 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-08-05 11:17:39,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:17:39,824 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 37 [2019-08-05 11:17:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:39,825 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:17:39,825 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:17:39,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:17:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:17:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:17:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:17:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-08-05 11:17:39,829 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2019-08-05 11:17:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:39,829 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-08-05 11:17:39,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:17:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-08-05 11:17:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:17:39,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:39,830 INFO L399 BasicCegarLoop]: trace histogram [31, 2, 2, 1, 1, 1] [2019-08-05 11:17:39,830 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash 486279424, now seen corresponding path program 30 times [2019-08-05 11:17:39,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:39,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:17:39,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 33 proven. 496 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:40,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:40,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:17:40,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:17:40,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:17:40,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:17:40,262 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 34 states. [2019-08-05 11:17:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:40,332 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-08-05 11:17:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:17:40,332 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2019-08-05 11:17:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:40,333 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:17:40,333 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:17:40,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 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:17:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:17:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:17:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:17:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-08-05 11:17:40,336 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 38 [2019-08-05 11:17:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:40,336 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-08-05 11:17:40,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:17:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-08-05 11:17:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:17:40,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:40,337 INFO L399 BasicCegarLoop]: trace histogram [32, 2, 2, 1, 1, 1] [2019-08-05 11:17:40,337 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2130887454, now seen corresponding path program 31 times [2019-08-05 11:17:40,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:40,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:17:40,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 34 proven. 528 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:41,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:41,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:17:41,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:17:41,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:17:41,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:17:41,710 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 35 states. [2019-08-05 11:17:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:41,768 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-08-05 11:17:41,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:17:41,768 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 39 [2019-08-05 11:17:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:41,769 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:17:41,769 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:17:41,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:17:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:17:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:17:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:17:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-08-05 11:17:41,772 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2019-08-05 11:17:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:41,772 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-08-05 11:17:41,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:17:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-08-05 11:17:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:17:41,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:41,772 INFO L399 BasicCegarLoop]: trace histogram [33, 2, 2, 1, 1, 1] [2019-08-05 11:17:41,773 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1574128832, now seen corresponding path program 32 times [2019-08-05 11:17:41,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:41,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:17:41,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 35 proven. 561 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:42,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:42,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:17:42,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:17:42,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:17:42,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:17:42,459 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 36 states. [2019-08-05 11:17:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:42,648 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-08-05 11:17:42,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:17:42,648 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-08-05 11:17:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:42,649 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:17:42,649 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:17:42,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 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:17:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:17:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:17:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:17:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-08-05 11:17:42,652 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2019-08-05 11:17:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:42,652 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-08-05 11:17:42,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:17:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-08-05 11:17:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:17:42,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:42,653 INFO L399 BasicCegarLoop]: trace histogram [34, 2, 2, 1, 1, 1] [2019-08-05 11:17:42,653 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:42,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1494480734, now seen corresponding path program 33 times [2019-08-05 11:17:42,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:42,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:17:42,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 36 proven. 595 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:43,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:43,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:17:43,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:17:43,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:17:43,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:17:43,136 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 37 states. [2019-08-05 11:17:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:43,211 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-08-05 11:17:43,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:17:43,211 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 41 [2019-08-05 11:17:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:43,212 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:17:43,212 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:17:43,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:17:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:17:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:17:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:17:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-08-05 11:17:43,215 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2019-08-05 11:17:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:43,215 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-08-05 11:17:43,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:17:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-08-05 11:17:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:17:43,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:43,216 INFO L399 BasicCegarLoop]: trace histogram [35, 2, 2, 1, 1, 1] [2019-08-05 11:17:43,216 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:43,217 INFO L82 PathProgramCache]: Analyzing trace with hash -974610304, now seen corresponding path program 34 times [2019-08-05 11:17:43,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:43,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:17:43,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 37 proven. 630 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:43,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:43,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:17:43,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:17:43,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:17:43,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:17:43,759 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 38 states. [2019-08-05 11:17:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:43,845 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-08-05 11:17:43,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:17:43,845 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 42 [2019-08-05 11:17:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:43,846 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:17:43,846 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:17:43,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 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:17:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:17:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:17:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:17:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-08-05 11:17:43,848 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 42 [2019-08-05 11:17:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:43,849 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-08-05 11:17:43,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:17:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-08-05 11:17:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:17:43,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:43,849 INFO L399 BasicCegarLoop]: trace histogram [36, 2, 2, 1, 1, 1] [2019-08-05 11:17:43,850 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash -207021154, now seen corresponding path program 35 times [2019-08-05 11:17:43,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:43,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:17:43,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 38 proven. 666 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:45,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:45,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:17:45,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:17:45,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:17:45,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:17:45,874 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 39 states. [2019-08-05 11:17:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:45,931 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-08-05 11:17:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:17:45,932 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 43 [2019-08-05 11:17:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:45,933 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:17:45,933 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:17:45,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:17:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:17:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:17:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:17:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-08-05 11:17:45,936 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 43 [2019-08-05 11:17:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:45,936 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-08-05 11:17:45,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:17:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-08-05 11:17:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:17:45,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:45,937 INFO L399 BasicCegarLoop]: trace histogram [37, 2, 2, 1, 1, 1] [2019-08-05 11:17:45,937 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2113406016, now seen corresponding path program 36 times [2019-08-05 11:17:45,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:45,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:17:45,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 39 proven. 703 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:46,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:46,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:17:46,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:17:46,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:17:46,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:17:46,518 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 40 states. [2019-08-05 11:17:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:46,574 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-08-05 11:17:46,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:17:46,575 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 44 [2019-08-05 11:17:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:46,575 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:17:46,575 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:17:46,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:17:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:17:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:17:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:17:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-08-05 11:17:46,578 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 44 [2019-08-05 11:17:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:46,579 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-08-05 11:17:46,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:17:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-08-05 11:17:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:17:46,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:46,579 INFO L399 BasicCegarLoop]: trace histogram [38, 2, 2, 1, 1, 1] [2019-08-05 11:17:46,580 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:46,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1032204254, now seen corresponding path program 37 times [2019-08-05 11:17:46,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:46,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:17:46,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 40 proven. 741 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:47,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:47,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:17:47,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:17:47,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:17:47,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:17:47,155 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 41 states. [2019-08-05 11:17:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:47,269 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-08-05 11:17:47,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:17:47,270 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 45 [2019-08-05 11:17:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:47,271 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:17:47,271 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:17:47,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:17:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:17:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:17:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:17:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-08-05 11:17:47,273 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2019-08-05 11:17:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:47,273 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-08-05 11:17:47,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:17:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-08-05 11:17:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:17:47,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:47,274 INFO L399 BasicCegarLoop]: trace histogram [39, 2, 2, 1, 1, 1] [2019-08-05 11:17:47,274 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:47,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1874688000, now seen corresponding path program 38 times [2019-08-05 11:17:47,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:47,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:17:47,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 41 proven. 780 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:48,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:48,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:17:48,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:17:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:17:48,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:17:48,074 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 42 states. [2019-08-05 11:17:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:48,132 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-08-05 11:17:48,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:17:48,133 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 46 [2019-08-05 11:17:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:48,134 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:17:48,134 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:17:48,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:17:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:17:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:17:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:17:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-08-05 11:17:48,137 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 46 [2019-08-05 11:17:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:48,138 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-08-05 11:17:48,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:17:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-08-05 11:17:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:17:48,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:48,139 INFO L399 BasicCegarLoop]: trace histogram [40, 2, 2, 1, 1, 1] [2019-08-05 11:17:48,139 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:48,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2073086946, now seen corresponding path program 39 times [2019-08-05 11:17:48,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:48,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:17:48,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 42 proven. 820 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:48,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:48,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:17:48,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:17:48,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:17:48,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:17:48,899 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 43 states. [2019-08-05 11:17:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:48,968 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-08-05 11:17:48,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:17:48,968 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 47 [2019-08-05 11:17:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:48,969 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:17:48,970 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:17:48,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 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:17:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:17:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:17:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:17:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-08-05 11:17:48,973 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2019-08-05 11:17:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:48,973 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-08-05 11:17:48,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:17:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-08-05 11:17:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:17:48,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:48,974 INFO L399 BasicCegarLoop]: trace histogram [41, 2, 2, 1, 1, 1] [2019-08-05 11:17:48,974 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash 99941312, now seen corresponding path program 40 times [2019-08-05 11:17:48,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:48,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:17:48,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 43 proven. 861 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:49,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:49,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:17:49,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:17:49,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:17:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:17:49,752 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 44 states. [2019-08-05 11:17:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:49,815 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-08-05 11:17:49,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:17:49,816 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 48 [2019-08-05 11:17:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:49,817 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:17:49,817 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:17:49,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:17:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:17:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:17:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:17:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-08-05 11:17:49,821 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 48 [2019-08-05 11:17:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:49,821 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-08-05 11:17:49,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:17:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-08-05 11:17:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:17:49,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:49,822 INFO L399 BasicCegarLoop]: trace histogram [42, 2, 2, 1, 1, 1] [2019-08-05 11:17:49,822 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:49,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:49,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1255659426, now seen corresponding path program 41 times [2019-08-05 11:17:49,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:49,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:17:49,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 44 proven. 903 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:50,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:50,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:17:50,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:17:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:17:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:17:50,548 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 45 states. [2019-08-05 11:17:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:50,656 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-08-05 11:17:50,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:17:50,656 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 49 [2019-08-05 11:17:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:50,657 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:17:50,657 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:17:50,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:17:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:17:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:17:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:17:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-08-05 11:17:50,660 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 49 [2019-08-05 11:17:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:50,661 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-08-05 11:17:50,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:17:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-08-05 11:17:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:17:50,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:50,661 INFO L399 BasicCegarLoop]: trace histogram [43, 2, 2, 1, 1, 1] [2019-08-05 11:17:50,661 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:50,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:50,662 INFO L82 PathProgramCache]: Analyzing trace with hash -329609344, now seen corresponding path program 42 times [2019-08-05 11:17:50,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:50,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:17:50,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 45 proven. 946 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:51,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:51,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:17:51,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:17:51,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:17:51,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:17:51,394 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 46 states. [2019-08-05 11:17:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:51,451 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-08-05 11:17:51,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:17:51,452 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 50 [2019-08-05 11:17:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:51,452 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:17:51,453 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:17:51,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:17:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:17:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:17:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:17:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-08-05 11:17:51,455 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 50 [2019-08-05 11:17:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:51,455 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-08-05 11:17:51,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:17:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-08-05 11:17:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:17:51,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:51,456 INFO L399 BasicCegarLoop]: trace histogram [44, 2, 2, 1, 1, 1] [2019-08-05 11:17:51,456 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:51,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1686827874, now seen corresponding path program 43 times [2019-08-05 11:17:51,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:51,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:17:51,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 46 proven. 990 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:52,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:52,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:17:52,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:17:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:17:52,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:17:52,216 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 47 states. [2019-08-05 11:17:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:52,681 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-08-05 11:17:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:17:52,681 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 51 [2019-08-05 11:17:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:52,682 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:17:52,682 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:17:52,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:17:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:17:52,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:17:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:17:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-08-05 11:17:52,684 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 51 [2019-08-05 11:17:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:52,684 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-08-05 11:17:52,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:17:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-08-05 11:17:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:17:52,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:52,685 INFO L399 BasicCegarLoop]: trace histogram [45, 2, 2, 1, 1, 1] [2019-08-05 11:17:52,685 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:52,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash -810929344, now seen corresponding path program 44 times [2019-08-05 11:17:52,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:52,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:17:52,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 47 proven. 1035 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:53,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:53,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:17:53,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:17:53,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:17:53,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:17:53,644 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 48 states. [2019-08-05 11:17:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:53,700 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-08-05 11:17:53,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:17:53,700 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 52 [2019-08-05 11:17:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:53,701 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:17:53,701 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:17:53,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 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:17:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:17:53,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:17:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:17:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-08-05 11:17:53,705 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 52 [2019-08-05 11:17:53,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:53,705 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-08-05 11:17:53,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:17:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-08-05 11:17:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:17:53,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:53,706 INFO L399 BasicCegarLoop]: trace histogram [46, 2, 2, 1, 1, 1] [2019-08-05 11:17:53,706 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash 572121310, now seen corresponding path program 45 times [2019-08-05 11:17:53,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:53,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:17:53,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 48 proven. 1081 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:54,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:54,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:17:54,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:17:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:17:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:17:54,537 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 49 states. [2019-08-05 11:17:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:54,595 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-08-05 11:17:54,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:17:54,596 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 53 [2019-08-05 11:17:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:54,597 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:17:54,597 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:17:54,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:17:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:17:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:17:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:17:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-08-05 11:17:54,600 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 53 [2019-08-05 11:17:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:54,600 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-08-05 11:17:54,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:17:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-08-05 11:17:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:17:54,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:54,601 INFO L399 BasicCegarLoop]: trace histogram [47, 2, 2, 1, 1, 1] [2019-08-05 11:17:54,601 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:54,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:54,602 INFO L82 PathProgramCache]: Analyzing trace with hash 497018624, now seen corresponding path program 46 times [2019-08-05 11:17:54,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:54,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:17:54,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1178 backedges. 49 proven. 1128 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:55,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:55,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:17:55,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:17:55,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:17:55,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:17:55,602 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 50 states. [2019-08-05 11:17:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:55,669 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-08-05 11:17:55,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:17:55,670 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 54 [2019-08-05 11:17:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:55,671 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:17:55,671 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:17:55,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 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:17:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:17:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:17:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:17:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-08-05 11:17:55,674 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 54 [2019-08-05 11:17:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:55,675 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-08-05 11:17:55,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:17:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-08-05 11:17:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:17:55,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:55,676 INFO L399 BasicCegarLoop]: trace histogram [48, 2, 2, 1, 1, 1] [2019-08-05 11:17:55,676 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:55,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1831164642, now seen corresponding path program 47 times [2019-08-05 11:17:55,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:55,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:17:55,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 50 proven. 1176 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:56,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:56,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:17:56,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:17:56,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:17:56,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:17:56,631 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 51 states. [2019-08-05 11:17:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:56,703 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-08-05 11:17:56,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:17:56,704 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 55 [2019-08-05 11:17:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:56,705 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:17:56,705 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:17:56,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:17:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:17:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:17:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:17:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-08-05 11:17:56,707 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 55 [2019-08-05 11:17:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:56,708 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-08-05 11:17:56,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:17:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-08-05 11:17:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:17:56,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:56,709 INFO L399 BasicCegarLoop]: trace histogram [49, 2, 2, 1, 1, 1] [2019-08-05 11:17:56,709 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:56,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash -990401856, now seen corresponding path program 48 times [2019-08-05 11:17:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:56,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:17:56,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1277 backedges. 51 proven. 1225 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:58,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:58,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:17:58,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:17:58,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:17:58,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:17:58,177 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 52 states. [2019-08-05 11:17:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:58,275 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-08-05 11:17:58,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:17:58,275 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 56 [2019-08-05 11:17:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:58,276 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:17:58,276 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:17:58,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:17:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:17:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:17:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:17:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-08-05 11:17:58,279 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 56 [2019-08-05 11:17:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:58,280 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-08-05 11:17:58,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:17:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-08-05 11:17:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:17:58,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:58,280 INFO L399 BasicCegarLoop]: trace histogram [50, 2, 2, 1, 1, 1] [2019-08-05 11:17:58,281 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash -696559266, now seen corresponding path program 49 times [2019-08-05 11:17:58,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:58,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:17:58,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 52 proven. 1275 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:17:59,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:59,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:17:59,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:17:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:17:59,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:17:59,447 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 53 states. [2019-08-05 11:17:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:59,533 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-08-05 11:17:59,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:17:59,534 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 57 [2019-08-05 11:17:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:59,534 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:17:59,534 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:17:59,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:17:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:17:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:17:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:17:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-08-05 11:17:59,537 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2019-08-05 11:17:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:59,538 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-08-05 11:17:59,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:17:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-08-05 11:17:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:17:59,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:59,538 INFO L399 BasicCegarLoop]: trace histogram [51, 2, 2, 1, 1, 1] [2019-08-05 11:17:59,539 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:59,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:59,539 INFO L82 PathProgramCache]: Analyzing trace with hash -177373568, now seen corresponding path program 50 times [2019-08-05 11:17:59,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:59,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:17:59,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 53 proven. 1326 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:00,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:00,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:18:00,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:18:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:18:00,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:18:00,877 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 54 states. [2019-08-05 11:18:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:01,055 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-08-05 11:18:01,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:18:01,056 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 58 [2019-08-05 11:18:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:01,056 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:18:01,056 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:18:01,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:18:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:18:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:18:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:18:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-08-05 11:18:01,059 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 58 [2019-08-05 11:18:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:01,059 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-08-05 11:18:01,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:18:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-08-05 11:18:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:18:01,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:01,060 INFO L399 BasicCegarLoop]: trace histogram [52, 2, 2, 1, 1, 1] [2019-08-05 11:18:01,060 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1262486114, now seen corresponding path program 51 times [2019-08-05 11:18:01,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:01,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:18:01,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 54 proven. 1378 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:02,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:02,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:18:02,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:18:02,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:18:02,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:18:02,344 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 55 states. [2019-08-05 11:18:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:02,414 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-08-05 11:18:02,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:18:02,414 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 59 [2019-08-05 11:18:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:02,415 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:18:02,415 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:18:02,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:18:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:18:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:18:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:18:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-08-05 11:18:02,419 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2019-08-05 11:18:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:02,419 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-08-05 11:18:02,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:18:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-08-05 11:18:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:18:02,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:02,420 INFO L399 BasicCegarLoop]: trace histogram [53, 2, 2, 1, 1, 1] [2019-08-05 11:18:02,420 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash -541236672, now seen corresponding path program 52 times [2019-08-05 11:18:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:02,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:18:02,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 55 proven. 1431 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:03,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:03,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:18:03,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:18:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:18:03,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:18:03,848 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 56 states. [2019-08-05 11:18:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:03,910 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-08-05 11:18:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:18:03,910 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 60 [2019-08-05 11:18:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:03,911 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:18:03,911 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:18:03,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:18:03,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:18:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:18:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:18:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2019-08-05 11:18:03,914 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 60 [2019-08-05 11:18:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:03,914 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2019-08-05 11:18:03,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:18:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2019-08-05 11:18:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:18:03,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:03,915 INFO L399 BasicCegarLoop]: trace histogram [54, 2, 2, 1, 1, 1] [2019-08-05 11:18:03,915 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 342659550, now seen corresponding path program 53 times [2019-08-05 11:18:03,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:03,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:18:03,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 56 proven. 1485 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:05,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:05,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:18:05,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:18:05,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:18:05,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:18:05,060 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 57 states. [2019-08-05 11:18:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:05,298 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-08-05 11:18:05,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:18:05,299 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 61 [2019-08-05 11:18:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:05,300 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:18:05,300 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:18:05,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:18:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:18:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:18:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:18:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-08-05 11:18:05,303 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 61 [2019-08-05 11:18:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:05,303 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-08-05 11:18:05,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:18:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-08-05 11:18:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:18:05,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:05,304 INFO L399 BasicCegarLoop]: trace histogram [55, 2, 2, 1, 1, 1] [2019-08-05 11:18:05,304 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1973638656, now seen corresponding path program 54 times [2019-08-05 11:18:05,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:05,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:18:05,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1598 backedges. 57 proven. 1540 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:06,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:06,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:18:06,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:18:06,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:18:06,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:18:06,419 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 58 states. [2019-08-05 11:18:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:06,514 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-08-05 11:18:06,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:18:06,514 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 62 [2019-08-05 11:18:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:06,515 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:18:06,515 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:18:06,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:18:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:18:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:18:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:18:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-08-05 11:18:06,518 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 62 [2019-08-05 11:18:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:06,518 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-08-05 11:18:06,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:18:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-08-05 11:18:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:18:06,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:06,519 INFO L399 BasicCegarLoop]: trace histogram [56, 2, 2, 1, 1, 1] [2019-08-05 11:18:06,520 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash 994383390, now seen corresponding path program 55 times [2019-08-05 11:18:06,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:06,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:18:06,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 58 proven. 1596 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:07,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:07,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:18:07,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:18:07,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:18:07,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:18:07,991 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 59 states. [2019-08-05 11:18:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:08,139 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-08-05 11:18:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:18:08,139 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 63 [2019-08-05 11:18:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:08,140 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:18:08,140 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:18:08,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:18:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:18:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:18:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:18:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-08-05 11:18:08,143 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2019-08-05 11:18:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:08,143 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-08-05 11:18:08,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:18:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-08-05 11:18:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:18:08,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:08,143 INFO L399 BasicCegarLoop]: trace histogram [57, 2, 2, 1, 1, 1] [2019-08-05 11:18:08,144 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash 702241216, now seen corresponding path program 56 times [2019-08-05 11:18:08,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:08,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:18:08,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 59 proven. 1653 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:09,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:09,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:18:09,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:18:09,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:18:09,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:18:09,364 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 60 states. [2019-08-05 11:18:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:09,465 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-08-05 11:18:09,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:18:09,465 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 64 [2019-08-05 11:18:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:09,466 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:18:09,466 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:18:09,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:18:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:18:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:18:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:18:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-08-05 11:18:09,469 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 64 [2019-08-05 11:18:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:09,469 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-08-05 11:18:09,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:18:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-08-05 11:18:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:18:09,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:09,470 INFO L399 BasicCegarLoop]: trace histogram [58, 2, 2, 1, 1, 1] [2019-08-05 11:18:09,470 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:09,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash 235768414, now seen corresponding path program 57 times [2019-08-05 11:18:09,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:09,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:18:09,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 60 proven. 1711 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:10,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:10,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:18:10,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:18:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:18:10,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:18:10,746 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 61 states. [2019-08-05 11:18:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:10,817 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-08-05 11:18:10,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:18:10,817 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 65 [2019-08-05 11:18:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:10,818 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:18:10,818 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:18:10,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:18:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:18:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:18:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:18:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-08-05 11:18:10,821 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 65 [2019-08-05 11:18:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:10,821 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-08-05 11:18:10,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:18:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-08-05 11:18:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:18:10,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:10,822 INFO L399 BasicCegarLoop]: trace histogram [59, 2, 2, 1, 1, 1] [2019-08-05 11:18:10,822 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1339986560, now seen corresponding path program 58 times [2019-08-05 11:18:10,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:10,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:18:10,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1832 backedges. 61 proven. 1770 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:12,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:12,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:18:12,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:18:12,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:18:12,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:18:12,153 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 62 states. [2019-08-05 11:18:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:12,253 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-08-05 11:18:12,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:18:12,253 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 66 [2019-08-05 11:18:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:12,254 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:18:12,254 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:18:12,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 5 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:18:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:18:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:18:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:18:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-08-05 11:18:12,257 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 66 [2019-08-05 11:18:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:12,257 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-08-05 11:18:12,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:18:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-08-05 11:18:12,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:18:12,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:12,258 INFO L399 BasicCegarLoop]: trace histogram [60, 2, 2, 1, 1, 1] [2019-08-05 11:18:12,258 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:12,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:12,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1351216798, now seen corresponding path program 59 times [2019-08-05 11:18:12,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:12,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:18:12,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 62 proven. 1830 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:13,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:13,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:18:13,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:18:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:18:13,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:18:13,835 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 63 states. [2019-08-05 11:18:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:13,916 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-08-05 11:18:13,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:18:13,917 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 67 [2019-08-05 11:18:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:13,917 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:18:13,918 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:18:13,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:18:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:18:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:18:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:18:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-08-05 11:18:13,923 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 67 [2019-08-05 11:18:13,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:13,923 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-08-05 11:18:13,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:18:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-08-05 11:18:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:18:13,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:13,924 INFO L399 BasicCegarLoop]: trace histogram [61, 2, 2, 1, 1, 1] [2019-08-05 11:18:13,924 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:13,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1120825024, now seen corresponding path program 60 times [2019-08-05 11:18:13,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:13,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:18:13,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1955 backedges. 63 proven. 1891 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:15,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:15,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:18:15,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:18:15,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:18:15,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:18:15,324 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 64 states. [2019-08-05 11:18:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:15,416 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-08-05 11:18:15,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:18:15,416 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 68 [2019-08-05 11:18:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:15,417 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:18:15,417 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:18:15,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:18:15,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:18:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:18:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:18:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2019-08-05 11:18:15,420 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 68 [2019-08-05 11:18:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:15,421 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2019-08-05 11:18:15,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:18:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2019-08-05 11:18:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:18:15,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:15,422 INFO L399 BasicCegarLoop]: trace histogram [62, 2, 2, 1, 1, 1] [2019-08-05 11:18:15,422 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash -444710178, now seen corresponding path program 61 times [2019-08-05 11:18:15,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:15,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:18:15,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 64 proven. 1953 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:16,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:16,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:18:16,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:18:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:18:16,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:18:16,864 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 65 states. [2019-08-05 11:18:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:16,973 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-08-05 11:18:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:18:16,974 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 69 [2019-08-05 11:18:16,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:16,975 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:18:16,975 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:18:16,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:18:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:18:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:18:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:18:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-08-05 11:18:16,978 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 69 [2019-08-05 11:18:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:16,979 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-08-05 11:18:16,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:18:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-08-05 11:18:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:18:16,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:16,979 INFO L399 BasicCegarLoop]: trace histogram [63, 2, 2, 1, 1, 1] [2019-08-05 11:18:16,980 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash -959986432, now seen corresponding path program 62 times [2019-08-05 11:18:16,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:16,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:18:16,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 65 proven. 2016 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:18,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:18,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:18:18,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:18:18,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:18:18,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:18:18,769 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 66 states. [2019-08-05 11:18:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:18,851 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-08-05 11:18:18,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:18:18,851 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 70 [2019-08-05 11:18:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:18,852 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:18:18,852 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:18:18,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:18:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:18:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:18:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:18:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-08-05 11:18:18,855 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 70 [2019-08-05 11:18:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:18,856 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-08-05 11:18:18,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:18:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-08-05 11:18:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:18:18,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:18,856 INFO L399 BasicCegarLoop]: trace histogram [64, 2, 2, 1, 1, 1] [2019-08-05 11:18:18,857 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash 246318878, now seen corresponding path program 63 times [2019-08-05 11:18:18,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:18,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:18:18,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 66 proven. 2080 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:20,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:20,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:18:20,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:18:20,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:18:20,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:18:20,338 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 67 states. [2019-08-05 11:18:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:20,450 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-08-05 11:18:20,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:18:20,451 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 71 [2019-08-05 11:18:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:20,452 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:18:20,452 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:18:20,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:18:20,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:18:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:18:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:18:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-08-05 11:18:20,455 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 71 [2019-08-05 11:18:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:20,456 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-08-05 11:18:20,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:18:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-08-05 11:18:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:18:20,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:20,456 INFO L399 BasicCegarLoop]: trace histogram [65, 2, 2, 1, 1, 1] [2019-08-05 11:18:20,457 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:20,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:20,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1012922176, now seen corresponding path program 64 times [2019-08-05 11:18:20,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:20,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:18:20,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2213 backedges. 67 proven. 2145 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:22,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:22,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:18:22,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:18:22,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:18:22,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:18:22,346 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 68 states. [2019-08-05 11:18:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:22,459 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-08-05 11:18:22,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:18:22,460 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 72 [2019-08-05 11:18:22,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:22,461 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:18:22,461 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:18:22,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:18:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:18:22,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:18:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:18:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-08-05 11:18:22,464 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 72 [2019-08-05 11:18:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:22,464 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-08-05 11:18:22,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:18:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-08-05 11:18:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:18:22,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:22,465 INFO L399 BasicCegarLoop]: trace histogram [66, 2, 2, 1, 1, 1] [2019-08-05 11:18:22,465 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:22,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1394689186, now seen corresponding path program 65 times [2019-08-05 11:18:22,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:22,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:18:22,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 68 proven. 2211 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:24,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:24,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:18:24,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:18:24,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:18:24,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:18:24,399 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 69 states. [2019-08-05 11:18:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:24,490 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2019-08-05 11:18:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:18:24,490 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 73 [2019-08-05 11:18:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:24,491 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:18:24,491 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:18:24,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:18:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:18:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:18:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:18:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-08-05 11:18:24,494 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 73 [2019-08-05 11:18:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:24,495 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-08-05 11:18:24,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:18:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-08-05 11:18:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:18:24,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:24,495 INFO L399 BasicCegarLoop]: trace histogram [67, 2, 2, 1, 1, 1] [2019-08-05 11:18:24,496 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash -344564608, now seen corresponding path program 66 times [2019-08-05 11:18:24,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:24,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:18:24,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2348 backedges. 69 proven. 2278 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:26,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:26,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:18:26,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:18:26,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:18:26,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:18:26,101 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 70 states. [2019-08-05 11:18:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:26,563 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-08-05 11:18:26,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:18:26,563 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 74 [2019-08-05 11:18:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:26,564 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:18:26,564 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:18:26,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:18:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:18:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:18:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:18:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-08-05 11:18:26,567 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 74 [2019-08-05 11:18:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:26,568 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-08-05 11:18:26,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:18:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-08-05 11:18:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:18:26,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:26,568 INFO L399 BasicCegarLoop]: trace histogram [68, 2, 2, 1, 1, 1] [2019-08-05 11:18:26,568 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:26,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:26,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2144526238, now seen corresponding path program 67 times [2019-08-05 11:18:26,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:26,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:18:26,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2417 backedges. 70 proven. 2346 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:29,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:29,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:18:29,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:18:29,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:18:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:18:29,403 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 71 states. [2019-08-05 11:18:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:29,524 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-08-05 11:18:29,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:18:29,525 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 75 [2019-08-05 11:18:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:29,526 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:18:29,526 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:18:29,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:18:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:18:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:18:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:18:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-08-05 11:18:29,529 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 75 [2019-08-05 11:18:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:29,529 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-08-05 11:18:29,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:18:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-08-05 11:18:29,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:18:29,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:29,530 INFO L399 BasicCegarLoop]: trace histogram [69, 2, 2, 1, 1, 1] [2019-08-05 11:18:29,530 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:29,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:29,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1996931136, now seen corresponding path program 68 times [2019-08-05 11:18:29,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:29,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:18:29,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2487 backedges. 71 proven. 2415 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:31,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:31,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:18:31,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:18:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:18:31,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:18:31,472 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 72 states. [2019-08-05 11:18:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:31,561 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2019-08-05 11:18:31,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:18:31,561 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 76 [2019-08-05 11:18:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:31,562 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:18:31,562 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:18:31,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:18:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:18:31,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:18:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:18:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-08-05 11:18:31,565 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 76 [2019-08-05 11:18:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:31,566 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2019-08-05 11:18:31,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:18:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2019-08-05 11:18:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:18:31,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:31,566 INFO L399 BasicCegarLoop]: trace histogram [70, 2, 2, 1, 1, 1] [2019-08-05 11:18:31,567 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:31,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1716450270, now seen corresponding path program 69 times [2019-08-05 11:18:31,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:31,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:18:31,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 72 proven. 2485 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:33,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:33,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:18:33,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:18:33,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:18:33,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:18:33,706 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 73 states. [2019-08-05 11:18:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:33,815 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-08-05 11:18:33,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:18:33,815 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 77 [2019-08-05 11:18:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:33,816 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:18:33,817 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:18:33,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:18:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:18:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:18:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:18:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-08-05 11:18:33,819 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 77 [2019-08-05 11:18:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:33,819 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-08-05 11:18:33,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:18:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-08-05 11:18:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:18:33,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:33,820 INFO L399 BasicCegarLoop]: trace histogram [71, 2, 2, 1, 1, 1] [2019-08-05 11:18:33,820 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:33,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:33,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1611478016, now seen corresponding path program 70 times [2019-08-05 11:18:33,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:33,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:18:33,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2630 backedges. 73 proven. 2556 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:35,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:35,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:18:35,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:18:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:18:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:18:35,762 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 74 states. [2019-08-05 11:18:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:35,863 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-08-05 11:18:35,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:18:35,864 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 78 [2019-08-05 11:18:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:35,865 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:18:35,865 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:18:35,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:18:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:18:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:18:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:18:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2019-08-05 11:18:35,868 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 78 [2019-08-05 11:18:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:35,868 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2019-08-05 11:18:35,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:18:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2019-08-05 11:18:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:18:35,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:35,869 INFO L399 BasicCegarLoop]: trace histogram [72, 2, 2, 1, 1, 1] [2019-08-05 11:18:35,869 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:35,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1642661858, now seen corresponding path program 71 times [2019-08-05 11:18:35,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:35,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:18:35,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2703 backedges. 74 proven. 2628 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:37,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:37,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:18:37,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:18:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:18:37,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:18:37,986 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 75 states. [2019-08-05 11:18:38,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:38,077 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-08-05 11:18:38,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:18:38,077 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 79 [2019-08-05 11:18:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:38,078 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:18:38,078 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:18:38,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:18:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:18:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:18:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:18:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-08-05 11:18:38,080 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 79 [2019-08-05 11:18:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:38,080 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-08-05 11:18:38,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:18:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-08-05 11:18:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:18:38,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:38,081 INFO L399 BasicCegarLoop]: trace histogram [73, 2, 2, 1, 1, 1] [2019-08-05 11:18:38,081 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:38,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:38,082 INFO L82 PathProgramCache]: Analyzing trace with hash 558217152, now seen corresponding path program 72 times [2019-08-05 11:18:38,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:38,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:18:38,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2777 backedges. 75 proven. 2701 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:40,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:40,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:18:40,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:18:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:18:40,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:18:40,321 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 76 states. [2019-08-05 11:18:40,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:40,442 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-08-05 11:18:40,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:18:40,442 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 80 [2019-08-05 11:18:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:40,443 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:18:40,443 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:18:40,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:18:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:18:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:18:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:18:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-08-05 11:18:40,446 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 80 [2019-08-05 11:18:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:40,446 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-08-05 11:18:40,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:18:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-08-05 11:18:40,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:18:40,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:40,447 INFO L399 BasicCegarLoop]: trace histogram [74, 2, 2, 1, 1, 1] [2019-08-05 11:18:40,447 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:40,448 INFO L82 PathProgramCache]: Analyzing trace with hash 65989726, now seen corresponding path program 73 times [2019-08-05 11:18:40,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:40,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:18:40,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 76 proven. 2775 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:42,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:42,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:18:42,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:18:42,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:18:42,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:18:42,442 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 77 states. [2019-08-05 11:18:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:42,560 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-08-05 11:18:42,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:18:42,560 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 81 [2019-08-05 11:18:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:42,561 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:18:42,561 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:18:42,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:18:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:18:42,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:18:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:18:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-08-05 11:18:42,563 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 81 [2019-08-05 11:18:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:42,564 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-08-05 11:18:42,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:18:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-08-05 11:18:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:18:42,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:42,564 INFO L399 BasicCegarLoop]: trace histogram [75, 2, 2, 1, 1, 1] [2019-08-05 11:18:42,564 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:42,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:42,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1986808704, now seen corresponding path program 74 times [2019-08-05 11:18:42,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:42,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:18:42,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 77 proven. 2850 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:45,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:45,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:18:45,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:18:45,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:18:45,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:18:45,022 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 78 states. [2019-08-05 11:18:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:45,137 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2019-08-05 11:18:45,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:18:45,138 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 82 [2019-08-05 11:18:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:45,138 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:18:45,139 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:18:45,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:18:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:18:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:18:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:18:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-08-05 11:18:45,141 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 82 [2019-08-05 11:18:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:45,141 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-08-05 11:18:45,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:18:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-08-05 11:18:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:18:45,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:45,141 INFO L399 BasicCegarLoop]: trace histogram [76, 2, 2, 1, 1, 1] [2019-08-05 11:18:45,142 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:45,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:45,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1402654878, now seen corresponding path program 75 times [2019-08-05 11:18:45,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:45,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:18:45,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3005 backedges. 78 proven. 2926 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:47,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:47,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:18:47,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:18:47,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:18:47,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:18:47,170 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 79 states. [2019-08-05 11:18:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:47,286 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-08-05 11:18:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:18:47,287 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 83 [2019-08-05 11:18:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:47,288 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:18:47,288 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:18:47,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:18:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:18:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:18:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:18:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-08-05 11:18:47,291 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 83 [2019-08-05 11:18:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:47,291 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-08-05 11:18:47,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:18:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-08-05 11:18:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:18:47,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:47,292 INFO L399 BasicCegarLoop]: trace histogram [77, 2, 2, 1, 1, 1] [2019-08-05 11:18:47,292 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash 473755456, now seen corresponding path program 76 times [2019-08-05 11:18:47,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:47,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:18:47,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3083 backedges. 79 proven. 3003 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:49,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:49,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:18:49,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:18:49,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:18:49,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:18:49,532 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 80 states. [2019-08-05 11:18:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:49,651 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-08-05 11:18:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:18:49,652 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 84 [2019-08-05 11:18:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:49,653 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:18:49,653 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:18:49,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:18:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:18:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:18:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:18:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2019-08-05 11:18:49,656 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 84 [2019-08-05 11:18:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:49,656 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2019-08-05 11:18:49,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:18:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2019-08-05 11:18:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:18:49,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:49,657 INFO L399 BasicCegarLoop]: trace histogram [78, 2, 2, 1, 1, 1] [2019-08-05 11:18:49,657 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:49,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1742644446, now seen corresponding path program 77 times [2019-08-05 11:18:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:49,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:18:49,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3162 backedges. 80 proven. 3081 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:52,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:52,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:18:52,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:18:52,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:18:52,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:18:52,991 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 81 states. [2019-08-05 11:18:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:53,107 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-08-05 11:18:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:18:53,108 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 85 [2019-08-05 11:18:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:53,109 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:18:53,109 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:18:53,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:18:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:18:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:18:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:18:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-08-05 11:18:53,112 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 85 [2019-08-05 11:18:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:53,112 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-08-05 11:18:53,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:18:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-08-05 11:18:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:18:53,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:53,113 INFO L399 BasicCegarLoop]: trace histogram [79, 2, 2, 1, 1, 1] [2019-08-05 11:18:53,113 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1871469824, now seen corresponding path program 78 times [2019-08-05 11:18:53,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:53,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:18:53,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3242 backedges. 81 proven. 3160 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:55,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:55,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:18:55,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:18:55,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:18:55,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:18:55,574 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 82 states. [2019-08-05 11:18:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:56,573 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-08-05 11:18:56,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:18:56,573 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 86 [2019-08-05 11:18:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:56,574 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:18:56,574 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:18:56,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:18:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:18:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 11:18:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:18:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2019-08-05 11:18:56,577 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 86 [2019-08-05 11:18:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:56,577 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2019-08-05 11:18:56,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:18:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2019-08-05 11:18:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:18:56,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:56,579 INFO L399 BasicCegarLoop]: trace histogram [80, 2, 2, 1, 1, 1] [2019-08-05 11:18:56,579 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2055104798, now seen corresponding path program 79 times [2019-08-05 11:18:56,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:56,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:18:56,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3323 backedges. 82 proven. 3240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:18:59,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:59,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:18:59,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:18:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:18:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:18:59,112 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 83 states. [2019-08-05 11:18:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:59,332 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-08-05 11:18:59,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:18:59,333 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 87 [2019-08-05 11:18:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:59,333 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:18:59,333 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:18:59,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:18:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:18:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:18:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:18:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-08-05 11:18:59,335 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 87 [2019-08-05 11:18:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:59,335 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-08-05 11:18:59,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:18:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-08-05 11:18:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:18:59,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:59,336 INFO L399 BasicCegarLoop]: trace histogram [81, 2, 2, 1, 1, 1] [2019-08-05 11:18:59,336 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:59,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash -775133504, now seen corresponding path program 80 times [2019-08-05 11:18:59,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:59,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:18:59,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3405 backedges. 83 proven. 3321 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:01,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:01,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:19:01,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:19:01,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:19:01,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:19:01,664 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 84 states. [2019-08-05 11:19:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:01,800 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-08-05 11:19:01,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:19:01,800 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 88 [2019-08-05 11:19:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:01,801 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:19:01,802 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:19:01,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:19:01,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:19:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 11:19:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:19:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2019-08-05 11:19:01,804 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 88 [2019-08-05 11:19:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:01,805 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2019-08-05 11:19:01,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:19:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2019-08-05 11:19:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:19:01,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:01,806 INFO L399 BasicCegarLoop]: trace histogram [82, 2, 2, 1, 1, 1] [2019-08-05 11:19:01,806 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:01,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:01,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1681792350, now seen corresponding path program 81 times [2019-08-05 11:19:01,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:01,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:19:01,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3488 backedges. 84 proven. 3403 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:04,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:04,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:19:04,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:19:04,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:19:04,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:19:04,647 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 85 states. [2019-08-05 11:19:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:04,840 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-08-05 11:19:04,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:19:04,841 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 89 [2019-08-05 11:19:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:04,842 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:19:04,842 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:19:04,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:19:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:19:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:19:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:19:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-08-05 11:19:04,845 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 89 [2019-08-05 11:19:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:04,845 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-08-05 11:19:04,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:19:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-08-05 11:19:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:19:04,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:04,847 INFO L399 BasicCegarLoop]: trace histogram [83, 2, 2, 1, 1, 1] [2019-08-05 11:19:04,847 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 537082496, now seen corresponding path program 82 times [2019-08-05 11:19:04,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:04,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:19:04,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3572 backedges. 85 proven. 3486 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:07,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:07,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:19:07,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:19:07,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:19:07,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:19:07,251 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 86 states. [2019-08-05 11:19:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:07,371 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2019-08-05 11:19:07,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:19:07,372 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 90 [2019-08-05 11:19:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:07,373 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:19:07,373 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:19:07,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:19:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:19:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 11:19:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:19:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2019-08-05 11:19:07,376 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 90 [2019-08-05 11:19:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:07,376 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2019-08-05 11:19:07,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:19:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2019-08-05 11:19:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:19:07,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:07,377 INFO L399 BasicCegarLoop]: trace histogram [84, 2, 2, 1, 1, 1] [2019-08-05 11:19:07,377 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:07,378 INFO L82 PathProgramCache]: Analyzing trace with hash -589184610, now seen corresponding path program 83 times [2019-08-05 11:19:07,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:07,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:19:07,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3657 backedges. 86 proven. 3570 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:10,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:10,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:19:10,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:19:10,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:19:10,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:19:10,054 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 87 states. [2019-08-05 11:19:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:10,256 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2019-08-05 11:19:10,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:19:10,256 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 91 [2019-08-05 11:19:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:10,257 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:19:10,257 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:19:10,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:19:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:19:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:19:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:19:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-08-05 11:19:10,260 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 91 [2019-08-05 11:19:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:10,260 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-08-05 11:19:10,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:19:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-08-05 11:19:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:19:10,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:10,261 INFO L399 BasicCegarLoop]: trace histogram [85, 2, 2, 1, 1, 1] [2019-08-05 11:19:10,262 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1143726528, now seen corresponding path program 84 times [2019-08-05 11:19:10,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:10,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:19:10,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3743 backedges. 87 proven. 3655 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:12,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:12,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:19:12,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:19:12,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:19:12,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:19:12,774 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 88 states. [2019-08-05 11:19:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:12,880 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-08-05 11:19:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:19:12,880 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 92 [2019-08-05 11:19:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:12,881 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:19:12,881 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:19:12,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:19:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:19:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 11:19:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:19:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-08-05 11:19:12,884 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 92 [2019-08-05 11:19:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:12,884 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-08-05 11:19:12,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:19:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-08-05 11:19:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:19:12,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:12,885 INFO L399 BasicCegarLoop]: trace histogram [86, 2, 2, 1, 1, 1] [2019-08-05 11:19:12,885 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1154656802, now seen corresponding path program 85 times [2019-08-05 11:19:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:12,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:19:12,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3830 backedges. 88 proven. 3741 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:15,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:15,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:19:15,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:19:15,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:19:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:19:15,832 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 89 states. [2019-08-05 11:19:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:15,958 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-08-05 11:19:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:19:15,959 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 93 [2019-08-05 11:19:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:15,960 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:19:15,960 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:19:15,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:19:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:19:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:19:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:19:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-08-05 11:19:15,964 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2019-08-05 11:19:15,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:15,964 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-08-05 11:19:15,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:19:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-08-05 11:19:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:19:15,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:15,965 INFO L399 BasicCegarLoop]: trace histogram [87, 2, 2, 1, 1, 1] [2019-08-05 11:19:15,965 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:15,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:15,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1493495296, now seen corresponding path program 86 times [2019-08-05 11:19:15,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:15,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:19:15,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 89 proven. 3828 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:20,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:20,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:19:20,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:19:20,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:19:20,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:19:20,741 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 90 states. [2019-08-05 11:19:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:21,032 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-08-05 11:19:21,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:19:21,033 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 94 [2019-08-05 11:19:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:21,034 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:19:21,034 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:19:21,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:19:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:19:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 11:19:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:19:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-08-05 11:19:21,037 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 94 [2019-08-05 11:19:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:21,037 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-08-05 11:19:21,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:19:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-08-05 11:19:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:19:21,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:21,038 INFO L399 BasicCegarLoop]: trace histogram [88, 2, 2, 1, 1, 1] [2019-08-05 11:19:21,038 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:21,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:21,038 INFO L82 PathProgramCache]: Analyzing trace with hash 887413278, now seen corresponding path program 87 times [2019-08-05 11:19:21,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:21,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:19:21,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4007 backedges. 90 proven. 3916 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:23,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:23,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:19:23,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:19:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:19:23,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:19:23,777 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 91 states. [2019-08-05 11:19:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:23,923 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-08-05 11:19:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:19:23,923 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 95 [2019-08-05 11:19:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:23,924 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:19:23,924 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:19:23,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:19:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:19:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 11:19:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:19:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-08-05 11:19:23,927 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 95 [2019-08-05 11:19:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:23,927 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-08-05 11:19:23,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:19:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-08-05 11:19:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:19:23,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:23,928 INFO L399 BasicCegarLoop]: trace histogram [89, 2, 2, 1, 1, 1] [2019-08-05 11:19:23,928 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:23,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1681135040, now seen corresponding path program 88 times [2019-08-05 11:19:23,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:23,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:19:23,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4097 backedges. 91 proven. 4005 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:27,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:27,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:19:27,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:19:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:19:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:19:27,126 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 92 states. [2019-08-05 11:19:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:27,270 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-08-05 11:19:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:19:27,270 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 96 [2019-08-05 11:19:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:27,271 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:19:27,271 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:19:27,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:19:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:19:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 11:19:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:19:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2019-08-05 11:19:27,274 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 96 [2019-08-05 11:19:27,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:27,274 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2019-08-05 11:19:27,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:19:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2019-08-05 11:19:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:19:27,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:27,275 INFO L399 BasicCegarLoop]: trace histogram [90, 2, 2, 1, 1, 1] [2019-08-05 11:19:27,276 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash 516705886, now seen corresponding path program 89 times [2019-08-05 11:19:27,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:27,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:19:27,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4188 backedges. 92 proven. 4095 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:30,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:30,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:19:30,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:19:30,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:19:30,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:19:30,266 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 93 states. [2019-08-05 11:19:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:30,396 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2019-08-05 11:19:30,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:19:30,397 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 97 [2019-08-05 11:19:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:30,397 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:19:30,397 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:19:30,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:19:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:19:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 11:19:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:19:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-08-05 11:19:30,400 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 97 [2019-08-05 11:19:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:30,400 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-08-05 11:19:30,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:19:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-08-05 11:19:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:19:30,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:30,401 INFO L399 BasicCegarLoop]: trace histogram [91, 2, 2, 1, 1, 1] [2019-08-05 11:19:30,401 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1220859520, now seen corresponding path program 90 times [2019-08-05 11:19:30,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:30,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:19:30,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4280 backedges. 93 proven. 4186 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:33,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:33,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:19:33,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:19:33,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:19:33,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:19:33,253 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 94 states. [2019-08-05 11:19:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:33,375 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2019-08-05 11:19:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:19:33,376 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 98 [2019-08-05 11:19:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:33,377 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:19:33,377 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:19:33,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:19:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:19:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 11:19:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:19:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-08-05 11:19:33,380 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 98 [2019-08-05 11:19:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:33,380 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-08-05 11:19:33,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:19:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-08-05 11:19:33,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:19:33,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:33,382 INFO L399 BasicCegarLoop]: trace histogram [92, 2, 2, 1, 1, 1] [2019-08-05 11:19:33,382 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:33,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash 749187742, now seen corresponding path program 91 times [2019-08-05 11:19:33,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:33,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:19:33,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4373 backedges. 94 proven. 4278 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:36,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:36,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:19:36,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:19:36,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:19:36,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:19:36,678 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 95 states. [2019-08-05 11:19:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:36,839 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-08-05 11:19:36,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:19:36,839 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 99 [2019-08-05 11:19:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:36,840 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:19:36,840 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:19:36,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:19:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:19:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:19:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:19:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-08-05 11:19:36,843 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 99 [2019-08-05 11:19:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:36,844 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-08-05 11:19:36,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:19:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-08-05 11:19:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:19:36,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:36,844 INFO L399 BasicCegarLoop]: trace histogram [93, 2, 2, 1, 1, 1] [2019-08-05 11:19:36,845 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:36,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1691110720, now seen corresponding path program 92 times [2019-08-05 11:19:36,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:36,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:19:36,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4467 backedges. 95 proven. 4371 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:40,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:40,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:19:40,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:19:40,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:19:40,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:19:40,292 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 96 states. [2019-08-05 11:19:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:40,446 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2019-08-05 11:19:40,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:19:40,446 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 100 [2019-08-05 11:19:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:40,447 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:19:40,448 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:19:40,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:19:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:19:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 11:19:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:19:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2019-08-05 11:19:40,450 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 100 [2019-08-05 11:19:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:40,451 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2019-08-05 11:19:40,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:19:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2019-08-05 11:19:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:19:40,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:40,452 INFO L399 BasicCegarLoop]: trace histogram [94, 2, 2, 1, 1, 1] [2019-08-05 11:19:40,452 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:40,452 INFO L82 PathProgramCache]: Analyzing trace with hash 825951966, now seen corresponding path program 93 times [2019-08-05 11:19:40,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:40,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:19:40,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4562 backedges. 96 proven. 4465 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:44,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:44,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:19:44,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:19:44,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:19:44,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:19:44,018 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 97 states. [2019-08-05 11:19:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:44,142 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-08-05 11:19:44,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:19:44,142 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 101 [2019-08-05 11:19:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:44,143 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:19:44,143 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:19:44,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:19:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:19:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 11:19:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:19:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-08-05 11:19:44,146 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 101 [2019-08-05 11:19:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:44,146 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-08-05 11:19:44,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:19:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-08-05 11:19:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:19:44,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:44,147 INFO L399 BasicCegarLoop]: trace histogram [95, 2, 2, 1, 1, 1] [2019-08-05 11:19:44,148 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash -224165632, now seen corresponding path program 94 times [2019-08-05 11:19:44,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:44,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:19:44,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 97 proven. 4560 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:47,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:47,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:19:47,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:19:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:19:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:19:47,542 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 98 states. [2019-08-05 11:19:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:47,675 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-08-05 11:19:47,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:19:47,675 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 102 [2019-08-05 11:19:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:47,676 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:19:47,676 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:19:47,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 5 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:19:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:19:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 11:19:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:19:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2019-08-05 11:19:47,679 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 102 [2019-08-05 11:19:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:47,679 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2019-08-05 11:19:47,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:19:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2019-08-05 11:19:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:19:47,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:47,680 INFO L399 BasicCegarLoop]: trace histogram [96, 2, 2, 1, 1, 1] [2019-08-05 11:19:47,681 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1581927198, now seen corresponding path program 95 times [2019-08-05 11:19:47,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:47,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:19:47,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4755 backedges. 98 proven. 4656 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:51,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:51,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:19:51,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:19:51,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:19:51,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:19:51,247 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 99 states. [2019-08-05 11:19:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:51,367 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2019-08-05 11:19:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:19:51,367 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 103 [2019-08-05 11:19:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:51,368 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:19:51,368 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:19:51,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:19:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:19:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:19:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:19:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-08-05 11:19:51,370 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 103 [2019-08-05 11:19:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:51,370 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-08-05 11:19:51,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:19:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-08-05 11:19:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:19:51,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:51,371 INFO L399 BasicCegarLoop]: trace histogram [97, 2, 2, 1, 1, 1] [2019-08-05 11:19:51,371 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1736230080, now seen corresponding path program 96 times [2019-08-05 11:19:51,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:51,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:19:51,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4853 backedges. 99 proven. 4753 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:54,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:54,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:19:54,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:19:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:19:54,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:19:54,659 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 100 states. [2019-08-05 11:19:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:54,843 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2019-08-05 11:19:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:19:54,843 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 104 [2019-08-05 11:19:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:54,844 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:19:54,844 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:19:54,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 5 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:19:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:19:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 11:19:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:19:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2019-08-05 11:19:54,847 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 104 [2019-08-05 11:19:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:54,848 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2019-08-05 11:19:54,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:19:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2019-08-05 11:19:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:19:54,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:54,849 INFO L399 BasicCegarLoop]: trace histogram [98, 2, 2, 1, 1, 1] [2019-08-05 11:19:54,849 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:54,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2070315170, now seen corresponding path program 97 times [2019-08-05 11:19:54,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:54,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:19:54,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4952 backedges. 100 proven. 4851 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:19:58,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:58,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:19:58,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:19:58,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:19:58,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:19:58,435 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 101 states. [2019-08-05 11:19:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:58,646 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-08-05 11:19:58,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:19:58,647 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 105 [2019-08-05 11:19:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:58,648 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:19:58,648 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:19:58,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:19:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:19:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:19:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:19:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-08-05 11:19:58,651 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 105 [2019-08-05 11:19:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:58,651 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-08-05 11:19:58,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:19:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-08-05 11:19:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:19:58,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:58,652 INFO L399 BasicCegarLoop]: trace histogram [99, 2, 2, 1, 1, 1] [2019-08-05 11:19:58,652 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:58,653 INFO L82 PathProgramCache]: Analyzing trace with hash 185866368, now seen corresponding path program 98 times [2019-08-05 11:19:58,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:58,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:19:58,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5052 backedges. 101 proven. 4950 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:02,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:02,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:20:02,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:20:02,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:20:02,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:20:02,432 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 102 states. [2019-08-05 11:20:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:02,599 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2019-08-05 11:20:02,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:20:02,599 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 106 [2019-08-05 11:20:02,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:02,600 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:20:02,600 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:20:02,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:20:02,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:20:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 11:20:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:20:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2019-08-05 11:20:02,603 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 106 [2019-08-05 11:20:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:02,604 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2019-08-05 11:20:02,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:20:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2019-08-05 11:20:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:20:02,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:02,604 INFO L399 BasicCegarLoop]: trace histogram [100, 2, 2, 1, 1, 1] [2019-08-05 11:20:02,604 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:02,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1408017310, now seen corresponding path program 99 times [2019-08-05 11:20:02,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:02,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:20:02,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5153 backedges. 102 proven. 5050 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:06,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:06,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:20:06,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:20:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:20:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:20:06,479 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 103 states. [2019-08-05 11:20:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:06,693 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-08-05 11:20:06,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:20:06,693 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 107 [2019-08-05 11:20:06,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:06,695 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:20:06,695 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:20:06,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:20:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:20:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:20:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:20:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-08-05 11:20:06,698 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 107 [2019-08-05 11:20:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:06,698 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-08-05 11:20:06,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:20:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-08-05 11:20:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:20:06,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:06,699 INFO L399 BasicCegarLoop]: trace histogram [101, 2, 2, 1, 1, 1] [2019-08-05 11:20:06,700 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:06,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash 639990848, now seen corresponding path program 100 times [2019-08-05 11:20:06,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:06,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:20:06,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5255 backedges. 103 proven. 5151 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:10,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:10,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:20:10,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:20:10,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:20:10,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:20:10,355 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 104 states. [2019-08-05 11:20:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:10,541 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-08-05 11:20:10,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:20:10,542 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 108 [2019-08-05 11:20:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:10,543 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:20:10,543 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:20:10,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:20:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:20:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 11:20:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:20:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-08-05 11:20:10,546 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 108 [2019-08-05 11:20:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:10,546 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-08-05 11:20:10,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:20:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-08-05 11:20:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:20:10,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:10,547 INFO L399 BasicCegarLoop]: trace histogram [102, 2, 2, 1, 1, 1] [2019-08-05 11:20:10,547 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1693992994, now seen corresponding path program 101 times [2019-08-05 11:20:10,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:10,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:20:10,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5358 backedges. 104 proven. 5253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:14,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:14,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:20:14,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:20:14,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:20:14,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:20:14,338 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 105 states. [2019-08-05 11:20:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:14,482 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2019-08-05 11:20:14,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:20:14,483 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 109 [2019-08-05 11:20:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:14,484 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:20:14,484 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:20:14,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:20:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:20:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 11:20:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:20:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-08-05 11:20:14,487 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 109 [2019-08-05 11:20:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:14,488 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-08-05 11:20:14,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:20:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-08-05 11:20:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:20:14,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:14,489 INFO L399 BasicCegarLoop]: trace histogram [103, 2, 2, 1, 1, 1] [2019-08-05 11:20:14,489 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:14,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1033048064, now seen corresponding path program 102 times [2019-08-05 11:20:14,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:14,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:20:14,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5462 backedges. 105 proven. 5356 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:18,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:18,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:20:18,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:20:18,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:20:18,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:20:18,365 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 106 states. [2019-08-05 11:20:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:18,583 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2019-08-05 11:20:18,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:20:18,583 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 110 [2019-08-05 11:20:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:18,584 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:20:18,584 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:20:18,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:20:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:20:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 11:20:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:20:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2019-08-05 11:20:18,587 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 110 [2019-08-05 11:20:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:18,587 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2019-08-05 11:20:18,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:20:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2019-08-05 11:20:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:20:18,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:18,588 INFO L399 BasicCegarLoop]: trace histogram [104, 2, 2, 1, 1, 1] [2019-08-05 11:20:18,589 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2018591714, now seen corresponding path program 103 times [2019-08-05 11:20:18,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:18,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:20:18,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5567 backedges. 106 proven. 5460 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:22,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:22,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:20:22,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:20:22,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:20:22,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:20:22,650 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 107 states. [2019-08-05 11:20:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:22,818 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-08-05 11:20:22,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:20:22,818 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 111 [2019-08-05 11:20:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:22,819 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:20:22,819 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:20:22,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:20:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:20:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 11:20:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:20:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2019-08-05 11:20:22,822 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 111 [2019-08-05 11:20:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:22,822 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2019-08-05 11:20:22,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:20:22,823 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2019-08-05 11:20:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:20:22,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:22,823 INFO L399 BasicCegarLoop]: trace histogram [105, 2, 2, 1, 1, 1] [2019-08-05 11:20:22,823 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:22,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:22,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1789293504, now seen corresponding path program 104 times [2019-08-05 11:20:22,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:22,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:20:22,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 107 proven. 5565 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:26,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:26,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:20:26,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:20:26,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:20:26,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:20:26,868 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 108 states. [2019-08-05 11:20:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:27,105 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2019-08-05 11:20:27,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:20:27,105 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 112 [2019-08-05 11:20:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:27,106 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:20:27,107 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:20:27,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:20:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:20:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 11:20:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:20:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-08-05 11:20:27,110 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 112 [2019-08-05 11:20:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:27,110 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-08-05 11:20:27,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:20:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-08-05 11:20:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:20:27,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:27,111 INFO L399 BasicCegarLoop]: trace histogram [106, 2, 2, 1, 1, 1] [2019-08-05 11:20:27,111 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash -425349026, now seen corresponding path program 105 times [2019-08-05 11:20:27,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:27,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:20:27,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5780 backedges. 108 proven. 5671 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:31,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:31,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:20:31,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:20:31,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:20:31,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:20:31,053 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 109 states. [2019-08-05 11:20:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:31,382 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-08-05 11:20:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:20:31,382 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 113 [2019-08-05 11:20:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:31,383 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:20:31,383 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:20:31,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:20:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:20:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 11:20:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:20:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-08-05 11:20:31,385 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 113 [2019-08-05 11:20:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:31,385 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-08-05 11:20:31,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:20:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-08-05 11:20:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:20:31,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:31,386 INFO L399 BasicCegarLoop]: trace histogram [107, 2, 2, 1, 1, 1] [2019-08-05 11:20:31,386 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash -359790720, now seen corresponding path program 106 times [2019-08-05 11:20:31,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:31,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:20:31,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5888 backedges. 109 proven. 5778 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:35,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:35,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:20:35,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:20:35,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:20:35,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:20:35,380 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 110 states. [2019-08-05 11:20:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:35,560 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-08-05 11:20:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:20:35,561 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 114 [2019-08-05 11:20:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:35,562 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:20:35,562 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:20:35,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 5 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:20:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:20:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 11:20:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:20:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2019-08-05 11:20:35,565 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 114 [2019-08-05 11:20:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:35,565 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2019-08-05 11:20:35,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:20:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2019-08-05 11:20:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:20:35,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:35,566 INFO L399 BasicCegarLoop]: trace histogram [108, 2, 2, 1, 1, 1] [2019-08-05 11:20:35,566 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:35,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1672516766, now seen corresponding path program 107 times [2019-08-05 11:20:35,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:35,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:20:35,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5997 backedges. 110 proven. 5886 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:40,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:40,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:20:40,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:20:40,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:20:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:20:40,023 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 111 states. [2019-08-05 11:20:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:40,205 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2019-08-05 11:20:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:20:40,206 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 115 [2019-08-05 11:20:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:40,207 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:20:40,207 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:20:40,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:20:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:20:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 11:20:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:20:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-08-05 11:20:40,209 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 115 [2019-08-05 11:20:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:40,210 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-08-05 11:20:40,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:20:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-08-05 11:20:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:20:40,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:40,210 INFO L399 BasicCegarLoop]: trace histogram [109, 2, 2, 1, 1, 1] [2019-08-05 11:20:40,210 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:40,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash 249539392, now seen corresponding path program 108 times [2019-08-05 11:20:40,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:40,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:20:40,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6107 backedges. 111 proven. 5995 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:44,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:44,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:20:44,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:20:44,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:20:44,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:20:44,632 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 112 states. [2019-08-05 11:20:44,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:44,868 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2019-08-05 11:20:44,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:20:44,868 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 116 [2019-08-05 11:20:44,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:44,869 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:20:44,869 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:20:44,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:20:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:20:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 11:20:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:20:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2019-08-05 11:20:44,872 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 116 [2019-08-05 11:20:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:44,872 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2019-08-05 11:20:44,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:20:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2019-08-05 11:20:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:20:44,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:44,873 INFO L399 BasicCegarLoop]: trace histogram [110, 2, 2, 1, 1, 1] [2019-08-05 11:20:44,873 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash -913086242, now seen corresponding path program 109 times [2019-08-05 11:20:44,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:44,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:20:44,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6218 backedges. 112 proven. 6105 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:49,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:49,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:20:49,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:20:49,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:20:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:20:49,446 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 113 states. [2019-08-05 11:20:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:49,661 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2019-08-05 11:20:49,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:20:49,662 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 117 [2019-08-05 11:20:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:49,663 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:20:49,663 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:20:49,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:20:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:20:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 11:20:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:20:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-08-05 11:20:49,666 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 117 [2019-08-05 11:20:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:49,666 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-08-05 11:20:49,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:20:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-08-05 11:20:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:20:49,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:49,667 INFO L399 BasicCegarLoop]: trace histogram [111, 2, 2, 1, 1, 1] [2019-08-05 11:20:49,667 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1700224768, now seen corresponding path program 110 times [2019-08-05 11:20:49,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:49,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:20:49,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6330 backedges. 113 proven. 6216 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:54,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:20:54,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:20:54,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:20:54,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:20:54,177 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 114 states. [2019-08-05 11:20:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:54,366 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2019-08-05 11:20:54,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:20:54,367 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 118 [2019-08-05 11:20:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:54,367 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:20:54,367 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:20:54,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:20:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:20:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 11:20:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:20:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2019-08-05 11:20:54,370 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 118 [2019-08-05 11:20:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:54,371 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2019-08-05 11:20:54,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:20:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2019-08-05 11:20:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:20:54,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:54,371 INFO L399 BasicCegarLoop]: trace histogram [112, 2, 2, 1, 1, 1] [2019-08-05 11:20:54,372 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:54,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1108487454, now seen corresponding path program 111 times [2019-08-05 11:20:54,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:54,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:20:54,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6443 backedges. 114 proven. 6328 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:20:58,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:58,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:20:58,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:20:58,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:20:58,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:20:58,884 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 115 states. [2019-08-05 11:20:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:59,080 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-08-05 11:20:59,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:20:59,080 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 119 [2019-08-05 11:20:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:59,081 INFO L225 Difference]: With dead ends: 126 [2019-08-05 11:20:59,081 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 11:20:59,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:20:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 11:20:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-08-05 11:20:59,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 11:20:59,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-08-05 11:20:59,084 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 119 [2019-08-05 11:20:59,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:59,085 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-08-05 11:20:59,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:20:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-08-05 11:20:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 11:20:59,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:59,086 INFO L399 BasicCegarLoop]: trace histogram [113, 2, 2, 1, 1, 1] [2019-08-05 11:20:59,086 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:59,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:59,086 INFO L82 PathProgramCache]: Analyzing trace with hash -55500096, now seen corresponding path program 112 times [2019-08-05 11:20:59,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:59,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:20:59,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6557 backedges. 115 proven. 6441 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:21:03,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:03,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:21:03,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:21:03,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:21:03,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:21:03,877 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 116 states. [2019-08-05 11:21:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:04,149 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2019-08-05 11:21:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:21:04,149 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 120 [2019-08-05 11:21:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:04,150 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:21:04,150 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:21:04,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:21:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:21:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 11:21:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:21:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2019-08-05 11:21:04,153 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 120 [2019-08-05 11:21:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:04,153 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2019-08-05 11:21:04,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:21:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2019-08-05 11:21:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:21:04,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:04,154 INFO L399 BasicCegarLoop]: trace histogram [114, 2, 2, 1, 1, 1] [2019-08-05 11:21:04,154 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1779375778, now seen corresponding path program 113 times [2019-08-05 11:21:04,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:04,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:21:04,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6672 backedges. 116 proven. 6555 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:21:09,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:09,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 11:21:09,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 11:21:09,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 11:21:09,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:21:09,015 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 117 states. [2019-08-05 11:21:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,275 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2019-08-05 11:21:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 11:21:09,276 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 121 [2019-08-05 11:21:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,277 INFO L225 Difference]: With dead ends: 128 [2019-08-05 11:21:09,277 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 11:21:09,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:21:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 11:21:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-05 11:21:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:21:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-08-05 11:21:09,279 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 121 [2019-08-05 11:21:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,280 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-08-05 11:21:09,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 11:21:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-08-05 11:21:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 11:21:09,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,280 INFO L399 BasicCegarLoop]: trace histogram [115, 2, 2, 1, 1, 1] [2019-08-05 11:21:09,281 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,281 INFO L82 PathProgramCache]: Analyzing trace with hash 615052928, now seen corresponding path program 114 times [2019-08-05 11:21:09,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6788 backedges. 117 proven. 6670 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:21:14,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:14,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 11:21:14,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 11:21:14,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 11:21:14,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:21:14,176 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 118 states. [2019-08-05 11:21:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:14,407 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2019-08-05 11:21:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 11:21:14,408 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 122 [2019-08-05 11:21:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:14,408 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:21:14,409 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:21:14,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:21:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:21:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 11:21:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:21:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-08-05 11:21:14,411 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 122 [2019-08-05 11:21:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:14,412 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-08-05 11:21:14,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 11:21:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-08-05 11:21:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:21:14,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:14,412 INFO L399 BasicCegarLoop]: trace histogram [116, 2, 2, 1, 1, 1] [2019-08-05 11:21:14,413 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1827898782, now seen corresponding path program 115 times [2019-08-05 11:21:14,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:14,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:21:14,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6905 backedges. 118 proven. 6786 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:21:19,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 11:21:19,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 11:21:19,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 11:21:19,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:21:19,621 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 119 states. [2019-08-05 11:21:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,872 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-08-05 11:21:19,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 11:21:19,872 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 123 [2019-08-05 11:21:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,873 INFO L225 Difference]: With dead ends: 130 [2019-08-05 11:21:19,873 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 11:21:19,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:21:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 11:21:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-08-05 11:21:19,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 11:21:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-08-05 11:21:19,876 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 123 [2019-08-05 11:21:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,876 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-08-05 11:21:19,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 11:21:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-08-05 11:21:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 11:21:19,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,877 INFO L399 BasicCegarLoop]: trace histogram [117, 2, 2, 1, 1, 1] [2019-08-05 11:21:19,877 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash 771414592, now seen corresponding path program 116 times [2019-08-05 11:21:19,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7023 backedges. 119 proven. 6903 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:21:24,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:24,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-05 11:21:24,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 11:21:24,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 11:21:24,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 11:21:24,899 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 120 states. Received shutdown request... [2019-08-05 11:21:25,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:21:25,052 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:21:25,058 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:21:25,059 INFO L202 PluginConnector]: Adding new model nestedLoopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:21:25 BoogieIcfgContainer [2019-08-05 11:21:25,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:21:25,061 INFO L168 Benchmark]: Toolchain (without parser) took 238736.27 ms. Allocated memory was 135.8 MB in the beginning and 696.3 MB in the end (delta: 560.5 MB). Free memory was 113.5 MB in the beginning and 171.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 503.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:25,062 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 114.6 MB in the beginning and 114.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:21:25,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.52 ms. Allocated memory is still 135.8 MB. Free memory was 113.3 MB in the beginning and 111.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:25,063 INFO L168 Benchmark]: Boogie Preprocessor took 20.66 ms. Allocated memory is still 135.8 MB. Free memory was 111.4 MB in the beginning and 110.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:25,063 INFO L168 Benchmark]: RCFGBuilder took 268.44 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 100.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:25,064 INFO L168 Benchmark]: TraceAbstraction took 238409.10 ms. Allocated memory was 135.8 MB in the beginning and 696.3 MB in the end (delta: 560.5 MB). Free memory was 100.6 MB in the beginning and 171.0 MB in the end (delta: -70.4 MB). Peak memory consumption was 490.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:25,067 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 114.6 MB in the beginning and 114.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.52 ms. Allocated memory is still 135.8 MB. Free memory was 113.3 MB in the beginning and 111.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.66 ms. Allocated memory is still 135.8 MB. Free memory was 111.4 MB in the beginning and 110.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 268.44 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 100.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238409.10 ms. Allocated memory was 135.8 MB in the beginning and 696.3 MB in the end (delta: 560.5 MB). Free memory was 100.6 MB in the beginning and 171.0 MB in the end (delta: -70.4 MB). Peak memory consumption was 490.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 22). Cancelled while BasicCegarLoop was constructing difference of abstraction (130states) and FLOYD_HOARE automaton (currently 97 states, 120 states before enhancement),while ReachableStatesComputation was computing reachable states (96 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19). Cancelled while BasicCegarLoop was constructing difference of abstraction (130states) and FLOYD_HOARE automaton (currently 97 states, 120 states before enhancement),while ReachableStatesComputation was computing reachable states (96 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (130states) and FLOYD_HOARE automaton (currently 97 states, 120 states before enhancement),while ReachableStatesComputation was computing reachable states (96 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 3 error locations. TIMEOUT Result, 238.3s OverallTime, 120 OverallIterations, 117 TraceHistogramMax, 16.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1073 SDtfs, 230 SDslu, 12322 SDs, 0 SdLazy, 11240 SolverSat, 231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7612 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 7024 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 217.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred 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.2s SatisfiabilityAnalysisTime, 219.9s InterpolantComputationTime, 7732 NumberOfCodeBlocks, 7732 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 7612 ConstructedInterpolants, 0 QuantifiedInterpolants, 1822562 SizeOfPredicates, 119 NumberOfNonLiveVariables, 22612 ConjunctsInSsa, 7144 ConjunctsInUnsatCore, 120 InterpolantComputations, 3 PerfectInterpolantSequences, 7253/281072 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown