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/loopAccelerationMohr/nestedLoopUnsafe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:21:14,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:21:14,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:21:14,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:21:14,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:21:14,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:21:14,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:21:14,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:21:14,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:21:14,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:21:14,228 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:21:14,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:21:14,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:21:14,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:21:14,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:21:14,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:21:14,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:21:14,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:21:14,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:21:14,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:21:14,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:21:14,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:21:14,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:21:14,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:21:14,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:21:14,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:21:14,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:21:14,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:21:14,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:21:14,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:21:14,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:21:14,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:21:14,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:21:14,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:21:14,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:21:14,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:21:14,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:21:14,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:21:14,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:21:14,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:21:14,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:21:14,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:21:14,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:21:14,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:21:14,315 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:21:14,316 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:21:14,316 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationMohr/nestedLoopUnsafe.bpl [2019-08-05 11:21:14,317 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationMohr/nestedLoopUnsafe.bpl' [2019-08-05 11:21:14,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:21:14,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:21:14,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:14,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:21:14,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:21:14,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/1) ... [2019-08-05 11:21:14,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/1) ... [2019-08-05 11:21:14,376 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:21:14,377 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:21:14,377 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:21:14,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:14,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:21:14,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:21:14,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:21:14,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/1) ... [2019-08-05 11:21:14,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/1) ... [2019-08-05 11:21:14,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/1) ... [2019-08-05 11:21:14,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/1) ... [2019-08-05 11:21:14,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/1) ... [2019-08-05 11:21:14,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/1) ... [2019-08-05 11:21:14,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/1) ... [2019-08-05 11:21:14,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:21:14,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:21:14,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:21:14,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:21:14,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:21:14,476 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:21:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:21:14,477 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:21:14,740 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:21:14,741 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:21:14,742 INFO L202 PluginConnector]: Adding new model nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:14 BoogieIcfgContainer [2019-08-05 11:21:14,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:21:14,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:21:14,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:21:14,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:21:14,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:14" (1/2) ... [2019-08-05 11:21:14,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248afd71 and model type nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:21:14, skipping insertion in model container [2019-08-05 11:21:14,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:14" (2/2) ... [2019-08-05 11:21:14,751 INFO L109 eAbstractionObserver]: Analyzing ICFG nestedLoopUnsafe.bpl [2019-08-05 11:21:14,760 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:21:14,768 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:21:14,784 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:21:14,809 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:21:14,810 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:21:14,810 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:21:14,810 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:21:14,811 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:21:14,811 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:21:14,811 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:21:14,811 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:21:14,811 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:21:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:21:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:21:14,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:14,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:21:14,837 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:14,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:14,843 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 11:21:14,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:14,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:21:14,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:14,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:14,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:21:14,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:21:15,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:21:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:15,004 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:21:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,066 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-08-05 11:21:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:21:15,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:21:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,081 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:21:15,081 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:21:15,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:21:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:21:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:21:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:21:15,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 11:21:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,129 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:21:15,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:21:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:21:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:21:15,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,130 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:21:15,131 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,131 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-08-05 11:21:15,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:15,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:15,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:21:15,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:21:15,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:21:15,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:15,203 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 11:21:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,265 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 11:21:15,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:21:15,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:21:15,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,267 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:21:15,267 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:21:15,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:21:15,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:21:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:21:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:21:15,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 11:21:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,271 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:21:15,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:21:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:21:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:21:15,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:21:15,273 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,274 INFO L82 PathProgramCache]: Analyzing trace with hash 891446088, now seen corresponding path program 1 times [2019-08-05 11:21:15,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:15,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:15,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:21:15,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:15,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:15,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:15,387 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 11:21:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,459 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 11:21:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:15,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:21:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,461 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:21:15,462 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:21:15,463 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:21:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:21:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:21:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:21:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 11:21:15,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 11:21:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,467 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 11:21:15,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 11:21:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:21:15,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,468 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 11:21:15,468 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1864963430, now seen corresponding path program 2 times [2019-08-05 11:21:15,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:21:15,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:15,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:21:15,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:15,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:15,518 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-08-05 11:21:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,561 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-08-05 11:21:15,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:15,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:21:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,563 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:21:15,563 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:21:15,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:21:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 11:21:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:21:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 11:21:15,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2019-08-05 11:21:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,568 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 11:21:15,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 11:21:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:21:15,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,570 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-05 11:21:15,570 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash -766869012, now seen corresponding path program 3 times [2019-08-05 11:21:15,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:21:15,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:15,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:21:15,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:21:15,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:21:15,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:15,678 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2019-08-05 11:21:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,733 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 11:21:15,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:15,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-08-05 11:21:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,735 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:21:15,735 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:21:15,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:21:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-08-05 11:21:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:21:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-08-05 11:21:15,739 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2019-08-05 11:21:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,739 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-08-05 11:21:15,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:21:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-08-05 11:21:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:21:15,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,740 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2019-08-05 11:21:15,740 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1237959822, now seen corresponding path program 4 times [2019-08-05 11:21:15,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 11:21:15,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:15,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:21:15,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:21:15,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:21:15,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:15,889 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2019-08-05 11:21:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,966 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-08-05 11:21:15,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:21:15,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-08-05 11:21:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,967 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:21:15,967 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:21:15,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:21:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-08-05 11:21:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:21:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-08-05 11:21:15,972 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 15 [2019-08-05 11:21:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,972 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-08-05 11:21:15,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:21:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-08-05 11:21:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:21:15,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,973 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2019-08-05 11:21:15,974 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,974 INFO L82 PathProgramCache]: Analyzing trace with hash -486686216, now seen corresponding path program 5 times [2019-08-05 11:21:15,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 11:21:16,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:21:16,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:21:16,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:21:16,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:16,232 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2019-08-05 11:21:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,279 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-08-05 11:21:16,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:21:16,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-08-05 11:21:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,281 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:21:16,281 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:21:16,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:21:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-08-05 11:21:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:21:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-08-05 11:21:16,286 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2019-08-05 11:21:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,286 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-08-05 11:21:16,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:21:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-08-05 11:21:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:21:16,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,287 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 5, 1, 1, 1] [2019-08-05 11:21:16,288 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1141729922, now seen corresponding path program 6 times [2019-08-05 11:21:16,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:21:16,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:21:16,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:21:16,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:21:16,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:16,544 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 8 states. [2019-08-05 11:21:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,612 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2019-08-05 11:21:16,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:21:16,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-08-05 11:21:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,614 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:21:16,614 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:21:16,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:21:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-08-05 11:21:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:21:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-08-05 11:21:16,619 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2019-08-05 11:21:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,619 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-08-05 11:21:16,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:21:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-08-05 11:21:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:21:16,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,620 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 6, 1, 1, 1] [2019-08-05 11:21:16,621 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1616497148, now seen corresponding path program 7 times [2019-08-05 11:21:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 11:21:16,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:21:16,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:21:16,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:21:16,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:16,813 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 9 states. [2019-08-05 11:21:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,880 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2019-08-05 11:21:16,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:21:16,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-08-05 11:21:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,882 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:21:16,882 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:21:16,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:21:16,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-08-05 11:21:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:21:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-08-05 11:21:16,888 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2019-08-05 11:21:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,889 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-08-05 11:21:16,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:21:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-08-05 11:21:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:21:16,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,890 INFO L399 BasicCegarLoop]: trace histogram [14, 7, 7, 1, 1, 1] [2019-08-05 11:21:16,890 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1206526858, now seen corresponding path program 8 times [2019-08-05 11:21:16,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-05 11:21:17,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:17,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:21:17,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:21:17,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:21:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:21:17,348 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 10 states. [2019-08-05 11:21:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:17,417 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-08-05 11:21:17,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:21:17,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-08-05 11:21:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:17,419 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:21:17,419 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:21:17,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:21:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:21:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-08-05 11:21:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:21:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-08-05 11:21:17,424 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 31 [2019-08-05 11:21:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:17,425 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-08-05 11:21:17,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:21:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-08-05 11:21:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:21:17,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:17,426 INFO L399 BasicCegarLoop]: trace histogram [16, 8, 8, 1, 1, 1] [2019-08-05 11:21:17,427 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:17,427 INFO L82 PathProgramCache]: Analyzing trace with hash 701488656, now seen corresponding path program 9 times [2019-08-05 11:21:17,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:17,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:21:17,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-08-05 11:21:17,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:17,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:21:17,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:21:17,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:21:17,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:21:17,739 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 11 states. [2019-08-05 11:21:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:17,784 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-08-05 11:21:17,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:21:17,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-08-05 11:21:17,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:17,786 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:21:17,786 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:21:17,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:21:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:21:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-08-05 11:21:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:21:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2019-08-05 11:21:17,793 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 35 [2019-08-05 11:21:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:17,793 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-08-05 11:21:17,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:21:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2019-08-05 11:21:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:21:17,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:17,795 INFO L399 BasicCegarLoop]: trace histogram [18, 9, 9, 1, 1, 1] [2019-08-05 11:21:17,795 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash -710351466, now seen corresponding path program 10 times [2019-08-05 11:21:17,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:17,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:21:17,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-08-05 11:21:17,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:17,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:21:17,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:21:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:21:17,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:21:17,983 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 12 states. [2019-08-05 11:21:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:18,078 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-08-05 11:21:18,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:21:18,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-08-05 11:21:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:18,080 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:21:18,080 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:21:18,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:21:18,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:21:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-08-05 11:21:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:21:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-08-05 11:21:18,094 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 39 [2019-08-05 11:21:18,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:18,095 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-08-05 11:21:18,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:21:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-08-05 11:21:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:21:18,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:18,100 INFO L399 BasicCegarLoop]: trace histogram [20, 10, 10, 1, 1, 1] [2019-08-05 11:21:18,100 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:18,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1460058652, now seen corresponding path program 11 times [2019-08-05 11:21:18,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:18,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:21:18,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 11:21:18,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:18,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:21:18,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:21:18,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:21:18,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:21:18,525 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 13 states. [2019-08-05 11:21:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:18,857 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-08-05 11:21:18,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:21:18,858 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-08-05 11:21:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:18,858 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:21:18,859 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:21:18,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:21:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:21:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-08-05 11:21:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:21:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-08-05 11:21:18,864 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 43 [2019-08-05 11:21:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:18,865 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-08-05 11:21:18,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:21:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2019-08-05 11:21:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:21:18,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:18,867 INFO L399 BasicCegarLoop]: trace histogram [22, 11, 11, 1, 1, 1] [2019-08-05 11:21:18,869 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:18,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1799693406, now seen corresponding path program 12 times [2019-08-05 11:21:18,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:18,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:21:18,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-08-05 11:21:19,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:21:19,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:21:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:21:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:21:19,103 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 14 states. [2019-08-05 11:21:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,160 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-08-05 11:21:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:21:19,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-08-05 11:21:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,162 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:21:19,162 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:21:19,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 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:21:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:21:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-08-05 11:21:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:21:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-08-05 11:21:19,167 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 47 [2019-08-05 11:21:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,168 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-08-05 11:21:19,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:21:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-08-05 11:21:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:21:19,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,169 INFO L399 BasicCegarLoop]: trace histogram [24, 12, 12, 1, 1, 1] [2019-08-05 11:21:19,169 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1328100824, now seen corresponding path program 13 times [2019-08-05 11:21:19,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 11:21:19,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:21:19,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:21:19,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:21:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:19,363 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 15 states. [2019-08-05 11:21:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,453 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2019-08-05 11:21:19,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:21:19,456 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-08-05 11:21:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,457 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:21:19,457 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:21:19,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:21:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-08-05 11:21:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:21:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2019-08-05 11:21:19,463 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 51 [2019-08-05 11:21:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,463 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2019-08-05 11:21:19,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:21:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2019-08-05 11:21:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:21:19,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,464 INFO L399 BasicCegarLoop]: trace histogram [26, 13, 13, 1, 1, 1] [2019-08-05 11:21:19,465 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1756104110, now seen corresponding path program 14 times [2019-08-05 11:21:19,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-08-05 11:21:19,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:21:19,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:21:19,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:21:19,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:21:19,761 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand 16 states. [2019-08-05 11:21:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,826 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2019-08-05 11:21:19,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:21:19,826 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-08-05 11:21:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,827 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:21:19,827 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:21:19,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:21:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:21:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2019-08-05 11:21:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:21:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2019-08-05 11:21:19,833 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 55 [2019-08-05 11:21:19,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,833 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2019-08-05 11:21:19,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:21:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2019-08-05 11:21:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:21:19,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,835 INFO L399 BasicCegarLoop]: trace histogram [28, 14, 14, 1, 1, 1] [2019-08-05 11:21:19,835 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1959530036, now seen corresponding path program 15 times [2019-08-05 11:21:19,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:21:20,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:20,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:21:20,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:21:20,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:21:20,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:21:20,043 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 17 states. [2019-08-05 11:21:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:20,092 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-08-05 11:21:20,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:21:20,093 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-08-05 11:21:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:20,094 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:21:20,094 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:21:20,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 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:21:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:21:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-08-05 11:21:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:21:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-08-05 11:21:20,100 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 59 [2019-08-05 11:21:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:20,100 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-08-05 11:21:20,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:21:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-08-05 11:21:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:21:20,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:20,102 INFO L399 BasicCegarLoop]: trace histogram [30, 15, 15, 1, 1, 1] [2019-08-05 11:21:20,102 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash -385326150, now seen corresponding path program 16 times [2019-08-05 11:21:20,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:20,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:21:20,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 11:21:20,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:20,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:21:20,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:21:20,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:21:20,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:21:20,765 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 18 states. [2019-08-05 11:21:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:20,822 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2019-08-05 11:21:20,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:21:20,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2019-08-05 11:21:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:20,830 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:21:20,830 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:21:20,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:21:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:21:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-08-05 11:21:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:21:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2019-08-05 11:21:20,840 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 63 [2019-08-05 11:21:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:20,840 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2019-08-05 11:21:20,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:21:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2019-08-05 11:21:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:21:20,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:20,841 INFO L399 BasicCegarLoop]: trace histogram [32, 16, 16, 1, 1, 1] [2019-08-05 11:21:20,842 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:20,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:20,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1804433856, now seen corresponding path program 17 times [2019-08-05 11:21:20,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:20,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:21:20,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-08-05 11:21:21,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:21,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:21:21,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:21:21,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:21:21,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:21:21,149 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 19 states. [2019-08-05 11:21:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:21,204 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-08-05 11:21:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:21:21,204 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-08-05 11:21:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:21,205 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:21:21,205 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:21:21,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:21:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:21:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-08-05 11:21:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:21:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-08-05 11:21:21,211 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 67 [2019-08-05 11:21:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:21,211 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-08-05 11:21:21,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:21:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-08-05 11:21:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:21:21,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:21,213 INFO L399 BasicCegarLoop]: trace histogram [34, 17, 17, 1, 1, 1] [2019-08-05 11:21:21,213 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:21,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:21,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1633416646, now seen corresponding path program 18 times [2019-08-05 11:21:21,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1377 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-08-05 11:21:21,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:21,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:21:21,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:21:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:21:21,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:21:21,659 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 20 states. [2019-08-05 11:21:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:21,720 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2019-08-05 11:21:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:21:21,721 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2019-08-05 11:21:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:21,722 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:21:21,722 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:21:21,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:21:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:21:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-08-05 11:21:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:21:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2019-08-05 11:21:21,726 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 71 [2019-08-05 11:21:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:21,726 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2019-08-05 11:21:21,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:21:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2019-08-05 11:21:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:21:21,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:21,728 INFO L399 BasicCegarLoop]: trace histogram [36, 18, 18, 1, 1, 1] [2019-08-05 11:21:21,728 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:21,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1252642228, now seen corresponding path program 19 times [2019-08-05 11:21:21,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 0 proven. 1548 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-08-05 11:21:22,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:22,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:21:22,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:21:22,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:21:22,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:21:22,184 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand 21 states. [2019-08-05 11:21:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:22,392 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2019-08-05 11:21:22,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:21:22,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 75 [2019-08-05 11:21:22,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:22,393 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:21:22,394 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:21:22,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:21:22,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:21:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2019-08-05 11:21:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:21:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2019-08-05 11:21:22,397 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 75 [2019-08-05 11:21:22,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:22,397 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2019-08-05 11:21:22,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:21:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2019-08-05 11:21:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:21:22,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:22,398 INFO L399 BasicCegarLoop]: trace histogram [38, 19, 19, 1, 1, 1] [2019-08-05 11:21:22,398 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash -785204270, now seen corresponding path program 20 times [2019-08-05 11:21:22,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:22,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:21:22,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-08-05 11:21:22,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:22,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:21:22,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:21:22,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:21:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:21:22,831 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 22 states. [2019-08-05 11:21:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:22,935 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2019-08-05 11:21:22,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:21:22,937 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 79 [2019-08-05 11:21:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:22,938 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:21:22,938 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:21:22,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:21:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:21:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-08-05 11:21:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:21:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2019-08-05 11:21:22,942 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 79 [2019-08-05 11:21:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:22,942 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2019-08-05 11:21:22,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:21:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2019-08-05 11:21:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:21:22,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:22,943 INFO L399 BasicCegarLoop]: trace histogram [40, 20, 20, 1, 1, 1] [2019-08-05 11:21:22,944 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:22,944 INFO L82 PathProgramCache]: Analyzing trace with hash 822284888, now seen corresponding path program 21 times [2019-08-05 11:21:22,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:22,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:21:22,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1920 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:21:23,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:23,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:21:23,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:21:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:21:23,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:21:23,521 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 23 states. [2019-08-05 11:21:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:23,587 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2019-08-05 11:21:23,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:21:23,587 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2019-08-05 11:21:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:23,588 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:21:23,589 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:21:23,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:21:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:21:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2019-08-05 11:21:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:21:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2019-08-05 11:21:23,593 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 83 [2019-08-05 11:21:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:23,593 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2019-08-05 11:21:23,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:21:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2019-08-05 11:21:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:21:23,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:23,594 INFO L399 BasicCegarLoop]: trace histogram [42, 21, 21, 1, 1, 1] [2019-08-05 11:21:23,594 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash -333924898, now seen corresponding path program 22 times [2019-08-05 11:21:23,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:23,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:21:23,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 0 proven. 2121 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-08-05 11:21:23,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:23,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:21:23,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:21:23,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:21:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:21:23,997 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 24 states. [2019-08-05 11:21:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:24,102 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-08-05 11:21:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:21:24,103 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2019-08-05 11:21:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:24,104 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:21:24,104 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:21:24,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:21:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:21:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-08-05 11:21:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:21:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2019-08-05 11:21:24,108 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 87 [2019-08-05 11:21:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:24,108 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2019-08-05 11:21:24,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:21:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2019-08-05 11:21:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:21:24,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:24,109 INFO L399 BasicCegarLoop]: trace histogram [44, 22, 22, 1, 1, 1] [2019-08-05 11:21:24,109 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:24,110 INFO L82 PathProgramCache]: Analyzing trace with hash 352659044, now seen corresponding path program 23 times [2019-08-05 11:21:24,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:24,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:21:24,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 0 proven. 2332 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-08-05 11:21:24,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:24,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:21:24,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:21:24,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:21:24,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:21:24,488 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand 25 states. [2019-08-05 11:21:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:24,584 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-08-05 11:21:24,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:21:24,584 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 91 [2019-08-05 11:21:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:24,586 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:21:24,586 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:21:24,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:21:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:21:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-08-05 11:21:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:21:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2019-08-05 11:21:24,589 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 91 [2019-08-05 11:21:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:24,590 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2019-08-05 11:21:24,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:21:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2019-08-05 11:21:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:21:24,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:24,591 INFO L399 BasicCegarLoop]: trace histogram [46, 23, 23, 1, 1, 1] [2019-08-05 11:21:24,591 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:24,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:24,592 INFO L82 PathProgramCache]: Analyzing trace with hash 429515754, now seen corresponding path program 24 times [2019-08-05 11:21:24,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:24,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:21:24,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 0 proven. 2553 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-08-05 11:21:24,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:24,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:21:24,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:21:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:21:24,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:21:24,921 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 26 states. [2019-08-05 11:21:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:25,042 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2019-08-05 11:21:25,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:21:25,043 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 95 [2019-08-05 11:21:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:25,044 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:21:25,044 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:21:25,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:21:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:21:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-08-05 11:21:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:21:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2019-08-05 11:21:25,049 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 95 [2019-08-05 11:21:25,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:25,049 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2019-08-05 11:21:25,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:21:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2019-08-05 11:21:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:21:25,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:25,050 INFO L399 BasicCegarLoop]: trace histogram [48, 24, 24, 1, 1, 1] [2019-08-05 11:21:25,050 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:25,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:25,051 INFO L82 PathProgramCache]: Analyzing trace with hash 585657968, now seen corresponding path program 25 times [2019-08-05 11:21:25,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:25,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:21:25,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 0 proven. 2784 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-08-05 11:21:26,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:26,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:21:26,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:21:26,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:21:26,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:26,448 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand 27 states. [2019-08-05 11:21:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:26,542 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2019-08-05 11:21:26,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:21:26,543 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2019-08-05 11:21:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:26,544 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:21:26,544 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:21:26,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:21:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2019-08-05 11:21:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:21:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions. [2019-08-05 11:21:26,549 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 99 [2019-08-05 11:21:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:26,549 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 129 transitions. [2019-08-05 11:21:26,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:21:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions. [2019-08-05 11:21:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:21:26,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:26,550 INFO L399 BasicCegarLoop]: trace histogram [50, 25, 25, 1, 1, 1] [2019-08-05 11:21:26,550 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1967277558, now seen corresponding path program 26 times [2019-08-05 11:21:26,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:26,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:21:26,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3100 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-08-05 11:21:27,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:27,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:21:27,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:21:27,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:21:27,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:21:27,235 INFO L87 Difference]: Start difference. First operand 104 states and 129 transitions. Second operand 28 states. [2019-08-05 11:21:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:27,343 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2019-08-05 11:21:27,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:21:27,343 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 103 [2019-08-05 11:21:27,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:27,344 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:21:27,345 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:21:27,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:21:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:21:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-08-05 11:21:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:21:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2019-08-05 11:21:27,348 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 103 [2019-08-05 11:21:27,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:27,348 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2019-08-05 11:21:27,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:21:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2019-08-05 11:21:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:21:27,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:27,349 INFO L399 BasicCegarLoop]: trace histogram [52, 26, 26, 1, 1, 1] [2019-08-05 11:21:27,349 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:27,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:27,349 INFO L82 PathProgramCache]: Analyzing trace with hash -801576324, now seen corresponding path program 27 times [2019-08-05 11:21:27,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:27,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:21:27,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3354 backedges. 0 proven. 3276 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-08-05 11:21:28,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:28,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:21:28,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:21:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:21:28,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:28,416 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand 29 states. [2019-08-05 11:21:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:28,511 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2019-08-05 11:21:28,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:21:28,511 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 107 [2019-08-05 11:21:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:28,512 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:21:28,513 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:21:28,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:21:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-08-05 11:21:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:21:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2019-08-05 11:21:28,517 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 107 [2019-08-05 11:21:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:28,517 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-08-05 11:21:28,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:21:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2019-08-05 11:21:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:21:28,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:28,518 INFO L399 BasicCegarLoop]: trace histogram [54, 27, 27, 1, 1, 1] [2019-08-05 11:21:28,519 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:28,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:28,519 INFO L82 PathProgramCache]: Analyzing trace with hash -828515326, now seen corresponding path program 28 times [2019-08-05 11:21:28,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:28,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:21:28,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3618 backedges. 0 proven. 3537 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 11:21:29,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:29,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:21:29,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:21:29,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:21:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:21:29,113 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand 30 states. [2019-08-05 11:21:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:29,199 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2019-08-05 11:21:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:21:29,200 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 111 [2019-08-05 11:21:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:29,201 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:21:29,201 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:21:29,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:21:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:21:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-08-05 11:21:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:21:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2019-08-05 11:21:29,205 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 111 [2019-08-05 11:21:29,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:29,205 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2019-08-05 11:21:29,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:21:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2019-08-05 11:21:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:21:29,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:29,206 INFO L399 BasicCegarLoop]: trace histogram [56, 28, 28, 1, 1, 1] [2019-08-05 11:21:29,206 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:29,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:29,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1182964360, now seen corresponding path program 29 times [2019-08-05 11:21:29,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:29,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:21:29,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3808 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-08-05 11:21:29,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:29,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:21:29,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:21:29,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:21:29,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:29,834 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand 31 states. [2019-08-05 11:21:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:29,936 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2019-08-05 11:21:29,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:21:29,936 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 115 [2019-08-05 11:21:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:29,938 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:21:29,938 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:21:29,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:21:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2019-08-05 11:21:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:21:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2019-08-05 11:21:29,942 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 115 [2019-08-05 11:21:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:29,943 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2019-08-05 11:21:29,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:21:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2019-08-05 11:21:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:21:29,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:29,944 INFO L399 BasicCegarLoop]: trace histogram [58, 29, 29, 1, 1, 1] [2019-08-05 11:21:29,944 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:29,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1455905266, now seen corresponding path program 30 times [2019-08-05 11:21:29,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:29,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:21:29,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4176 backedges. 0 proven. 4089 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-08-05 11:21:30,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:30,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:21:30,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:21:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:21:30,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:21:30,467 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 32 states. [2019-08-05 11:21:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:30,626 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2019-08-05 11:21:30,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:21:30,626 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 119 [2019-08-05 11:21:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:30,627 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:21:30,628 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:21:30,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:21:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:21:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2019-08-05 11:21:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:21:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 154 transitions. [2019-08-05 11:21:30,632 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 154 transitions. Word has length 119 [2019-08-05 11:21:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:30,632 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 154 transitions. [2019-08-05 11:21:30,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:21:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2019-08-05 11:21:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:21:30,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:30,633 INFO L399 BasicCegarLoop]: trace histogram [60, 30, 30, 1, 1, 1] [2019-08-05 11:21:30,633 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:30,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1666285204, now seen corresponding path program 31 times [2019-08-05 11:21:30,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:30,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:21:30,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 0 proven. 4380 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-08-05 11:21:31,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:31,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:21:31,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:21:31,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:21:31,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:31,132 INFO L87 Difference]: Start difference. First operand 124 states and 154 transitions. Second operand 33 states. [2019-08-05 11:21:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:31,232 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2019-08-05 11:21:31,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:21:31,232 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 123 [2019-08-05 11:21:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:31,234 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:21:31,234 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:21:31,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:21:31,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-08-05 11:21:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:21:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 159 transitions. [2019-08-05 11:21:31,238 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 159 transitions. Word has length 123 [2019-08-05 11:21:31,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:31,238 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 159 transitions. [2019-08-05 11:21:31,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:21:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2019-08-05 11:21:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:21:31,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:31,239 INFO L399 BasicCegarLoop]: trace histogram [62, 31, 31, 1, 1, 1] [2019-08-05 11:21:31,239 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:31,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:31,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1017029658, now seen corresponding path program 32 times [2019-08-05 11:21:31,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:31,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:21:31,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 0 proven. 4681 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-08-05 11:21:31,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:31,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:21:31,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:21:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:21:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:21:31,708 INFO L87 Difference]: Start difference. First operand 128 states and 159 transitions. Second operand 34 states. [2019-08-05 11:21:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:31,804 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2019-08-05 11:21:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:21:31,804 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 127 [2019-08-05 11:21:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:31,806 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:21:31,806 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:21:31,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:21:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:21:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-08-05 11:21:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 11:21:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-08-05 11:21:31,810 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 127 [2019-08-05 11:21:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:31,810 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-08-05 11:21:31,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:21:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-08-05 11:21:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 11:21:31,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:31,812 INFO L399 BasicCegarLoop]: trace histogram [64, 32, 32, 1, 1, 1] [2019-08-05 11:21:31,812 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:31,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1204709728, now seen corresponding path program 33 times [2019-08-05 11:21:31,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:31,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:21:31,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5088 backedges. 0 proven. 4992 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-08-05 11:21:33,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:33,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:21:33,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:21:33,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:21:33,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:21:33,012 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 35 states. [2019-08-05 11:21:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:33,119 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2019-08-05 11:21:33,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:21:33,120 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 131 [2019-08-05 11:21:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:33,121 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:21:33,121 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:21:33,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:21:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:21:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-08-05 11:21:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:21:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2019-08-05 11:21:33,125 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 131 [2019-08-05 11:21:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:33,125 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2019-08-05 11:21:33,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:21:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2019-08-05 11:21:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:21:33,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:33,126 INFO L399 BasicCegarLoop]: trace histogram [66, 33, 33, 1, 1, 1] [2019-08-05 11:21:33,126 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:33,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1952175654, now seen corresponding path program 34 times [2019-08-05 11:21:33,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:33,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:21:33,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5412 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:21:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:33,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:21:33,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:21:33,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:21:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:21:33,783 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand 36 states. [2019-08-05 11:21:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:34,261 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2019-08-05 11:21:34,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:21:34,261 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 135 [2019-08-05 11:21:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:34,263 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:21:34,263 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:21:34,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:21:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:21:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-08-05 11:21:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 11:21:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2019-08-05 11:21:34,268 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 135 [2019-08-05 11:21:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:34,268 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2019-08-05 11:21:34,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:21:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2019-08-05 11:21:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 11:21:34,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:34,269 INFO L399 BasicCegarLoop]: trace histogram [68, 34, 34, 1, 1, 1] [2019-08-05 11:21:34,269 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:34,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:34,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1968250196, now seen corresponding path program 35 times [2019-08-05 11:21:34,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:34,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:21:34,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5746 backedges. 0 proven. 5644 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-08-05 11:21:35,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:35,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:21:35,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:21:35,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:21:35,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:35,078 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand 37 states. [2019-08-05 11:21:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:35,190 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2019-08-05 11:21:35,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:21:35,191 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 139 [2019-08-05 11:21:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:35,192 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:21:35,193 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:21:35,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:21:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2019-08-05 11:21:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 11:21:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 179 transitions. [2019-08-05 11:21:35,197 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 179 transitions. Word has length 139 [2019-08-05 11:21:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:35,197 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 179 transitions. [2019-08-05 11:21:35,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:21:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 179 transitions. [2019-08-05 11:21:35,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 11:21:35,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:35,199 INFO L399 BasicCegarLoop]: trace histogram [70, 35, 35, 1, 1, 1] [2019-08-05 11:21:35,199 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:35,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:35,199 INFO L82 PathProgramCache]: Analyzing trace with hash -268682190, now seen corresponding path program 36 times [2019-08-05 11:21:35,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:35,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:21:35,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-08-05 11:21:35,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:35,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:21:35,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:21:35,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:21:35,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:21:35,768 INFO L87 Difference]: Start difference. First operand 144 states and 179 transitions. Second operand 38 states. [2019-08-05 11:21:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:36,454 INFO L93 Difference]: Finished difference Result 151 states and 188 transitions. [2019-08-05 11:21:36,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:21:36,454 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2019-08-05 11:21:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:36,455 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:21:36,455 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:21:36,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:21:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:21:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2019-08-05 11:21:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 11:21:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 184 transitions. [2019-08-05 11:21:36,460 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 184 transitions. Word has length 143 [2019-08-05 11:21:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:36,460 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 184 transitions. [2019-08-05 11:21:36,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:21:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions. [2019-08-05 11:21:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 11:21:36,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:36,461 INFO L399 BasicCegarLoop]: trace histogram [72, 36, 36, 1, 1, 1] [2019-08-05 11:21:36,461 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:36,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -732601672, now seen corresponding path program 37 times [2019-08-05 11:21:36,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:36,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:21:36,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6444 backedges. 0 proven. 6336 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-08-05 11:21:37,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:37,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:21:37,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:21:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:21:37,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:37,614 INFO L87 Difference]: Start difference. First operand 148 states and 184 transitions. Second operand 39 states. [2019-08-05 11:21:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:37,825 INFO L93 Difference]: Finished difference Result 155 states and 193 transitions. [2019-08-05 11:21:37,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:21:37,825 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 147 [2019-08-05 11:21:37,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:37,826 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:21:37,826 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:21:37,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:21:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-08-05 11:21:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 11:21:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 189 transitions. [2019-08-05 11:21:37,830 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 189 transitions. Word has length 147 [2019-08-05 11:21:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:37,830 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 189 transitions. [2019-08-05 11:21:37,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:21:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 189 transitions. [2019-08-05 11:21:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 11:21:37,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:37,831 INFO L399 BasicCegarLoop]: trace histogram [74, 37, 37, 1, 1, 1] [2019-08-05 11:21:37,832 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:37,832 INFO L82 PathProgramCache]: Analyzing trace with hash 51107390, now seen corresponding path program 38 times [2019-08-05 11:21:37,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:37,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:21:37,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6808 backedges. 0 proven. 6697 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-08-05 11:21:38,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:38,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:21:38,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:21:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:21:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:21:38,591 INFO L87 Difference]: Start difference. First operand 152 states and 189 transitions. Second operand 40 states. [2019-08-05 11:21:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:38,702 INFO L93 Difference]: Finished difference Result 159 states and 198 transitions. [2019-08-05 11:21:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:21:38,702 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 151 [2019-08-05 11:21:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:38,704 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:21:38,705 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:21:38,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:21:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:21:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-08-05 11:21:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 11:21:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 194 transitions. [2019-08-05 11:21:38,709 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 194 transitions. Word has length 151 [2019-08-05 11:21:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:38,709 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 194 transitions. [2019-08-05 11:21:38,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:21:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2019-08-05 11:21:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 11:21:38,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:38,710 INFO L399 BasicCegarLoop]: trace histogram [76, 38, 38, 1, 1, 1] [2019-08-05 11:21:38,711 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1118901956, now seen corresponding path program 39 times [2019-08-05 11:21:38,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:38,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:21:38,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7182 backedges. 0 proven. 7068 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:21:39,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:39,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:21:39,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:21:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:21:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:21:39,434 INFO L87 Difference]: Start difference. First operand 156 states and 194 transitions. Second operand 41 states. [2019-08-05 11:21:39,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:39,544 INFO L93 Difference]: Finished difference Result 163 states and 203 transitions. [2019-08-05 11:21:39,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:21:39,544 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 155 [2019-08-05 11:21:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:39,545 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:21:39,545 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:21:39,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:21:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:21:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2019-08-05 11:21:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:21:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 199 transitions. [2019-08-05 11:21:39,549 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 199 transitions. Word has length 155 [2019-08-05 11:21:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:39,549 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 199 transitions. [2019-08-05 11:21:39,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:21:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 199 transitions. [2019-08-05 11:21:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:21:39,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:39,550 INFO L399 BasicCegarLoop]: trace histogram [78, 39, 39, 1, 1, 1] [2019-08-05 11:21:39,550 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1256807350, now seen corresponding path program 40 times [2019-08-05 11:21:39,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:39,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:21:39,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7566 backedges. 0 proven. 7449 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-08-05 11:21:40,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:40,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:21:40,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:21:40,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:21:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:21:40,296 INFO L87 Difference]: Start difference. First operand 160 states and 199 transitions. Second operand 42 states. [2019-08-05 11:21:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:40,530 INFO L93 Difference]: Finished difference Result 167 states and 208 transitions. [2019-08-05 11:21:40,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:21:40,530 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 159 [2019-08-05 11:21:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:40,532 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:21:40,532 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:21:40,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:21:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:21:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2019-08-05 11:21:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 11:21:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2019-08-05 11:21:40,537 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 159 [2019-08-05 11:21:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:40,537 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2019-08-05 11:21:40,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:21:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2019-08-05 11:21:40,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 11:21:40,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:40,538 INFO L399 BasicCegarLoop]: trace histogram [80, 40, 40, 1, 1, 1] [2019-08-05 11:21:40,538 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:40,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:40,539 INFO L82 PathProgramCache]: Analyzing trace with hash 927858384, now seen corresponding path program 41 times [2019-08-05 11:21:40,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:40,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:21:40,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7960 backedges. 0 proven. 7840 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-08-05 11:21:41,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:41,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:21:41,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:21:41,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:21:41,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:21:41,862 INFO L87 Difference]: Start difference. First operand 164 states and 204 transitions. Second operand 43 states. [2019-08-05 11:21:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:42,047 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2019-08-05 11:21:42,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:21:42,047 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 163 [2019-08-05 11:21:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:42,050 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:21:42,050 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:21:42,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:21:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:21:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2019-08-05 11:21:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 11:21:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 209 transitions. [2019-08-05 11:21:42,056 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 209 transitions. Word has length 163 [2019-08-05 11:21:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:42,056 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 209 transitions. [2019-08-05 11:21:42,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:21:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 209 transitions. [2019-08-05 11:21:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 11:21:42,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:42,058 INFO L399 BasicCegarLoop]: trace histogram [82, 41, 41, 1, 1, 1] [2019-08-05 11:21:42,058 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:42,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:42,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1045911978, now seen corresponding path program 42 times [2019-08-05 11:21:42,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:42,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:21:42,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8364 backedges. 0 proven. 8241 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-08-05 11:21:43,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:43,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:21:43,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:21:43,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:21:43,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:21:43,225 INFO L87 Difference]: Start difference. First operand 168 states and 209 transitions. Second operand 44 states. [2019-08-05 11:21:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:43,340 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2019-08-05 11:21:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:21:43,340 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 167 [2019-08-05 11:21:43,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:43,341 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:21:43,341 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:21:43,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:21:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:21:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2019-08-05 11:21:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 11:21:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 214 transitions. [2019-08-05 11:21:43,345 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 214 transitions. Word has length 167 [2019-08-05 11:21:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:43,345 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 214 transitions. [2019-08-05 11:21:43,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:21:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 214 transitions. [2019-08-05 11:21:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 11:21:43,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:43,347 INFO L399 BasicCegarLoop]: trace histogram [84, 42, 42, 1, 1, 1] [2019-08-05 11:21:43,347 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:43,347 INFO L82 PathProgramCache]: Analyzing trace with hash -944235812, now seen corresponding path program 43 times [2019-08-05 11:21:43,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:43,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:21:43,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8652 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-08-05 11:21:44,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:44,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:21:44,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:21:44,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:21:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:21:44,487 INFO L87 Difference]: Start difference. First operand 172 states and 214 transitions. Second operand 45 states. [2019-08-05 11:21:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:44,667 INFO L93 Difference]: Finished difference Result 179 states and 223 transitions. [2019-08-05 11:21:44,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:21:44,667 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 171 [2019-08-05 11:21:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:44,669 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:21:44,669 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:21:44,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:21:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:21:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-08-05 11:21:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 11:21:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 219 transitions. [2019-08-05 11:21:44,674 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 219 transitions. Word has length 171 [2019-08-05 11:21:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:44,674 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 219 transitions. [2019-08-05 11:21:44,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:21:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 219 transitions. [2019-08-05 11:21:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 11:21:44,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:44,675 INFO L399 BasicCegarLoop]: trace histogram [86, 43, 43, 1, 1, 1] [2019-08-05 11:21:44,676 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:44,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1739727774, now seen corresponding path program 44 times [2019-08-05 11:21:44,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:44,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:21:44,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9202 backedges. 0 proven. 9073 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:21:45,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:45,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:21:45,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:21:45,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:21:45,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:21:45,488 INFO L87 Difference]: Start difference. First operand 176 states and 219 transitions. Second operand 46 states. [2019-08-05 11:21:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:45,830 INFO L93 Difference]: Finished difference Result 183 states and 228 transitions. [2019-08-05 11:21:45,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:21:45,831 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 175 [2019-08-05 11:21:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:45,833 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:21:45,833 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:21:45,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 130 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:21:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:21:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2019-08-05 11:21:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 11:21:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2019-08-05 11:21:45,837 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 175 [2019-08-05 11:21:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:45,837 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2019-08-05 11:21:45,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:21:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2019-08-05 11:21:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 11:21:45,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:45,845 INFO L399 BasicCegarLoop]: trace histogram [88, 44, 44, 1, 1, 1] [2019-08-05 11:21:45,845 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:45,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1115985176, now seen corresponding path program 45 times [2019-08-05 11:21:45,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:45,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:21:45,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9636 backedges. 0 proven. 9504 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-08-05 11:21:47,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:47,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:21:47,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:21:47,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:21:47,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:21:47,078 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand 47 states. [2019-08-05 11:21:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:47,256 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2019-08-05 11:21:47,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:21:47,257 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 179 [2019-08-05 11:21:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:47,258 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:21:47,258 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:21:47,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:21:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:21:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2019-08-05 11:21:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:21:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 229 transitions. [2019-08-05 11:21:47,263 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 229 transitions. Word has length 179 [2019-08-05 11:21:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:47,263 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 229 transitions. [2019-08-05 11:21:47,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:21:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 229 transitions. [2019-08-05 11:21:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:21:47,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:47,265 INFO L399 BasicCegarLoop]: trace histogram [90, 45, 45, 1, 1, 1] [2019-08-05 11:21:47,265 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:47,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1553090158, now seen corresponding path program 46 times [2019-08-05 11:21:47,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:47,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:21:47,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10080 backedges. 0 proven. 9945 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-08-05 11:21:48,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:48,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:21:48,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:21:48,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:21:48,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:21:48,417 INFO L87 Difference]: Start difference. First operand 184 states and 229 transitions. Second operand 48 states. [2019-08-05 11:21:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:48,550 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2019-08-05 11:21:48,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:21:48,550 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 183 [2019-08-05 11:21:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:48,552 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:21:48,552 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:21:48,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:21:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:21:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-08-05 11:21:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 11:21:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions. [2019-08-05 11:21:48,556 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 183 [2019-08-05 11:21:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:48,557 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 234 transitions. [2019-08-05 11:21:48,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:21:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions. [2019-08-05 11:21:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 11:21:48,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:48,558 INFO L399 BasicCegarLoop]: trace histogram [92, 46, 46, 1, 1, 1] [2019-08-05 11:21:48,558 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:48,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:48,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1776029964, now seen corresponding path program 47 times [2019-08-05 11:21:48,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:48,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:21:48,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 0 proven. 10396 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-08-05 11:21:51,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:51,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:21:51,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:21:51,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:21:51,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:21:51,063 INFO L87 Difference]: Start difference. First operand 188 states and 234 transitions. Second operand 49 states. [2019-08-05 11:21:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,195 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2019-08-05 11:21:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:21:51,196 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 187 [2019-08-05 11:21:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,197 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:21:51,198 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:21:51,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:21:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:21:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-08-05 11:21:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 11:21:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 239 transitions. [2019-08-05 11:21:51,202 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 239 transitions. Word has length 187 [2019-08-05 11:21:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:51,202 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 239 transitions. [2019-08-05 11:21:51,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:21:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 239 transitions. [2019-08-05 11:21:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 11:21:51,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:51,203 INFO L399 BasicCegarLoop]: trace histogram [94, 47, 47, 1, 1, 1] [2019-08-05 11:21:51,204 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:51,204 INFO L82 PathProgramCache]: Analyzing trace with hash -436083590, now seen corresponding path program 48 times [2019-08-05 11:21:51,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:51,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:21:51,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10998 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-08-05 11:21:52,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:52,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:21:52,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:21:52,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:21:52,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:21:52,260 INFO L87 Difference]: Start difference. First operand 192 states and 239 transitions. Second operand 50 states. [2019-08-05 11:21:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:52,414 INFO L93 Difference]: Finished difference Result 199 states and 248 transitions. [2019-08-05 11:21:52,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:21:52,415 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 191 [2019-08-05 11:21:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:52,417 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:21:52,417 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:21:52,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:21:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:21:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-08-05 11:21:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 11:21:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 244 transitions. [2019-08-05 11:21:52,432 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 244 transitions. Word has length 191 [2019-08-05 11:21:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:52,432 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 244 transitions. [2019-08-05 11:21:52,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:21:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 244 transitions. [2019-08-05 11:21:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 11:21:52,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:52,434 INFO L399 BasicCegarLoop]: trace histogram [96, 48, 48, 1, 1, 1] [2019-08-05 11:21:52,435 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:52,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2093111552, now seen corresponding path program 49 times [2019-08-05 11:21:52,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:52,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:21:52,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11472 backedges. 0 proven. 11328 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-08-05 11:21:53,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:53,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:21:53,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:21:53,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:21:53,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:21:53,743 INFO L87 Difference]: Start difference. First operand 196 states and 244 transitions. Second operand 51 states. [2019-08-05 11:21:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:53,886 INFO L93 Difference]: Finished difference Result 203 states and 253 transitions. [2019-08-05 11:21:53,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:21:53,887 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 195 [2019-08-05 11:21:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:53,889 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:21:53,889 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:21:53,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:21:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:21:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2019-08-05 11:21:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 11:21:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 249 transitions. [2019-08-05 11:21:53,893 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 249 transitions. Word has length 195 [2019-08-05 11:21:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:53,893 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 249 transitions. [2019-08-05 11:21:53,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:21:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 249 transitions. [2019-08-05 11:21:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 11:21:53,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:53,894 INFO L399 BasicCegarLoop]: trace histogram [98, 49, 49, 1, 1, 1] [2019-08-05 11:21:53,895 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:53,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1071073658, now seen corresponding path program 50 times [2019-08-05 11:21:53,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:53,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:21:53,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11956 backedges. 0 proven. 11809 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-08-05 11:21:54,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:54,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:21:54,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:21:54,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:21:54,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:21:54,968 INFO L87 Difference]: Start difference. First operand 200 states and 249 transitions. Second operand 52 states. [2019-08-05 11:21:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:55,114 INFO L93 Difference]: Finished difference Result 207 states and 258 transitions. [2019-08-05 11:21:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:21:55,115 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 199 [2019-08-05 11:21:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:55,117 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:21:55,117 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:21:55,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:21:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:21:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2019-08-05 11:21:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 11:21:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2019-08-05 11:21:55,121 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 199 [2019-08-05 11:21:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:55,121 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2019-08-05 11:21:55,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:21:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2019-08-05 11:21:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 11:21:55,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:55,122 INFO L399 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2019-08-05 11:21:55,123 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:55,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:55,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1783927564, now seen corresponding path program 51 times [2019-08-05 11:21:55,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:55,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:21:55,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-08-05 11:21:56,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:56,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:21:56,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:21:56,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:21:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:21:56,301 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand 53 states. [2019-08-05 11:21:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:56,447 INFO L93 Difference]: Finished difference Result 211 states and 263 transitions. [2019-08-05 11:21:56,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:21:56,448 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2019-08-05 11:21:56,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:56,450 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:21:56,450 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:21:56,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 151 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:21:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:21:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2019-08-05 11:21:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 11:21:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 259 transitions. [2019-08-05 11:21:56,454 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 259 transitions. Word has length 203 [2019-08-05 11:21:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:56,454 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 259 transitions. [2019-08-05 11:21:56,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:21:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 259 transitions. [2019-08-05 11:21:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 11:21:56,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:56,456 INFO L399 BasicCegarLoop]: trace histogram [102, 51, 51, 1, 1, 1] [2019-08-05 11:21:56,456 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash 714259602, now seen corresponding path program 52 times [2019-08-05 11:21:56,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:56,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:21:56,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12954 backedges. 0 proven. 12801 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-08-05 11:21:57,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:57,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:21:57,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:21:57,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:21:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:21:57,831 INFO L87 Difference]: Start difference. First operand 208 states and 259 transitions. Second operand 54 states. [2019-08-05 11:21:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:57,981 INFO L93 Difference]: Finished difference Result 215 states and 268 transitions. [2019-08-05 11:21:57,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:21:57,982 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 207 [2019-08-05 11:21:57,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:57,983 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:21:57,984 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:21:57,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 154 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:21:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:21:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-08-05 11:21:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 11:21:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 264 transitions. [2019-08-05 11:21:57,987 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 264 transitions. Word has length 207 [2019-08-05 11:21:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:57,988 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 264 transitions. [2019-08-05 11:21:57,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:21:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 264 transitions. [2019-08-05 11:21:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 11:21:57,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:57,989 INFO L399 BasicCegarLoop]: trace histogram [104, 52, 52, 1, 1, 1] [2019-08-05 11:21:57,989 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:57,990 INFO L82 PathProgramCache]: Analyzing trace with hash -453725416, now seen corresponding path program 53 times [2019-08-05 11:21:57,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:58,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:21:58,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 13468 backedges. 0 proven. 13312 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-08-05 11:21:59,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:59,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:21:59,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:21:59,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:21:59,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:21:59,606 INFO L87 Difference]: Start difference. First operand 212 states and 264 transitions. Second operand 55 states. [2019-08-05 11:21:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:59,785 INFO L93 Difference]: Finished difference Result 219 states and 273 transitions. [2019-08-05 11:21:59,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:21:59,785 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 211 [2019-08-05 11:21:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:59,787 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:21:59,787 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:21:59,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:21:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:21:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-08-05 11:21:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 11:21:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 269 transitions. [2019-08-05 11:21:59,791 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 269 transitions. Word has length 211 [2019-08-05 11:21:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:59,792 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 269 transitions. [2019-08-05 11:21:59,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:21:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 269 transitions. [2019-08-05 11:21:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-08-05 11:21:59,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:59,793 INFO L399 BasicCegarLoop]: trace histogram [106, 53, 53, 1, 1, 1] [2019-08-05 11:21:59,793 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:59,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash 416020126, now seen corresponding path program 54 times [2019-08-05 11:21:59,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:59,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:21:59,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13992 backedges. 0 proven. 13833 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:22:01,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:01,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:22:01,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:22:01,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:22:01,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:22:01,397 INFO L87 Difference]: Start difference. First operand 216 states and 269 transitions. Second operand 56 states. [2019-08-05 11:22:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:01,548 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2019-08-05 11:22:01,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:22:01,549 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 215 [2019-08-05 11:22:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:01,550 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:22:01,550 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:22:01,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:22:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:22:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2019-08-05 11:22:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 11:22:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 274 transitions. [2019-08-05 11:22:01,554 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 274 transitions. Word has length 215 [2019-08-05 11:22:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:01,554 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 274 transitions. [2019-08-05 11:22:01,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:22:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 274 transitions. [2019-08-05 11:22:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-08-05 11:22:01,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:01,555 INFO L399 BasicCegarLoop]: trace histogram [108, 54, 54, 1, 1, 1] [2019-08-05 11:22:01,556 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1084884772, now seen corresponding path program 55 times [2019-08-05 11:22:01,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:01,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:22:01,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 14526 backedges. 0 proven. 14364 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:22:02,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:02,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:22:02,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:22:02,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:22:02,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:22:02,779 INFO L87 Difference]: Start difference. First operand 220 states and 274 transitions. Second operand 57 states. [2019-08-05 11:22:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:02,945 INFO L93 Difference]: Finished difference Result 227 states and 283 transitions. [2019-08-05 11:22:02,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:22:02,946 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 219 [2019-08-05 11:22:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:02,948 INFO L225 Difference]: With dead ends: 227 [2019-08-05 11:22:02,948 INFO L226 Difference]: Without dead ends: 227 [2019-08-05 11:22:02,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 163 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:22:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-05 11:22:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-08-05 11:22:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 11:22:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 279 transitions. [2019-08-05 11:22:02,953 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 279 transitions. Word has length 219 [2019-08-05 11:22:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:02,953 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 279 transitions. [2019-08-05 11:22:02,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:22:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 279 transitions. [2019-08-05 11:22:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-08-05 11:22:02,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:02,955 INFO L399 BasicCegarLoop]: trace histogram [110, 55, 55, 1, 1, 1] [2019-08-05 11:22:02,955 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:02,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:02,955 INFO L82 PathProgramCache]: Analyzing trace with hash 845178026, now seen corresponding path program 56 times [2019-08-05 11:22:02,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:02,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:22:02,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15070 backedges. 0 proven. 14905 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-08-05 11:22:04,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:04,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:22:04,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:22:04,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:22:04,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:22:04,522 INFO L87 Difference]: Start difference. First operand 224 states and 279 transitions. Second operand 58 states. [2019-08-05 11:22:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:04,682 INFO L93 Difference]: Finished difference Result 231 states and 288 transitions. [2019-08-05 11:22:04,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:22:04,683 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 223 [2019-08-05 11:22:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:04,685 INFO L225 Difference]: With dead ends: 231 [2019-08-05 11:22:04,685 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 11:22:04,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:22:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 11:22:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2019-08-05 11:22:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-08-05 11:22:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 284 transitions. [2019-08-05 11:22:04,689 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 284 transitions. Word has length 223 [2019-08-05 11:22:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:04,689 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 284 transitions. [2019-08-05 11:22:04,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:22:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 284 transitions. [2019-08-05 11:22:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-08-05 11:22:04,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:04,690 INFO L399 BasicCegarLoop]: trace histogram [112, 56, 56, 1, 1, 1] [2019-08-05 11:22:04,691 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:04,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2130743088, now seen corresponding path program 57 times [2019-08-05 11:22:04,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:04,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:22:04,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15624 backedges. 0 proven. 15456 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-08-05 11:22:06,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:06,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:22:06,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:22:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:22:06,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:22:06,036 INFO L87 Difference]: Start difference. First operand 228 states and 284 transitions. Second operand 59 states. [2019-08-05 11:22:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:06,209 INFO L93 Difference]: Finished difference Result 235 states and 293 transitions. [2019-08-05 11:22:06,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:22:06,211 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 227 [2019-08-05 11:22:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:06,212 INFO L225 Difference]: With dead ends: 235 [2019-08-05 11:22:06,212 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 11:22:06,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:22:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 11:22:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-08-05 11:22:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 11:22:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 289 transitions. [2019-08-05 11:22:06,216 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 289 transitions. Word has length 227 [2019-08-05 11:22:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:06,216 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 289 transitions. [2019-08-05 11:22:06,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:22:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 289 transitions. [2019-08-05 11:22:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-08-05 11:22:06,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:06,218 INFO L399 BasicCegarLoop]: trace histogram [114, 57, 57, 1, 1, 1] [2019-08-05 11:22:06,218 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:06,218 INFO L82 PathProgramCache]: Analyzing trace with hash -757332298, now seen corresponding path program 58 times [2019-08-05 11:22:06,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:06,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:22:06,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16188 backedges. 0 proven. 16017 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-08-05 11:22:07,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:07,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:22:07,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:22:07,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:22:07,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:22:07,482 INFO L87 Difference]: Start difference. First operand 232 states and 289 transitions. Second operand 60 states. [2019-08-05 11:22:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:07,660 INFO L93 Difference]: Finished difference Result 239 states and 298 transitions. [2019-08-05 11:22:07,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:22:07,661 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 231 [2019-08-05 11:22:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:07,662 INFO L225 Difference]: With dead ends: 239 [2019-08-05 11:22:07,662 INFO L226 Difference]: Without dead ends: 239 [2019-08-05 11:22:07,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 172 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:22:07,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-05 11:22:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-08-05 11:22:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-08-05 11:22:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 294 transitions. [2019-08-05 11:22:07,666 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 294 transitions. Word has length 231 [2019-08-05 11:22:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:07,666 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 294 transitions. [2019-08-05 11:22:07,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:22:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 294 transitions. [2019-08-05 11:22:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-08-05 11:22:07,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:07,667 INFO L399 BasicCegarLoop]: trace histogram [116, 58, 58, 1, 1, 1] [2019-08-05 11:22:07,667 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:07,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1434733372, now seen corresponding path program 59 times [2019-08-05 11:22:07,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:07,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:22:07,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16762 backedges. 0 proven. 16588 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-08-05 11:22:09,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:09,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:22:09,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:22:09,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:22:09,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:22:09,086 INFO L87 Difference]: Start difference. First operand 236 states and 294 transitions. Second operand 61 states. [2019-08-05 11:22:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:09,252 INFO L93 Difference]: Finished difference Result 243 states and 303 transitions. [2019-08-05 11:22:09,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:22:09,253 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 235 [2019-08-05 11:22:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:09,254 INFO L225 Difference]: With dead ends: 243 [2019-08-05 11:22:09,255 INFO L226 Difference]: Without dead ends: 243 [2019-08-05 11:22:09,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:22:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-08-05 11:22:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2019-08-05 11:22:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-08-05 11:22:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 299 transitions. [2019-08-05 11:22:09,258 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 299 transitions. Word has length 235 [2019-08-05 11:22:09,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:09,258 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 299 transitions. [2019-08-05 11:22:09,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:22:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 299 transitions. [2019-08-05 11:22:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-08-05 11:22:09,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:09,259 INFO L399 BasicCegarLoop]: trace histogram [118, 59, 59, 1, 1, 1] [2019-08-05 11:22:09,260 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:09,260 INFO L82 PathProgramCache]: Analyzing trace with hash 164289730, now seen corresponding path program 60 times [2019-08-05 11:22:09,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:09,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:22:09,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17346 backedges. 0 proven. 17169 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-08-05 11:22:10,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:10,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:22:10,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:22:10,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:22:10,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:22:10,644 INFO L87 Difference]: Start difference. First operand 240 states and 299 transitions. Second operand 62 states. [2019-08-05 11:22:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:10,825 INFO L93 Difference]: Finished difference Result 247 states and 308 transitions. [2019-08-05 11:22:10,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:22:10,826 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 239 [2019-08-05 11:22:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:10,828 INFO L225 Difference]: With dead ends: 247 [2019-08-05 11:22:10,828 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 11:22:10,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 178 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:22:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 11:22:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2019-08-05 11:22:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 11:22:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 304 transitions. [2019-08-05 11:22:10,831 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 304 transitions. Word has length 239 [2019-08-05 11:22:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:10,831 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 304 transitions. [2019-08-05 11:22:10,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:22:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 304 transitions. [2019-08-05 11:22:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-08-05 11:22:10,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:10,832 INFO L399 BasicCegarLoop]: trace histogram [120, 60, 60, 1, 1, 1] [2019-08-05 11:22:10,833 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash 767638344, now seen corresponding path program 61 times [2019-08-05 11:22:10,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:10,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:22:10,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17940 backedges. 0 proven. 17760 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:22:12,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:12,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:22:12,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:22:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:22:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:22:12,191 INFO L87 Difference]: Start difference. First operand 244 states and 304 transitions. Second operand 63 states. [2019-08-05 11:22:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:12,375 INFO L93 Difference]: Finished difference Result 251 states and 313 transitions. [2019-08-05 11:22:12,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:22:12,376 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 243 [2019-08-05 11:22:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:12,378 INFO L225 Difference]: With dead ends: 251 [2019-08-05 11:22:12,378 INFO L226 Difference]: Without dead ends: 251 [2019-08-05 11:22:12,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:22:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-08-05 11:22:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2019-08-05 11:22:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-08-05 11:22:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 309 transitions. [2019-08-05 11:22:12,382 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 309 transitions. Word has length 243 [2019-08-05 11:22:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:12,382 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 309 transitions. [2019-08-05 11:22:12,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:22:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 309 transitions. [2019-08-05 11:22:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-08-05 11:22:12,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:12,384 INFO L399 BasicCegarLoop]: trace histogram [122, 61, 61, 1, 1, 1] [2019-08-05 11:22:12,384 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:12,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1699158322, now seen corresponding path program 62 times [2019-08-05 11:22:12,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:12,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:22:12,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18544 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-08-05 11:22:14,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:14,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:22:14,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:22:14,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:22:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:22:14,375 INFO L87 Difference]: Start difference. First operand 248 states and 309 transitions. Second operand 64 states. [2019-08-05 11:22:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:14,559 INFO L93 Difference]: Finished difference Result 255 states and 318 transitions. [2019-08-05 11:22:14,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:22:14,560 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 247 [2019-08-05 11:22:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:14,561 INFO L225 Difference]: With dead ends: 255 [2019-08-05 11:22:14,561 INFO L226 Difference]: Without dead ends: 255 [2019-08-05 11:22:14,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:22:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-05 11:22:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2019-08-05 11:22:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-08-05 11:22:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 314 transitions. [2019-08-05 11:22:14,564 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 314 transitions. Word has length 247 [2019-08-05 11:22:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:14,564 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 314 transitions. [2019-08-05 11:22:14,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:22:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 314 transitions. [2019-08-05 11:22:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-08-05 11:22:14,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:14,566 INFO L399 BasicCegarLoop]: trace histogram [124, 62, 62, 1, 1, 1] [2019-08-05 11:22:14,566 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:14,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:14,566 INFO L82 PathProgramCache]: Analyzing trace with hash 625172308, now seen corresponding path program 63 times [2019-08-05 11:22:14,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:14,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:22:14,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 19158 backedges. 0 proven. 18972 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-08-05 11:22:16,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:16,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:22:16,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:22:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:22:16,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:22:16,105 INFO L87 Difference]: Start difference. First operand 252 states and 314 transitions. Second operand 65 states. [2019-08-05 11:22:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:16,300 INFO L93 Difference]: Finished difference Result 259 states and 323 transitions. [2019-08-05 11:22:16,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:22:16,301 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 251 [2019-08-05 11:22:16,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:16,302 INFO L225 Difference]: With dead ends: 259 [2019-08-05 11:22:16,302 INFO L226 Difference]: Without dead ends: 259 [2019-08-05 11:22:16,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:22:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-08-05 11:22:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-08-05 11:22:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-08-05 11:22:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 319 transitions. [2019-08-05 11:22:16,306 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 319 transitions. Word has length 251 [2019-08-05 11:22:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:16,306 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 319 transitions. [2019-08-05 11:22:16,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:22:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 319 transitions. [2019-08-05 11:22:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-08-05 11:22:16,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:16,307 INFO L399 BasicCegarLoop]: trace histogram [126, 63, 63, 1, 1, 1] [2019-08-05 11:22:16,307 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash -47045414, now seen corresponding path program 64 times [2019-08-05 11:22:16,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:16,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:22:16,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 19782 backedges. 0 proven. 19593 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-08-05 11:22:18,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:18,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:22:18,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:22:18,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:22:18,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:22:18,615 INFO L87 Difference]: Start difference. First operand 256 states and 319 transitions. Second operand 66 states. [2019-08-05 11:22:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:18,877 INFO L93 Difference]: Finished difference Result 263 states and 328 transitions. [2019-08-05 11:22:18,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:22:18,877 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 255 [2019-08-05 11:22:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:18,878 INFO L225 Difference]: With dead ends: 263 [2019-08-05 11:22:18,878 INFO L226 Difference]: Without dead ends: 263 [2019-08-05 11:22:18,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:22:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-08-05 11:22:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2019-08-05 11:22:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-08-05 11:22:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 324 transitions. [2019-08-05 11:22:18,881 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 324 transitions. Word has length 255 [2019-08-05 11:22:18,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:18,881 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 324 transitions. [2019-08-05 11:22:18,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:22:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 324 transitions. [2019-08-05 11:22:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-08-05 11:22:18,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:18,882 INFO L399 BasicCegarLoop]: trace histogram [128, 64, 64, 1, 1, 1] [2019-08-05 11:22:18,882 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:18,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:18,883 INFO L82 PathProgramCache]: Analyzing trace with hash 227981152, now seen corresponding path program 65 times [2019-08-05 11:22:18,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:18,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:22:18,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 20416 backedges. 0 proven. 20224 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:22:20,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:20,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:22:20,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:22:20,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:22:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:22:20,424 INFO L87 Difference]: Start difference. First operand 260 states and 324 transitions. Second operand 67 states. [2019-08-05 11:22:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:20,630 INFO L93 Difference]: Finished difference Result 267 states and 333 transitions. [2019-08-05 11:22:20,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:22:20,630 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 259 [2019-08-05 11:22:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:20,632 INFO L225 Difference]: With dead ends: 267 [2019-08-05 11:22:20,632 INFO L226 Difference]: Without dead ends: 267 [2019-08-05 11:22:20,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 193 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:22:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-08-05 11:22:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264. [2019-08-05 11:22:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-08-05 11:22:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 329 transitions. [2019-08-05 11:22:20,637 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 329 transitions. Word has length 259 [2019-08-05 11:22:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:20,637 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 329 transitions. [2019-08-05 11:22:20,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:22:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 329 transitions. [2019-08-05 11:22:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-08-05 11:22:20,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:20,639 INFO L399 BasicCegarLoop]: trace histogram [130, 65, 65, 1, 1, 1] [2019-08-05 11:22:20,639 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:20,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1556256486, now seen corresponding path program 66 times [2019-08-05 11:22:20,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:20,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:22:20,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21060 backedges. 0 proven. 20865 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-08-05 11:22:22,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:22,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:22:22,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:22:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:22:22,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:22:22,238 INFO L87 Difference]: Start difference. First operand 264 states and 329 transitions. Second operand 68 states. [2019-08-05 11:22:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:22,439 INFO L93 Difference]: Finished difference Result 271 states and 338 transitions. [2019-08-05 11:22:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:22:22,440 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 263 [2019-08-05 11:22:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:22,441 INFO L225 Difference]: With dead ends: 271 [2019-08-05 11:22:22,441 INFO L226 Difference]: Without dead ends: 271 [2019-08-05 11:22:22,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:22:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-08-05 11:22:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2019-08-05 11:22:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 11:22:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 334 transitions. [2019-08-05 11:22:22,446 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 334 transitions. Word has length 263 [2019-08-05 11:22:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:22,446 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 334 transitions. [2019-08-05 11:22:22,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:22:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 334 transitions. [2019-08-05 11:22:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-08-05 11:22:22,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:22,448 INFO L399 BasicCegarLoop]: trace histogram [132, 66, 66, 1, 1, 1] [2019-08-05 11:22:22,448 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:22,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1816609644, now seen corresponding path program 67 times [2019-08-05 11:22:22,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:22,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:22:22,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21714 backedges. 0 proven. 21516 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-08-05 11:22:24,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:24,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:22:24,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:22:24,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:22:24,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:22:24,321 INFO L87 Difference]: Start difference. First operand 268 states and 334 transitions. Second operand 69 states. [2019-08-05 11:22:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:24,544 INFO L93 Difference]: Finished difference Result 275 states and 343 transitions. [2019-08-05 11:22:24,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:22:24,544 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 267 [2019-08-05 11:22:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:24,546 INFO L225 Difference]: With dead ends: 275 [2019-08-05 11:22:24,546 INFO L226 Difference]: Without dead ends: 275 [2019-08-05 11:22:24,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:22:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-08-05 11:22:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2019-08-05 11:22:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-08-05 11:22:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 339 transitions. [2019-08-05 11:22:24,549 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 339 transitions. Word has length 267 [2019-08-05 11:22:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:24,550 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 339 transitions. [2019-08-05 11:22:24,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:22:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 339 transitions. [2019-08-05 11:22:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-08-05 11:22:24,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:24,551 INFO L399 BasicCegarLoop]: trace histogram [134, 67, 67, 1, 1, 1] [2019-08-05 11:22:24,551 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:24,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1728693006, now seen corresponding path program 68 times [2019-08-05 11:22:24,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:24,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:22:24,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 22378 backedges. 0 proven. 22177 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-08-05 11:22:26,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:26,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:22:26,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:22:26,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:22:26,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:22:26,203 INFO L87 Difference]: Start difference. First operand 272 states and 339 transitions. Second operand 70 states. [2019-08-05 11:22:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:27,084 INFO L93 Difference]: Finished difference Result 279 states and 348 transitions. [2019-08-05 11:22:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:22:27,085 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 271 [2019-08-05 11:22:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:27,087 INFO L225 Difference]: With dead ends: 279 [2019-08-05 11:22:27,087 INFO L226 Difference]: Without dead ends: 279 [2019-08-05 11:22:27,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 202 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:22:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-08-05 11:22:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-08-05 11:22:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-08-05 11:22:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 344 transitions. [2019-08-05 11:22:27,093 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 344 transitions. Word has length 271 [2019-08-05 11:22:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:27,094 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 344 transitions. [2019-08-05 11:22:27,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:22:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 344 transitions. [2019-08-05 11:22:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-08-05 11:22:27,095 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:27,095 INFO L399 BasicCegarLoop]: trace histogram [136, 68, 68, 1, 1, 1] [2019-08-05 11:22:27,096 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:27,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:27,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2061566840, now seen corresponding path program 69 times [2019-08-05 11:22:27,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:27,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:22:27,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23052 backedges. 0 proven. 22848 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-08-05 11:22:29,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:29,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:22:29,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:22:29,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:22:29,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:22:29,343 INFO L87 Difference]: Start difference. First operand 276 states and 344 transitions. Second operand 71 states. [2019-08-05 11:22:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:29,561 INFO L93 Difference]: Finished difference Result 283 states and 353 transitions. [2019-08-05 11:22:29,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:22:29,562 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 275 [2019-08-05 11:22:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:29,564 INFO L225 Difference]: With dead ends: 283 [2019-08-05 11:22:29,564 INFO L226 Difference]: Without dead ends: 283 [2019-08-05 11:22:29,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:22:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-08-05 11:22:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 280. [2019-08-05 11:22:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-08-05 11:22:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 349 transitions. [2019-08-05 11:22:29,568 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 349 transitions. Word has length 275 [2019-08-05 11:22:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:29,568 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 349 transitions. [2019-08-05 11:22:29,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:22:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 349 transitions. [2019-08-05 11:22:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-08-05 11:22:29,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:29,570 INFO L399 BasicCegarLoop]: trace histogram [138, 69, 69, 1, 1, 1] [2019-08-05 11:22:29,570 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1163466494, now seen corresponding path program 70 times [2019-08-05 11:22:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:29,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:22:29,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 23736 backedges. 0 proven. 23529 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-08-05 11:22:31,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:31,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:22:31,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:22:31,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:22:31,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:22:31,529 INFO L87 Difference]: Start difference. First operand 280 states and 349 transitions. Second operand 72 states. [2019-08-05 11:22:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:31,751 INFO L93 Difference]: Finished difference Result 287 states and 358 transitions. [2019-08-05 11:22:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:22:31,752 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 279 [2019-08-05 11:22:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:31,754 INFO L225 Difference]: With dead ends: 287 [2019-08-05 11:22:31,754 INFO L226 Difference]: Without dead ends: 287 [2019-08-05 11:22:31,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:22:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-08-05 11:22:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-08-05 11:22:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-08-05 11:22:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 354 transitions. [2019-08-05 11:22:31,758 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 354 transitions. Word has length 279 [2019-08-05 11:22:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:31,758 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 354 transitions. [2019-08-05 11:22:31,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:22:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 354 transitions. [2019-08-05 11:22:31,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-08-05 11:22:31,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:31,759 INFO L399 BasicCegarLoop]: trace histogram [140, 70, 70, 1, 1, 1] [2019-08-05 11:22:31,759 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:31,760 INFO L82 PathProgramCache]: Analyzing trace with hash 653260676, now seen corresponding path program 71 times [2019-08-05 11:22:31,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:31,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:22:31,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24430 backedges. 0 proven. 24220 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-08-05 11:22:33,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:33,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:22:33,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:22:33,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:22:33,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:22:33,548 INFO L87 Difference]: Start difference. First operand 284 states and 354 transitions. Second operand 73 states. [2019-08-05 11:22:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:33,774 INFO L93 Difference]: Finished difference Result 291 states and 363 transitions. [2019-08-05 11:22:33,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:22:33,775 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 283 [2019-08-05 11:22:33,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:33,777 INFO L225 Difference]: With dead ends: 291 [2019-08-05 11:22:33,777 INFO L226 Difference]: Without dead ends: 291 [2019-08-05 11:22:33,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:22:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-08-05 11:22:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2019-08-05 11:22:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-08-05 11:22:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 359 transitions. [2019-08-05 11:22:33,781 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 359 transitions. Word has length 283 [2019-08-05 11:22:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:33,782 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 359 transitions. [2019-08-05 11:22:33,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:22:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 359 transitions. [2019-08-05 11:22:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-08-05 11:22:33,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:33,783 INFO L399 BasicCegarLoop]: trace histogram [142, 71, 71, 1, 1, 1] [2019-08-05 11:22:33,784 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1451809526, now seen corresponding path program 72 times [2019-08-05 11:22:33,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:33,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:22:33,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 25134 backedges. 0 proven. 24921 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-08-05 11:22:35,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:35,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:22:35,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:22:35,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:22:35,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:22:35,933 INFO L87 Difference]: Start difference. First operand 288 states and 359 transitions. Second operand 74 states. [2019-08-05 11:22:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:36,217 INFO L93 Difference]: Finished difference Result 295 states and 368 transitions. [2019-08-05 11:22:36,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:22:36,217 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 287 [2019-08-05 11:22:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:36,219 INFO L225 Difference]: With dead ends: 295 [2019-08-05 11:22:36,220 INFO L226 Difference]: Without dead ends: 295 [2019-08-05 11:22:36,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:22:36,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-08-05 11:22:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2019-08-05 11:22:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-08-05 11:22:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 364 transitions. [2019-08-05 11:22:36,223 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 364 transitions. Word has length 287 [2019-08-05 11:22:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:36,223 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 364 transitions. [2019-08-05 11:22:36,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:22:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 364 transitions. [2019-08-05 11:22:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-08-05 11:22:36,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:36,225 INFO L399 BasicCegarLoop]: trace histogram [144, 72, 72, 1, 1, 1] [2019-08-05 11:22:36,226 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:36,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash 301997968, now seen corresponding path program 73 times [2019-08-05 11:22:36,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:36,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:22:36,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 25848 backedges. 0 proven. 25632 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-08-05 11:22:38,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:38,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:22:38,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:22:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:22:38,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:22:38,193 INFO L87 Difference]: Start difference. First operand 292 states and 364 transitions. Second operand 75 states. [2019-08-05 11:22:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:38,419 INFO L93 Difference]: Finished difference Result 299 states and 373 transitions. [2019-08-05 11:22:38,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:22:38,420 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 291 [2019-08-05 11:22:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:38,421 INFO L225 Difference]: With dead ends: 299 [2019-08-05 11:22:38,421 INFO L226 Difference]: Without dead ends: 299 [2019-08-05 11:22:38,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:22:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-08-05 11:22:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-08-05 11:22:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-08-05 11:22:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 369 transitions. [2019-08-05 11:22:38,424 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 369 transitions. Word has length 291 [2019-08-05 11:22:38,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:38,424 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 369 transitions. [2019-08-05 11:22:38,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:22:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 369 transitions. [2019-08-05 11:22:38,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-08-05 11:22:38,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:38,426 INFO L399 BasicCegarLoop]: trace histogram [146, 73, 73, 1, 1, 1] [2019-08-05 11:22:38,426 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:38,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:38,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1059297514, now seen corresponding path program 74 times [2019-08-05 11:22:38,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:38,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:22:38,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 26572 backedges. 0 proven. 26353 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:22:40,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:40,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:22:40,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:22:40,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:22:40,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:22:40,416 INFO L87 Difference]: Start difference. First operand 296 states and 369 transitions. Second operand 76 states. [2019-08-05 11:22:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:40,646 INFO L93 Difference]: Finished difference Result 303 states and 378 transitions. [2019-08-05 11:22:40,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:22:40,647 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 295 [2019-08-05 11:22:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:40,649 INFO L225 Difference]: With dead ends: 303 [2019-08-05 11:22:40,649 INFO L226 Difference]: Without dead ends: 303 [2019-08-05 11:22:40,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:22:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-08-05 11:22:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2019-08-05 11:22:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-08-05 11:22:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 374 transitions. [2019-08-05 11:22:40,653 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 374 transitions. Word has length 295 [2019-08-05 11:22:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:40,653 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 374 transitions. [2019-08-05 11:22:40,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:22:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 374 transitions. [2019-08-05 11:22:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-08-05 11:22:40,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:40,654 INFO L399 BasicCegarLoop]: trace histogram [148, 74, 74, 1, 1, 1] [2019-08-05 11:22:40,654 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1851950180, now seen corresponding path program 75 times [2019-08-05 11:22:40,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:40,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:22:40,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 27306 backedges. 0 proven. 27084 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-08-05 11:22:42,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:42,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:22:42,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:22:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:22:42,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:22:42,635 INFO L87 Difference]: Start difference. First operand 300 states and 374 transitions. Second operand 77 states. [2019-08-05 11:22:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:42,930 INFO L93 Difference]: Finished difference Result 307 states and 383 transitions. [2019-08-05 11:22:42,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:22:42,931 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 299 [2019-08-05 11:22:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:42,933 INFO L225 Difference]: With dead ends: 307 [2019-08-05 11:22:42,933 INFO L226 Difference]: Without dead ends: 307 [2019-08-05 11:22:42,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:22:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-08-05 11:22:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 304. [2019-08-05 11:22:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 11:22:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 379 transitions. [2019-08-05 11:22:42,936 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 379 transitions. Word has length 299 [2019-08-05 11:22:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:42,937 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 379 transitions. [2019-08-05 11:22:42,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:22:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 379 transitions. [2019-08-05 11:22:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-08-05 11:22:42,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:42,938 INFO L399 BasicCegarLoop]: trace histogram [150, 75, 75, 1, 1, 1] [2019-08-05 11:22:42,938 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:42,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:42,938 INFO L82 PathProgramCache]: Analyzing trace with hash 991223074, now seen corresponding path program 76 times [2019-08-05 11:22:42,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:42,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:22:42,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 28050 backedges. 0 proven. 27825 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-08-05 11:22:44,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:44,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:22:44,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:22:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:22:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:22:44,976 INFO L87 Difference]: Start difference. First operand 304 states and 379 transitions. Second operand 78 states. [2019-08-05 11:22:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:45,222 INFO L93 Difference]: Finished difference Result 311 states and 388 transitions. [2019-08-05 11:22:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:22:45,223 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 303 [2019-08-05 11:22:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:45,224 INFO L225 Difference]: With dead ends: 311 [2019-08-05 11:22:45,225 INFO L226 Difference]: Without dead ends: 311 [2019-08-05 11:22:45,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:22:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-08-05 11:22:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 308. [2019-08-05 11:22:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 11:22:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 384 transitions. [2019-08-05 11:22:45,228 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 384 transitions. Word has length 303 [2019-08-05 11:22:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:45,228 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 384 transitions. [2019-08-05 11:22:45,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:22:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 384 transitions. [2019-08-05 11:22:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-08-05 11:22:45,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:45,230 INFO L399 BasicCegarLoop]: trace histogram [152, 76, 76, 1, 1, 1] [2019-08-05 11:22:45,230 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:45,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1353446488, now seen corresponding path program 77 times [2019-08-05 11:22:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:45,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:22:45,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 28804 backedges. 0 proven. 28576 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-08-05 11:22:47,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:47,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:22:47,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:22:47,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:22:47,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:22:47,663 INFO L87 Difference]: Start difference. First operand 308 states and 384 transitions. Second operand 79 states. [2019-08-05 11:22:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:47,912 INFO L93 Difference]: Finished difference Result 315 states and 393 transitions. [2019-08-05 11:22:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:22:47,912 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 307 [2019-08-05 11:22:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:47,914 INFO L225 Difference]: With dead ends: 315 [2019-08-05 11:22:47,914 INFO L226 Difference]: Without dead ends: 315 [2019-08-05 11:22:47,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:22:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-08-05 11:22:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2019-08-05 11:22:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-08-05 11:22:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 389 transitions. [2019-08-05 11:22:47,917 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 389 transitions. Word has length 307 [2019-08-05 11:22:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:47,918 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 389 transitions. [2019-08-05 11:22:47,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:22:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 389 transitions. [2019-08-05 11:22:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-08-05 11:22:47,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:47,919 INFO L399 BasicCegarLoop]: trace histogram [154, 77, 77, 1, 1, 1] [2019-08-05 11:22:47,919 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2074904366, now seen corresponding path program 78 times [2019-08-05 11:22:47,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:47,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:22:47,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 29568 backedges. 0 proven. 29337 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-08-05 11:22:50,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:50,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:22:50,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:22:50,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:22:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:22:50,316 INFO L87 Difference]: Start difference. First operand 312 states and 389 transitions. Second operand 80 states. [2019-08-05 11:22:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:50,565 INFO L93 Difference]: Finished difference Result 319 states and 398 transitions. [2019-08-05 11:22:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:22:50,566 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 311 [2019-08-05 11:22:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:50,568 INFO L225 Difference]: With dead ends: 319 [2019-08-05 11:22:50,568 INFO L226 Difference]: Without dead ends: 319 [2019-08-05 11:22:50,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 232 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:22:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-08-05 11:22:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-08-05 11:22:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 11:22:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 394 transitions. [2019-08-05 11:22:50,572 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 394 transitions. Word has length 311 [2019-08-05 11:22:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:50,572 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 394 transitions. [2019-08-05 11:22:50,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:22:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 394 transitions. [2019-08-05 11:22:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-08-05 11:22:50,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:50,573 INFO L399 BasicCegarLoop]: trace histogram [156, 78, 78, 1, 1, 1] [2019-08-05 11:22:50,573 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash 682610612, now seen corresponding path program 79 times [2019-08-05 11:22:50,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:50,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:22:50,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 30342 backedges. 0 proven. 30108 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-08-05 11:22:52,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:52,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:22:52,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:22:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:22:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:22:52,787 INFO L87 Difference]: Start difference. First operand 316 states and 394 transitions. Second operand 81 states. [2019-08-05 11:22:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:53,063 INFO L93 Difference]: Finished difference Result 323 states and 403 transitions. [2019-08-05 11:22:53,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:22:53,063 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 315 [2019-08-05 11:22:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:53,065 INFO L225 Difference]: With dead ends: 323 [2019-08-05 11:22:53,066 INFO L226 Difference]: Without dead ends: 323 [2019-08-05 11:22:53,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:22:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-08-05 11:22:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2019-08-05 11:22:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-08-05 11:22:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 399 transitions. [2019-08-05 11:22:53,069 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 399 transitions. Word has length 315 [2019-08-05 11:22:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:53,070 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 399 transitions. [2019-08-05 11:22:53,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:22:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 399 transitions. [2019-08-05 11:22:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-08-05 11:22:53,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:53,071 INFO L399 BasicCegarLoop]: trace histogram [158, 79, 79, 1, 1, 1] [2019-08-05 11:22:53,071 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:53,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:53,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1708169926, now seen corresponding path program 80 times [2019-08-05 11:22:53,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:53,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:22:53,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 31126 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-08-05 11:22:55,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:55,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:22:55,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:22:55,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:22:55,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:22:55,515 INFO L87 Difference]: Start difference. First operand 320 states and 399 transitions. Second operand 82 states. [2019-08-05 11:22:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:55,767 INFO L93 Difference]: Finished difference Result 327 states and 408 transitions. [2019-08-05 11:22:55,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:22:55,768 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 319 [2019-08-05 11:22:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:55,770 INFO L225 Difference]: With dead ends: 327 [2019-08-05 11:22:55,770 INFO L226 Difference]: Without dead ends: 327 [2019-08-05 11:22:55,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:22:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-08-05 11:22:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2019-08-05 11:22:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-08-05 11:22:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 404 transitions. [2019-08-05 11:22:55,774 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 404 transitions. Word has length 319 [2019-08-05 11:22:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:55,774 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 404 transitions. [2019-08-05 11:22:55,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:22:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 404 transitions. [2019-08-05 11:22:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-08-05 11:22:55,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:55,775 INFO L399 BasicCegarLoop]: trace histogram [160, 80, 80, 1, 1, 1] [2019-08-05 11:22:55,776 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:55,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1866254272, now seen corresponding path program 81 times [2019-08-05 11:22:55,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:55,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:22:55,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 31920 backedges. 0 proven. 31680 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-08-05 11:22:58,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:58,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:22:58,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:22:58,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:22:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:22:58,104 INFO L87 Difference]: Start difference. First operand 324 states and 404 transitions. Second operand 83 states. [2019-08-05 11:22:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:58,366 INFO L93 Difference]: Finished difference Result 331 states and 413 transitions. [2019-08-05 11:22:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:22:58,367 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 323 [2019-08-05 11:22:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:58,368 INFO L225 Difference]: With dead ends: 331 [2019-08-05 11:22:58,368 INFO L226 Difference]: Without dead ends: 331 [2019-08-05 11:22:58,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:22:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-08-05 11:22:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 328. [2019-08-05 11:22:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-08-05 11:22:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 409 transitions. [2019-08-05 11:22:58,371 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 409 transitions. Word has length 323 [2019-08-05 11:22:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:58,371 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 409 transitions. [2019-08-05 11:22:58,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:22:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 409 transitions. [2019-08-05 11:22:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-08-05 11:22:58,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:58,373 INFO L399 BasicCegarLoop]: trace histogram [162, 81, 81, 1, 1, 1] [2019-08-05 11:22:58,373 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:58,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1646884678, now seen corresponding path program 82 times [2019-08-05 11:22:58,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:58,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:22:58,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 32724 backedges. 0 proven. 32481 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-08-05 11:23:00,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:00,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:23:00,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:23:00,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:23:00,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:23:00,884 INFO L87 Difference]: Start difference. First operand 328 states and 409 transitions. Second operand 84 states. [2019-08-05 11:23:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:01,146 INFO L93 Difference]: Finished difference Result 335 states and 418 transitions. [2019-08-05 11:23:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:23:01,147 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 327 [2019-08-05 11:23:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:01,149 INFO L225 Difference]: With dead ends: 335 [2019-08-05 11:23:01,149 INFO L226 Difference]: Without dead ends: 335 [2019-08-05 11:23:01,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:23:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-08-05 11:23:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2019-08-05 11:23:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-08-05 11:23:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 414 transitions. [2019-08-05 11:23:01,153 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 414 transitions. Word has length 327 [2019-08-05 11:23:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:01,153 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 414 transitions. [2019-08-05 11:23:01,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:23:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 414 transitions. [2019-08-05 11:23:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-08-05 11:23:01,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:01,154 INFO L399 BasicCegarLoop]: trace histogram [164, 82, 82, 1, 1, 1] [2019-08-05 11:23:01,155 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1467550772, now seen corresponding path program 83 times [2019-08-05 11:23:01,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:01,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:23:01,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 33538 backedges. 0 proven. 33292 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-08-05 11:23:03,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:03,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:23:03,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:23:03,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:23:03,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:23:03,758 INFO L87 Difference]: Start difference. First operand 332 states and 414 transitions. Second operand 85 states. [2019-08-05 11:23:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:04,030 INFO L93 Difference]: Finished difference Result 339 states and 423 transitions. [2019-08-05 11:23:04,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:23:04,031 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 331 [2019-08-05 11:23:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:04,033 INFO L225 Difference]: With dead ends: 339 [2019-08-05 11:23:04,033 INFO L226 Difference]: Without dead ends: 339 [2019-08-05 11:23:04,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:23:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-08-05 11:23:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-08-05 11:23:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-08-05 11:23:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 419 transitions. [2019-08-05 11:23:04,037 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 419 transitions. Word has length 331 [2019-08-05 11:23:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:04,037 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 419 transitions. [2019-08-05 11:23:04,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:23:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 419 transitions. [2019-08-05 11:23:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-08-05 11:23:04,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:04,039 INFO L399 BasicCegarLoop]: trace histogram [166, 83, 83, 1, 1, 1] [2019-08-05 11:23:04,039 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1395047762, now seen corresponding path program 84 times [2019-08-05 11:23:04,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:04,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:23:04,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34362 backedges. 0 proven. 34113 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-08-05 11:23:06,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:06,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:23:06,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:23:06,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:23:06,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:23:06,716 INFO L87 Difference]: Start difference. First operand 336 states and 419 transitions. Second operand 86 states. [2019-08-05 11:23:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:06,988 INFO L93 Difference]: Finished difference Result 343 states and 428 transitions. [2019-08-05 11:23:06,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:23:06,988 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 335 [2019-08-05 11:23:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:06,990 INFO L225 Difference]: With dead ends: 343 [2019-08-05 11:23:06,990 INFO L226 Difference]: Without dead ends: 343 [2019-08-05 11:23:06,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:23:06,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-08-05 11:23:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 340. [2019-08-05 11:23:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-08-05 11:23:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 424 transitions. [2019-08-05 11:23:06,994 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 424 transitions. Word has length 335 [2019-08-05 11:23:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:06,995 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 424 transitions. [2019-08-05 11:23:06,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:23:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 424 transitions. [2019-08-05 11:23:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-08-05 11:23:06,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:06,996 INFO L399 BasicCegarLoop]: trace histogram [168, 84, 84, 1, 1, 1] [2019-08-05 11:23:06,996 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:06,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1374006312, now seen corresponding path program 85 times [2019-08-05 11:23:06,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:07,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:23:07,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 35196 backedges. 0 proven. 34944 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-08-05 11:23:09,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:09,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:23:09,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:23:09,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:23:09,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:23:09,516 INFO L87 Difference]: Start difference. First operand 340 states and 424 transitions. Second operand 87 states. [2019-08-05 11:23:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:09,802 INFO L93 Difference]: Finished difference Result 347 states and 433 transitions. [2019-08-05 11:23:09,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:23:09,802 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 339 [2019-08-05 11:23:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:09,804 INFO L225 Difference]: With dead ends: 347 [2019-08-05 11:23:09,804 INFO L226 Difference]: Without dead ends: 347 [2019-08-05 11:23:09,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:23:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-08-05 11:23:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2019-08-05 11:23:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 11:23:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 429 transitions. [2019-08-05 11:23:09,807 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 429 transitions. Word has length 339 [2019-08-05 11:23:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:09,807 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 429 transitions. [2019-08-05 11:23:09,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:23:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 429 transitions. [2019-08-05 11:23:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-08-05 11:23:09,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:09,809 INFO L399 BasicCegarLoop]: trace histogram [170, 85, 85, 1, 1, 1] [2019-08-05 11:23:09,809 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:09,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:09,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1598867618, now seen corresponding path program 86 times [2019-08-05 11:23:09,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:09,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:23:09,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 36040 backedges. 0 proven. 35785 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-08-05 11:23:12,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:12,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:23:12,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:23:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:23:12,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:23:12,542 INFO L87 Difference]: Start difference. First operand 344 states and 429 transitions. Second operand 88 states. [2019-08-05 11:23:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:12,845 INFO L93 Difference]: Finished difference Result 351 states and 438 transitions. [2019-08-05 11:23:12,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:23:12,845 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 343 [2019-08-05 11:23:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:12,847 INFO L225 Difference]: With dead ends: 351 [2019-08-05 11:23:12,847 INFO L226 Difference]: Without dead ends: 351 [2019-08-05 11:23:12,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:23:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-08-05 11:23:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 348. [2019-08-05 11:23:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-08-05 11:23:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 434 transitions. [2019-08-05 11:23:12,851 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 434 transitions. Word has length 343 [2019-08-05 11:23:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:12,851 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 434 transitions. [2019-08-05 11:23:12,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:23:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 434 transitions. [2019-08-05 11:23:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-08-05 11:23:12,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:12,852 INFO L399 BasicCegarLoop]: trace histogram [172, 86, 86, 1, 1, 1] [2019-08-05 11:23:12,853 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 226682852, now seen corresponding path program 87 times [2019-08-05 11:23:12,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:12,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:23:12,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 36894 backedges. 0 proven. 36636 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-08-05 11:23:15,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:15,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:23:15,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:23:15,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:23:15,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:23:15,697 INFO L87 Difference]: Start difference. First operand 348 states and 434 transitions. Second operand 89 states. [2019-08-05 11:23:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:15,980 INFO L93 Difference]: Finished difference Result 355 states and 443 transitions. [2019-08-05 11:23:15,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:23:15,981 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 347 [2019-08-05 11:23:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:15,982 INFO L225 Difference]: With dead ends: 355 [2019-08-05 11:23:15,982 INFO L226 Difference]: Without dead ends: 355 [2019-08-05 11:23:15,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:23:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-08-05 11:23:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2019-08-05 11:23:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-08-05 11:23:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 439 transitions. [2019-08-05 11:23:15,986 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 439 transitions. Word has length 347 [2019-08-05 11:23:15,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:15,986 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 439 transitions. [2019-08-05 11:23:15,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:23:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 439 transitions. [2019-08-05 11:23:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-08-05 11:23:15,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:15,988 INFO L399 BasicCegarLoop]: trace histogram [174, 87, 87, 1, 1, 1] [2019-08-05 11:23:15,988 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:15,988 INFO L82 PathProgramCache]: Analyzing trace with hash 844817770, now seen corresponding path program 88 times [2019-08-05 11:23:15,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:16,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:23:16,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 37758 backedges. 0 proven. 37497 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-08-05 11:23:18,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:18,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:23:18,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:23:18,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:23:18,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:23:18,722 INFO L87 Difference]: Start difference. First operand 352 states and 439 transitions. Second operand 90 states. [2019-08-05 11:23:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:19,014 INFO L93 Difference]: Finished difference Result 359 states and 448 transitions. [2019-08-05 11:23:19,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:23:19,014 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 351 [2019-08-05 11:23:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:19,016 INFO L225 Difference]: With dead ends: 359 [2019-08-05 11:23:19,016 INFO L226 Difference]: Without dead ends: 359 [2019-08-05 11:23:19,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:23:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-08-05 11:23:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-08-05 11:23:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-08-05 11:23:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 444 transitions. [2019-08-05 11:23:19,020 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 444 transitions. Word has length 351 [2019-08-05 11:23:19,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:19,021 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 444 transitions. [2019-08-05 11:23:19,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:23:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 444 transitions. [2019-08-05 11:23:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-08-05 11:23:19,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:19,022 INFO L399 BasicCegarLoop]: trace histogram [176, 88, 88, 1, 1, 1] [2019-08-05 11:23:19,022 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:19,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:19,022 INFO L82 PathProgramCache]: Analyzing trace with hash 139243504, now seen corresponding path program 89 times [2019-08-05 11:23:19,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:19,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:23:19,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 38632 backedges. 0 proven. 38368 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-08-05 11:23:21,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:21,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:23:21,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:23:21,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:23:21,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:23:21,872 INFO L87 Difference]: Start difference. First operand 356 states and 444 transitions. Second operand 91 states. [2019-08-05 11:23:22,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:22,169 INFO L93 Difference]: Finished difference Result 363 states and 453 transitions. [2019-08-05 11:23:22,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:23:22,170 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 355 [2019-08-05 11:23:22,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:22,172 INFO L225 Difference]: With dead ends: 363 [2019-08-05 11:23:22,172 INFO L226 Difference]: Without dead ends: 363 [2019-08-05 11:23:22,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 265 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:23:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-08-05 11:23:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 360. [2019-08-05 11:23:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-08-05 11:23:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 449 transitions. [2019-08-05 11:23:22,177 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 449 transitions. Word has length 355 [2019-08-05 11:23:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:22,177 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 449 transitions. [2019-08-05 11:23:22,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:23:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 449 transitions. [2019-08-05 11:23:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-08-05 11:23:22,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:22,179 INFO L399 BasicCegarLoop]: trace histogram [178, 89, 89, 1, 1, 1] [2019-08-05 11:23:22,179 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:22,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1549154442, now seen corresponding path program 90 times [2019-08-05 11:23:22,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:22,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:23:22,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 39516 backedges. 0 proven. 39249 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-08-05 11:23:25,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:25,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:23:25,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:23:25,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:23:25,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:23:25,017 INFO L87 Difference]: Start difference. First operand 360 states and 449 transitions. Second operand 92 states. [2019-08-05 11:23:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:25,373 INFO L93 Difference]: Finished difference Result 367 states and 458 transitions. [2019-08-05 11:23:25,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:23:25,373 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 359 [2019-08-05 11:23:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:25,374 INFO L225 Difference]: With dead ends: 367 [2019-08-05 11:23:25,374 INFO L226 Difference]: Without dead ends: 367 [2019-08-05 11:23:25,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:23:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-08-05 11:23:25,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 364. [2019-08-05 11:23:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-08-05 11:23:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 454 transitions. [2019-08-05 11:23:25,379 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 454 transitions. Word has length 359 [2019-08-05 11:23:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:25,379 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 454 transitions. [2019-08-05 11:23:25,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:23:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 454 transitions. [2019-08-05 11:23:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-08-05 11:23:25,380 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:25,380 INFO L399 BasicCegarLoop]: trace histogram [180, 90, 90, 1, 1, 1] [2019-08-05 11:23:25,381 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1811698692, now seen corresponding path program 91 times [2019-08-05 11:23:25,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:25,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:23:25,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 40410 backedges. 0 proven. 40140 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-08-05 11:23:28,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:28,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:23:28,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:23:28,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:23:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:23:28,283 INFO L87 Difference]: Start difference. First operand 364 states and 454 transitions. Second operand 93 states. [2019-08-05 11:23:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:28,581 INFO L93 Difference]: Finished difference Result 371 states and 463 transitions. [2019-08-05 11:23:28,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:23:28,582 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 363 [2019-08-05 11:23:28,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:28,584 INFO L225 Difference]: With dead ends: 371 [2019-08-05 11:23:28,584 INFO L226 Difference]: Without dead ends: 371 [2019-08-05 11:23:28,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:23:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-08-05 11:23:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2019-08-05 11:23:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-08-05 11:23:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 459 transitions. [2019-08-05 11:23:28,589 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 459 transitions. Word has length 363 [2019-08-05 11:23:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:28,589 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 459 transitions. [2019-08-05 11:23:28,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:23:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 459 transitions. [2019-08-05 11:23:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-08-05 11:23:28,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:28,590 INFO L399 BasicCegarLoop]: trace histogram [182, 91, 91, 1, 1, 1] [2019-08-05 11:23:28,591 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1143725442, now seen corresponding path program 92 times [2019-08-05 11:23:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:28,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:23:28,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 41314 backedges. 0 proven. 41041 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-08-05 11:23:31,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:31,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:23:31,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:23:31,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:23:31,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:23:31,715 INFO L87 Difference]: Start difference. First operand 368 states and 459 transitions. Second operand 94 states. [2019-08-05 11:23:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:32,013 INFO L93 Difference]: Finished difference Result 375 states and 468 transitions. [2019-08-05 11:23:32,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:23:32,013 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 367 [2019-08-05 11:23:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:32,015 INFO L225 Difference]: With dead ends: 375 [2019-08-05 11:23:32,015 INFO L226 Difference]: Without dead ends: 375 [2019-08-05 11:23:32,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:23:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-08-05 11:23:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2019-08-05 11:23:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-08-05 11:23:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 464 transitions. [2019-08-05 11:23:32,018 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 464 transitions. Word has length 367 [2019-08-05 11:23:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:32,018 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 464 transitions. [2019-08-05 11:23:32,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:23:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 464 transitions. [2019-08-05 11:23:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-08-05 11:23:32,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:32,020 INFO L399 BasicCegarLoop]: trace histogram [184, 92, 92, 1, 1, 1] [2019-08-05 11:23:32,020 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:32,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1513348104, now seen corresponding path program 93 times [2019-08-05 11:23:32,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:32,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:23:32,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 42228 backedges. 911 proven. 3 refuted. 0 times theorem prover too weak. 41314 trivial. 0 not checked. [2019-08-05 11:23:32,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:32,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:23:32,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:23:32,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:23:32,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:23:32,206 INFO L87 Difference]: Start difference. First operand 372 states and 464 transitions. Second operand 5 states. [2019-08-05 11:23:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:32,232 INFO L93 Difference]: Finished difference Result 464 states and 556 transitions. [2019-08-05 11:23:32,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:23:32,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 371 [2019-08-05 11:23:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:32,235 INFO L225 Difference]: With dead ends: 464 [2019-08-05 11:23:32,235 INFO L226 Difference]: Without dead ends: 464 [2019-08-05 11:23:32,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 367 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:23:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-08-05 11:23:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-08-05 11:23:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-08-05 11:23:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 556 transitions. [2019-08-05 11:23:32,239 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 556 transitions. Word has length 371 [2019-08-05 11:23:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:32,239 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 556 transitions. [2019-08-05 11:23:32,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:23:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 556 transitions. [2019-08-05 11:23:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-08-05 11:23:32,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:32,241 INFO L399 BasicCegarLoop]: trace histogram [276, 92, 92, 1, 1, 1] [2019-08-05 11:23:32,241 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:32,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:32,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1279423456, now seen corresponding path program 94 times [2019-08-05 11:23:32,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:32,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:23:32,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 71806 backedges. 0 proven. 71254 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-08-05 11:23:35,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:35,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:23:35,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:23:35,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:23:35,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:23:35,907 INFO L87 Difference]: Start difference. First operand 464 states and 556 transitions. Second operand 95 states. [2019-08-05 11:23:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:37,115 INFO L93 Difference]: Finished difference Result 473 states and 567 transitions. [2019-08-05 11:23:37,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:23:37,116 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 463 [2019-08-05 11:23:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:37,119 INFO L225 Difference]: With dead ends: 473 [2019-08-05 11:23:37,119 INFO L226 Difference]: Without dead ends: 473 [2019-08-05 11:23:37,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:23:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-08-05 11:23:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 469. [2019-08-05 11:23:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-08-05 11:23:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 562 transitions. [2019-08-05 11:23:37,124 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 562 transitions. Word has length 463 [2019-08-05 11:23:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:37,125 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 562 transitions. [2019-08-05 11:23:37,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:23:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 562 transitions. [2019-08-05 11:23:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-08-05 11:23:37,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:37,127 INFO L399 BasicCegarLoop]: trace histogram [279, 93, 93, 1, 1, 1] [2019-08-05 11:23:37,127 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:37,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:37,127 INFO L82 PathProgramCache]: Analyzing trace with hash 423979272, now seen corresponding path program 95 times [2019-08-05 11:23:37,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:37,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:23:37,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 73377 backedges. 1565 proven. 6 refuted. 0 times theorem prover too weak. 71806 trivial. 0 not checked. [2019-08-05 11:23:37,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:37,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:23:37,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:23:37,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:23:37,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:23:37,308 INFO L87 Difference]: Start difference. First operand 469 states and 562 transitions. Second operand 6 states. [2019-08-05 11:23:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:37,403 INFO L93 Difference]: Finished difference Result 562 states and 655 transitions. [2019-08-05 11:23:37,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:23:37,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 468 [2019-08-05 11:23:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:37,405 INFO L225 Difference]: With dead ends: 562 [2019-08-05 11:23:37,405 INFO L226 Difference]: Without dead ends: 562 [2019-08-05 11:23:37,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:23:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-08-05 11:23:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-08-05 11:23:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-08-05 11:23:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 655 transitions. [2019-08-05 11:23:37,411 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 655 transitions. Word has length 468 [2019-08-05 11:23:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:37,411 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 655 transitions. [2019-08-05 11:23:37,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:23:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 655 transitions. [2019-08-05 11:23:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-08-05 11:23:37,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:37,414 INFO L399 BasicCegarLoop]: trace histogram [372, 93, 93, 1, 1, 1] [2019-08-05 11:23:37,414 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:37,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:37,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1978302926, now seen corresponding path program 96 times [2019-08-05 11:23:37,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:37,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:23:37,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 112251 backedges. 0 proven. 111321 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-08-05 11:23:41,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:41,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:23:41,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:23:41,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:23:41,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:23:41,129 INFO L87 Difference]: Start difference. First operand 562 states and 655 transitions. Second operand 96 states. [2019-08-05 11:23:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:41,519 INFO L93 Difference]: Finished difference Result 573 states and 668 transitions. [2019-08-05 11:23:41,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:23:41,525 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 561 [2019-08-05 11:23:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:41,528 INFO L225 Difference]: With dead ends: 573 [2019-08-05 11:23:41,528 INFO L226 Difference]: Without dead ends: 573 [2019-08-05 11:23:41,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:23:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-08-05 11:23:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 568. [2019-08-05 11:23:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-08-05 11:23:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 662 transitions. [2019-08-05 11:23:41,535 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 662 transitions. Word has length 561 [2019-08-05 11:23:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:41,535 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 662 transitions. [2019-08-05 11:23:41,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:23:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 662 transitions. [2019-08-05 11:23:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-08-05 11:23:41,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:41,539 INFO L399 BasicCegarLoop]: trace histogram [376, 94, 94, 1, 1, 1] [2019-08-05 11:23:41,539 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:41,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:41,540 INFO L82 PathProgramCache]: Analyzing trace with hash 974924564, now seen corresponding path program 97 times [2019-08-05 11:23:41,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:41,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:23:41,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 114680 backedges. 2419 proven. 10 refuted. 0 times theorem prover too weak. 112251 trivial. 0 not checked. [2019-08-05 11:23:41,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:41,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:23:41,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:23:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:23:41,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:23:41,808 INFO L87 Difference]: Start difference. First operand 568 states and 662 transitions. Second operand 7 states. [2019-08-05 11:23:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:41,843 INFO L93 Difference]: Finished difference Result 662 states and 756 transitions. [2019-08-05 11:23:41,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:23:41,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 567 [2019-08-05 11:23:41,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:41,845 INFO L225 Difference]: With dead ends: 662 [2019-08-05 11:23:41,845 INFO L226 Difference]: Without dead ends: 662 [2019-08-05 11:23:41,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:23:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-08-05 11:23:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2019-08-05 11:23:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-08-05 11:23:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 756 transitions. [2019-08-05 11:23:41,851 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 756 transitions. Word has length 567 [2019-08-05 11:23:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:41,852 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 756 transitions. [2019-08-05 11:23:41,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:23:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 756 transitions. [2019-08-05 11:23:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-08-05 11:23:41,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:41,856 INFO L399 BasicCegarLoop]: trace histogram [470, 94, 94, 1, 1, 1] [2019-08-05 11:23:41,856 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1792599328, now seen corresponding path program 98 times [2019-08-05 11:23:41,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:42,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 1982 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:23:42,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 163231 backedges. 0 proven. 161821 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2019-08-05 11:23:45,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:45,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:23:45,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:23:45,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:23:45,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:23:45,307 INFO L87 Difference]: Start difference. First operand 662 states and 756 transitions. Second operand 97 states. [2019-08-05 11:23:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:46,240 INFO L93 Difference]: Finished difference Result 675 states and 771 transitions. [2019-08-05 11:23:46,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:23:46,244 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 661 [2019-08-05 11:23:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:46,247 INFO L225 Difference]: With dead ends: 675 [2019-08-05 11:23:46,248 INFO L226 Difference]: Without dead ends: 675 [2019-08-05 11:23:46,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:23:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-08-05 11:23:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 669. [2019-08-05 11:23:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-08-05 11:23:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 764 transitions. [2019-08-05 11:23:46,255 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 764 transitions. Word has length 661 [2019-08-05 11:23:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:46,256 INFO L475 AbstractCegarLoop]: Abstraction has 669 states and 764 transitions. [2019-08-05 11:23:46,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:23:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 764 transitions. [2019-08-05 11:23:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-08-05 11:23:46,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:46,261 INFO L399 BasicCegarLoop]: trace histogram [475, 95, 95, 1, 1, 1] [2019-08-05 11:23:46,261 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:46,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1884468680, now seen corresponding path program 99 times [2019-08-05 11:23:46,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:46,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 2003 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:23:46,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 166725 backedges. 3479 proven. 15 refuted. 0 times theorem prover too weak. 163231 trivial. 0 not checked. [2019-08-05 11:23:46,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:46,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:23:46,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:23:46,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:23:46,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:23:46,837 INFO L87 Difference]: Start difference. First operand 669 states and 764 transitions. Second operand 8 states. [2019-08-05 11:23:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:46,879 INFO L93 Difference]: Finished difference Result 764 states and 859 transitions. [2019-08-05 11:23:46,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:23:46,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 668 [2019-08-05 11:23:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:46,882 INFO L225 Difference]: With dead ends: 764 [2019-08-05 11:23:46,882 INFO L226 Difference]: Without dead ends: 764 [2019-08-05 11:23:46,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:23:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-08-05 11:23:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2019-08-05 11:23:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-08-05 11:23:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 859 transitions. [2019-08-05 11:23:46,890 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 859 transitions. Word has length 668 [2019-08-05 11:23:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:46,890 INFO L475 AbstractCegarLoop]: Abstraction has 764 states and 859 transitions. [2019-08-05 11:23:46,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:23:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 859 transitions. [2019-08-05 11:23:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2019-08-05 11:23:46,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:46,896 INFO L399 BasicCegarLoop]: trace histogram [570, 95, 95, 1, 1, 1] [2019-08-05 11:23:46,896 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1595508198, now seen corresponding path program 100 times [2019-08-05 11:23:46,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:47,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 2288 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:23:47,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 225340 backedges. 0 proven. 223345 refuted. 0 times theorem prover too weak. 1995 trivial. 0 not checked. [2019-08-05 11:23:50,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:50,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:23:50,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:23:50,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:23:50,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:23:50,571 INFO L87 Difference]: Start difference. First operand 764 states and 859 transitions. Second operand 98 states. [2019-08-05 11:23:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:50,951 INFO L93 Difference]: Finished difference Result 779 states and 876 transitions. [2019-08-05 11:23:50,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:23:50,951 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 763 [2019-08-05 11:23:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:50,954 INFO L225 Difference]: With dead ends: 779 [2019-08-05 11:23:50,954 INFO L226 Difference]: Without dead ends: 779 [2019-08-05 11:23:50,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:23:50,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-08-05 11:23:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 772. [2019-08-05 11:23:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-08-05 11:23:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 868 transitions. [2019-08-05 11:23:50,962 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 868 transitions. Word has length 763 [2019-08-05 11:23:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:50,962 INFO L475 AbstractCegarLoop]: Abstraction has 772 states and 868 transitions. [2019-08-05 11:23:50,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:23:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 868 transitions. [2019-08-05 11:23:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2019-08-05 11:23:50,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:50,966 INFO L399 BasicCegarLoop]: trace histogram [576, 96, 96, 1, 1, 1] [2019-08-05 11:23:50,966 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:50,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:50,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1937020960, now seen corresponding path program 101 times [2019-08-05 11:23:50,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:51,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 2312 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:23:51,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 230112 backedges. 4751 proven. 21 refuted. 0 times theorem prover too weak. 225340 trivial. 0 not checked. [2019-08-05 11:23:51,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:51,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:23:51,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:23:51,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:23:51,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:23:51,807 INFO L87 Difference]: Start difference. First operand 772 states and 868 transitions. Second operand 9 states. [2019-08-05 11:23:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:51,982 INFO L93 Difference]: Finished difference Result 868 states and 964 transitions. [2019-08-05 11:23:51,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:23:51,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 771 [2019-08-05 11:23:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:51,984 INFO L225 Difference]: With dead ends: 868 [2019-08-05 11:23:51,984 INFO L226 Difference]: Without dead ends: 868 [2019-08-05 11:23:51,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:23:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-08-05 11:23:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2019-08-05 11:23:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-08-05 11:23:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 964 transitions. [2019-08-05 11:23:51,994 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 964 transitions. Word has length 771 [2019-08-05 11:23:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:51,994 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 964 transitions. [2019-08-05 11:23:51,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:23:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 964 transitions. [2019-08-05 11:23:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2019-08-05 11:23:52,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:52,001 INFO L399 BasicCegarLoop]: trace histogram [672, 96, 96, 1, 1, 1] [2019-08-05 11:23:52,002 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1095113248, now seen corresponding path program 102 times [2019-08-05 11:23:52,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:52,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 2600 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:23:52,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 299184 backedges. 0 proven. 296496 refuted. 0 times theorem prover too weak. 2688 trivial. 0 not checked. [2019-08-05 11:23:56,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:56,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:23:56,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:23:56,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:23:56,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:23:56,079 INFO L87 Difference]: Start difference. First operand 868 states and 964 transitions. Second operand 99 states. [2019-08-05 11:23:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:56,468 INFO L93 Difference]: Finished difference Result 885 states and 983 transitions. [2019-08-05 11:23:56,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:23:56,469 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 867 [2019-08-05 11:23:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:56,471 INFO L225 Difference]: With dead ends: 885 [2019-08-05 11:23:56,471 INFO L226 Difference]: Without dead ends: 885 [2019-08-05 11:23:56,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 769 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:23:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-08-05 11:23:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 877. [2019-08-05 11:23:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-08-05 11:23:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 974 transitions. [2019-08-05 11:23:56,478 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 974 transitions. Word has length 867 [2019-08-05 11:23:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:56,478 INFO L475 AbstractCegarLoop]: Abstraction has 877 states and 974 transitions. [2019-08-05 11:23:56,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:23:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 974 transitions. [2019-08-05 11:23:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2019-08-05 11:23:56,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:56,484 INFO L399 BasicCegarLoop]: trace histogram [679, 97, 97, 1, 1, 1] [2019-08-05 11:23:56,485 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1572859528, now seen corresponding path program 103 times [2019-08-05 11:23:56,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:56,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 2627 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:23:56,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 305453 backedges. 6241 proven. 28 refuted. 0 times theorem prover too weak. 299184 trivial. 0 not checked. [2019-08-05 11:23:57,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:57,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:23:57,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:23:57,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:23:57,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:23:57,168 INFO L87 Difference]: Start difference. First operand 877 states and 974 transitions. Second operand 10 states. [2019-08-05 11:23:57,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:57,230 INFO L93 Difference]: Finished difference Result 974 states and 1071 transitions. [2019-08-05 11:23:57,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:23:57,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 876 [2019-08-05 11:23:57,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:57,232 INFO L225 Difference]: With dead ends: 974 [2019-08-05 11:23:57,233 INFO L226 Difference]: Without dead ends: 974 [2019-08-05 11:23:57,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 867 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:23:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-08-05 11:23:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-08-05 11:23:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-08-05 11:23:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1071 transitions. [2019-08-05 11:23:57,241 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1071 transitions. Word has length 876 [2019-08-05 11:23:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:57,241 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1071 transitions. [2019-08-05 11:23:57,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:23:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1071 transitions. [2019-08-05 11:23:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 974 [2019-08-05 11:23:57,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:57,249 INFO L399 BasicCegarLoop]: trace histogram [776, 97, 97, 1, 1, 1] [2019-08-05 11:23:57,249 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:57,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1644246118, now seen corresponding path program 104 times [2019-08-05 11:23:57,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:57,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 2918 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:23:57,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 385381 backedges. 0 proven. 381889 refuted. 0 times theorem prover too weak. 3492 trivial. 0 not checked. [2019-08-05 11:24:01,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:01,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:24:01,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:24:01,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:24:01,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:24:01,435 INFO L87 Difference]: Start difference. First operand 974 states and 1071 transitions. Second operand 100 states. [2019-08-05 11:24:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:01,781 INFO L93 Difference]: Finished difference Result 993 states and 1092 transitions. [2019-08-05 11:24:01,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:24:01,782 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 973 [2019-08-05 11:24:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:01,784 INFO L225 Difference]: With dead ends: 993 [2019-08-05 11:24:01,785 INFO L226 Difference]: Without dead ends: 993 [2019-08-05 11:24:01,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:24:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-08-05 11:24:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 984. [2019-08-05 11:24:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-08-05 11:24:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1082 transitions. [2019-08-05 11:24:01,791 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1082 transitions. Word has length 973 [2019-08-05 11:24:01,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:01,791 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1082 transitions. [2019-08-05 11:24:01,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:24:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1082 transitions. [2019-08-05 11:24:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2019-08-05 11:24:01,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:01,796 INFO L399 BasicCegarLoop]: trace histogram [784, 98, 98, 1, 1, 1] [2019-08-05 11:24:01,797 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1861243180, now seen corresponding path program 105 times [2019-08-05 11:24:01,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:02,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 2948 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:24:02,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 393372 backedges. 7955 proven. 36 refuted. 0 times theorem prover too weak. 385381 trivial. 0 not checked. [2019-08-05 11:24:02,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:02,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:24:02,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:24:02,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:24:02,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:24:02,633 INFO L87 Difference]: Start difference. First operand 984 states and 1082 transitions. Second operand 11 states. [2019-08-05 11:24:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:02,674 INFO L93 Difference]: Finished difference Result 1082 states and 1180 transitions. [2019-08-05 11:24:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:24:02,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 983 [2019-08-05 11:24:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:02,676 INFO L225 Difference]: With dead ends: 1082 [2019-08-05 11:24:02,676 INFO L226 Difference]: Without dead ends: 1082 [2019-08-05 11:24:02,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 973 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:24:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-08-05 11:24:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1082. [2019-08-05 11:24:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-08-05 11:24:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1180 transitions. [2019-08-05 11:24:02,681 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1180 transitions. Word has length 983 [2019-08-05 11:24:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:02,681 INFO L475 AbstractCegarLoop]: Abstraction has 1082 states and 1180 transitions. [2019-08-05 11:24:02,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:24:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1180 transitions. [2019-08-05 11:24:02,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1082 [2019-08-05 11:24:02,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:02,688 INFO L399 BasicCegarLoop]: trace histogram [882, 98, 98, 1, 1, 1] [2019-08-05 11:24:02,688 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:02,688 INFO L82 PathProgramCache]: Analyzing trace with hash 439153888, now seen corresponding path program 106 times [2019-08-05 11:24:02,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:03,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 3242 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:24:03,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 484561 backedges. 0 proven. 480151 refuted. 0 times theorem prover too weak. 4410 trivial. 0 not checked. [2019-08-05 11:24:07,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:07,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:24:07,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:24:07,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:24:07,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:24:07,408 INFO L87 Difference]: Start difference. First operand 1082 states and 1180 transitions. Second operand 101 states. [2019-08-05 11:24:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:07,773 INFO L93 Difference]: Finished difference Result 1103 states and 1203 transitions. [2019-08-05 11:24:07,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:24:07,773 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 1081 [2019-08-05 11:24:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:07,777 INFO L225 Difference]: With dead ends: 1103 [2019-08-05 11:24:07,777 INFO L226 Difference]: Without dead ends: 1103 [2019-08-05 11:24:07,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1080 GetRequests, 981 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:24:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-08-05 11:24:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1093. [2019-08-05 11:24:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2019-08-05 11:24:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1192 transitions. [2019-08-05 11:24:07,785 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1192 transitions. Word has length 1081 [2019-08-05 11:24:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:07,786 INFO L475 AbstractCegarLoop]: Abstraction has 1093 states and 1192 transitions. [2019-08-05 11:24:07,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:24:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1192 transitions. [2019-08-05 11:24:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1093 [2019-08-05 11:24:07,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:07,795 INFO L399 BasicCegarLoop]: trace histogram [891, 99, 99, 1, 1, 1] [2019-08-05 11:24:07,796 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:07,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1690170184, now seen corresponding path program 107 times [2019-08-05 11:24:07,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:08,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 3275 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:24:08,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 494505 backedges. 9899 proven. 45 refuted. 0 times theorem prover too weak. 484561 trivial. 0 not checked. [2019-08-05 11:24:08,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:08,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:24:08,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:24:08,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:24:08,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:24:08,873 INFO L87 Difference]: Start difference. First operand 1093 states and 1192 transitions. Second operand 12 states. [2019-08-05 11:24:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:08,915 INFO L93 Difference]: Finished difference Result 1192 states and 1291 transitions. [2019-08-05 11:24:08,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:24:08,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1092 [2019-08-05 11:24:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:08,917 INFO L225 Difference]: With dead ends: 1192 [2019-08-05 11:24:08,917 INFO L226 Difference]: Without dead ends: 1192 [2019-08-05 11:24:08,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1091 GetRequests, 1081 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:24:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-08-05 11:24:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-08-05 11:24:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-08-05 11:24:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1291 transitions. [2019-08-05 11:24:08,923 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1291 transitions. Word has length 1092 [2019-08-05 11:24:08,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:08,923 INFO L475 AbstractCegarLoop]: Abstraction has 1192 states and 1291 transitions. [2019-08-05 11:24:08,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:24:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1291 transitions. [2019-08-05 11:24:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1192 [2019-08-05 11:24:08,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:08,934 INFO L399 BasicCegarLoop]: trace histogram [990, 99, 99, 1, 1, 1] [2019-08-05 11:24:08,935 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:08,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:08,935 INFO L82 PathProgramCache]: Analyzing trace with hash -622977358, now seen corresponding path program 108 times [2019-08-05 11:24:08,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:09,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 3572 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:24:09,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 597366 backedges. 0 proven. 591921 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2019-08-05 11:24:13,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:13,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:24:13,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:24:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:24:13,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:24:13,783 INFO L87 Difference]: Start difference. First operand 1192 states and 1291 transitions. Second operand 102 states. [2019-08-05 11:24:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:14,131 INFO L93 Difference]: Finished difference Result 1204 states and 1304 transitions. [2019-08-05 11:24:14,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:24:14,132 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 1191 [2019-08-05 11:24:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:14,135 INFO L225 Difference]: With dead ends: 1204 [2019-08-05 11:24:14,135 INFO L226 Difference]: Without dead ends: 1204 [2019-08-05 11:24:14,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1190 GetRequests, 1090 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:24:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-08-05 11:24:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204. [2019-08-05 11:24:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-08-05 11:24:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1304 transitions. [2019-08-05 11:24:14,143 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1304 transitions. Word has length 1191 [2019-08-05 11:24:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:14,143 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1304 transitions. [2019-08-05 11:24:14,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:24:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1304 transitions. [2019-08-05 11:24:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2019-08-05 11:24:14,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:14,151 INFO L399 BasicCegarLoop]: trace histogram [1000, 100, 100, 1, 1, 1] [2019-08-05 11:24:14,151 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:14,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash 364282936, now seen corresponding path program 109 times [2019-08-05 11:24:14,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:24:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:24:16,109 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:24:16,222 INFO L202 PluginConnector]: Adding new model nestedLoopUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:24:16 BoogieIcfgContainer [2019-08-05 11:24:16,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:24:16,225 INFO L168 Benchmark]: Toolchain (without parser) took 181879.37 ms. Allocated memory was 142.1 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 110.6 MB in the beginning and 696.6 MB in the end (delta: -586.0 MB). Peak memory consumption was 939.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:24:16,225 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory was 111.6 MB in the beginning and 111.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:24:16,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.55 ms. Allocated memory is still 142.1 MB. Free memory was 110.4 MB in the beginning and 108.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:24:16,226 INFO L168 Benchmark]: Boogie Preprocessor took 24.14 ms. Allocated memory is still 142.1 MB. Free memory was 108.4 MB in the beginning and 107.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:24:16,227 INFO L168 Benchmark]: RCFGBuilder took 337.99 ms. Allocated memory is still 142.1 MB. Free memory was 107.3 MB in the beginning and 98.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:24:16,227 INFO L168 Benchmark]: TraceAbstraction took 181478.33 ms. Allocated memory was 142.1 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 97.9 MB in the beginning and 696.6 MB in the end (delta: -598.7 MB). Peak memory consumption was 926.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:24:16,230 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory was 111.6 MB in the beginning and 111.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.55 ms. Allocated memory is still 142.1 MB. Free memory was 110.4 MB in the beginning and 108.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.14 ms. Allocated memory is still 142.1 MB. Free memory was 108.4 MB in the beginning and 107.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 337.99 ms. Allocated memory is still 142.1 MB. Free memory was 107.3 MB in the beginning and 98.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 181478.33 ms. Allocated memory was 142.1 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 97.9 MB in the beginning and 696.6 MB in the end (delta: -598.7 MB). Peak memory consumption was 926.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L6] x := 0; [L7] y := 0; VAL [x=0, y=0] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=0, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=0, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=0, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=0, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=0, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=0, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=0, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=0, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=0, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=0, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=0, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=1, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=1, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=1, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=1, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=1, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=1, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=1, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=1, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=1, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=1, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=1, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=1, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=2, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=2, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=2, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=2, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=2, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=2, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=2, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=2, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=2, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=2, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=2, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=2, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=3, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=3, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=3, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=3, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=3, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=3, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=3, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=3, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=3, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=3, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=3, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=3, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=4, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=4, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=4, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=4, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=4, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=4, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=4, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=4, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=4, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=4, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=4, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=4, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=5, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=5, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=5, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=5, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=5, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=5, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=5, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=5, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=5, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=5, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=5, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=5, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=6, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=6, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=6, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=6, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=6, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=6, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=6, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=6, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=6, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=6, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=6, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=6, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=7, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=7, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=7, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=7, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=7, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=7, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=7, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=7, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=7, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=7, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=7, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=7, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=8, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=8, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=8, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=8, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=8, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=8, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=8, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=8, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=8, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=8, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=8, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=8, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=9, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=9, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=9, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=9, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=9, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=9, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=9, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=9, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=9, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=9, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=9, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=9, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=10, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=10, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=10, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=10, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=10, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=10, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=10, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=10, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=10, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=10, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=10, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=10, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=11, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=11, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=11, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=11, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=11, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=11, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=11, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=11, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=11, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=11, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=11, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=11, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=12, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=12, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=12, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=12, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=12, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=12, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=12, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=12, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=12, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=12, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=12, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=12, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=13, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=13, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=13, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=13, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=13, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=13, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=13, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=13, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=13, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=13, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=13, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=13, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=14, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=14, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=14, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=14, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=14, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=14, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=14, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=14, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=14, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=14, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=14, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=14, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=15, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=15, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=15, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=15, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=15, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=15, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=15, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=15, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=15, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=15, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=15, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=15, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=16, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=16, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=16, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=16, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=16, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=16, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=16, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=16, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=16, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=16, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=16, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=16, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=17, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=17, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=17, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=17, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=17, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=17, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=17, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=17, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=17, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=17, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=17, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=17, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=18, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=18, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=18, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=18, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=18, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=18, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=18, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=18, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=18, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=18, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=18, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=18, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=19, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=19, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=19, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=19, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=19, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=19, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=19, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=19, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=19, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=19, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=19, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=19, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=20, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=20, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=20, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=20, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=20, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=20, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=20, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=20, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=20, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=20, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=20, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=20, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=21, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=21, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=21, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=21, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=21, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=21, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=21, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=21, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=21, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=21, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=21, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=21, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=22, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=22, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=22, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=22, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=22, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=22, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=22, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=22, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=22, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=22, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=22, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=22, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=23, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=23, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=23, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=23, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=23, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=23, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=23, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=23, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=23, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=23, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=23, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=23, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=24, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=24, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=24, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=24, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=24, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=24, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=24, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=24, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=24, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=24, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=24, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=24, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=25, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=25, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=25, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=25, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=25, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=25, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=25, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=25, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=25, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=25, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=25, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=25, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=26, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=26, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=26, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=26, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=26, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=26, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=26, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=26, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=26, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=26, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=26, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=26, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=27, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=27, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=27, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=27, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=27, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=27, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=27, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=27, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=27, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=27, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=27, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=27, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=28, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=28, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=28, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=28, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=28, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=28, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=28, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=28, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=28, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=28, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=28, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=28, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=29, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=29, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=29, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=29, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=29, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=29, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=29, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=29, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=29, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=29, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=29, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=29, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=30, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=30, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=30, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=30, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=30, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=30, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=30, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=30, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=30, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=30, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=30, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=30, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=31, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=31, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=31, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=31, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=31, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=31, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=31, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=31, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=31, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=31, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=31, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=31, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=32, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=32, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=32, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=32, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=32, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=32, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=32, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=32, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=32, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=32, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=32, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=32, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=33, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=33, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=33, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=33, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=33, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=33, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=33, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=33, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=33, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=33, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=33, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=33, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=34, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=34, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=34, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=34, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=34, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=34, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=34, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=34, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=34, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=34, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=34, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=34, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=35, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=35, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=35, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=35, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=35, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=35, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=35, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=35, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=35, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=35, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=35, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=35, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=36, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=36, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=36, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=36, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=36, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=36, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=36, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=36, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=36, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=36, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=36, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=36, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=37, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=37, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=37, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=37, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=37, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=37, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=37, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=37, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=37, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=37, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=37, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=37, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=38, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=38, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=38, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=38, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=38, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=38, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=38, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=38, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=38, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=38, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=38, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=38, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=39, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=39, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=39, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=39, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=39, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=39, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=39, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=39, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=39, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=39, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=39, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=39, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=40, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=40, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=40, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=40, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=40, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=40, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=40, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=40, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=40, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=40, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=40, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=40, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=41, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=41, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=41, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=41, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=41, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=41, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=41, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=41, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=41, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=41, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=41, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=41, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=42, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=42, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=42, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=42, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=42, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=42, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=42, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=42, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=42, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=42, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=42, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=42, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=43, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=43, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=43, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=43, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=43, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=43, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=43, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=43, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=43, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=43, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=43, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=43, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=44, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=44, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=44, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=44, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=44, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=44, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=44, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=44, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=44, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=44, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=44, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=44, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=45, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=45, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=45, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=45, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=45, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=45, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=45, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=45, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=45, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=45, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=45, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=45, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=46, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=46, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=46, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=46, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=46, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=46, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=46, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=46, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=46, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=46, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=46, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=46, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=47, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=47, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=47, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=47, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=47, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=47, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=47, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=47, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=47, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=47, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=47, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=47, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=48, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=48, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=48, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=48, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=48, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=48, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=48, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=48, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=48, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=48, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=48, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=48, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=49, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=49, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=49, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=49, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=49, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=49, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=49, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=49, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=49, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=49, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=49, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=49, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=50, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=50, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=50, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=50, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=50, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=50, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=50, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=50, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=50, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=50, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=50, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=50, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=51, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=51, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=51, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=51, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=51, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=51, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=51, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=51, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=51, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=51, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=51, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=51, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=52, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=52, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=52, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=52, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=52, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=52, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=52, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=52, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=52, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=52, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=52, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=52, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=53, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=53, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=53, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=53, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=53, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=53, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=53, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=53, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=53, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=53, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=53, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=53, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=54, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=54, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=54, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=54, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=54, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=54, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=54, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=54, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=54, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=54, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=54, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=54, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=55, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=55, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=55, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=55, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=55, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=55, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=55, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=55, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=55, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=55, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=55, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=55, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=56, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=56, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=56, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=56, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=56, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=56, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=56, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=56, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=56, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=56, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=56, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=56, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=57, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=57, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=57, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=57, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=57, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=57, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=57, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=57, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=57, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=57, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=57, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=57, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=58, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=58, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=58, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=58, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=58, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=58, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=58, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=58, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=58, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=58, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=58, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=58, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=59, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=59, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=59, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=59, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=59, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=59, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=59, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=59, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=59, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=59, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=59, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=59, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=60, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=60, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=60, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=60, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=60, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=60, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=60, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=60, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=60, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=60, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=60, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=60, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=61, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=61, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=61, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=61, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=61, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=61, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=61, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=61, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=61, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=61, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=61, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=61, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=62, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=62, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=62, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=62, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=62, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=62, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=62, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=62, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=62, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=62, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=62, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=62, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=63, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=63, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=63, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=63, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=63, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=63, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=63, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=63, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=63, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=63, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=63, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=63, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=64, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=64, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=64, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=64, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=64, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=64, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=64, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=64, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=64, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=64, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=64, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=64, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=65, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=65, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=65, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=65, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=65, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=65, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=65, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=65, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=65, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=65, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=65, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=65, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=66, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=66, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=66, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=66, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=66, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=66, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=66, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=66, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=66, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=66, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=66, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=66, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=67, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=67, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=67, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=67, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=67, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=67, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=67, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=67, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=67, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=67, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=67, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=67, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=68, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=68, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=68, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=68, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=68, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=68, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=68, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=68, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=68, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=68, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=68, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=68, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=69, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=69, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=69, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=69, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=69, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=69, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=69, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=69, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=69, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=69, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=69, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=69, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=70, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=70, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=70, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=70, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=70, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=70, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=70, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=70, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=70, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=70, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=70, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=70, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=71, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=71, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=71, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=71, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=71, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=71, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=71, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=71, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=71, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=71, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=71, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=71, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=72, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=72, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=72, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=72, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=72, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=72, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=72, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=72, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=72, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=72, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=72, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=72, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=73, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=73, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=73, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=73, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=73, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=73, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=73, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=73, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=73, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=73, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=73, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=73, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=74, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=74, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=74, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=74, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=74, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=74, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=74, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=74, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=74, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=74, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=74, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=74, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=75, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=75, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=75, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=75, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=75, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=75, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=75, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=75, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=75, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=75, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=75, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=75, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=76, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=76, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=76, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=76, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=76, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=76, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=76, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=76, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=76, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=76, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=76, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=76, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=77, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=77, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=77, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=77, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=77, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=77, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=77, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=77, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=77, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=77, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=77, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=77, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=78, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=78, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=78, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=78, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=78, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=78, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=78, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=78, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=78, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=78, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=78, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=78, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=79, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=79, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=79, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=79, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=79, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=79, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=79, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=79, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=79, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=79, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=79, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=79, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=80, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=80, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=80, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=80, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=80, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=80, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=80, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=80, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=80, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=80, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=80, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=80, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=81, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=81, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=81, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=81, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=81, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=81, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=81, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=81, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=81, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=81, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=81, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=81, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=82, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=82, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=82, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=82, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=82, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=82, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=82, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=82, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=82, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=82, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=82, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=82, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=83, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=83, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=83, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=83, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=83, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=83, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=83, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=83, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=83, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=83, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=83, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=83, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=84, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=84, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=84, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=84, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=84, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=84, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=84, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=84, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=84, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=84, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=84, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=84, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=85, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=85, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=85, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=85, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=85, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=85, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=85, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=85, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=85, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=85, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=85, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=85, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=86, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=86, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=86, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=86, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=86, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=86, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=86, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=86, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=86, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=86, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=86, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=86, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=87, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=87, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=87, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=87, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=87, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=87, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=87, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=87, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=87, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=87, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=87, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=87, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=88, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=88, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=88, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=88, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=88, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=88, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=88, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=88, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=88, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=88, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=88, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=88, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=89, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=89, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=89, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=89, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=89, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=89, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=89, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=89, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=89, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=89, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=89, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=89, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=90, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=90, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=90, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=90, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=90, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=90, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=90, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=90, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=90, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=90, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=90, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=90, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=91, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=91, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=91, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=91, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=91, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=91, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=91, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=91, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=91, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=91, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=91, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=91, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=92, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=92, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=92, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=92, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=92, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=92, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=92, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=92, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=92, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=92, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=92, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=92, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=93, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=93, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=93, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=93, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=93, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=93, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=93, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=93, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=93, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=93, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=93, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=93, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=94, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=94, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=94, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=94, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=94, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=94, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=94, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=94, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=94, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=94, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=94, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=94, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=95, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=95, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=95, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=95, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=95, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=95, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=95, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=95, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=95, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=95, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=95, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=95, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=96, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=96, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=96, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=96, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=96, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=96, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=96, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=96, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=96, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=96, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=96, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=96, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=97, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=97, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=97, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=97, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=97, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=97, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=97, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=97, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=97, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=97, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=97, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=97, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=98, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=98, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=98, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=98, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=98, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=98, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=98, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=98, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=98, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=98, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=98, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=98, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=99, y=10] [L8] COND TRUE x < 100 [L10] y := 0; VAL [x=99, y=0] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=99, y=1] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=99, y=2] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=99, y=3] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=99, y=4] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=99, y=5] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=99, y=6] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=99, y=7] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=99, y=8] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=99, y=9] [L11] COND TRUE y < 10 [L13] y := y + 1; VAL [x=99, y=10] [L11] COND FALSE !(y < 10) [L15] x := x + 1; VAL [x=100, y=10] [L8] COND FALSE !(x < 100) VAL [x=100, y=10] [L17] assert false; VAL [x=100, y=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 181.4s OverallTime, 111 OverallIterations, 1000 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 450 SDtfs, 10100 SDslu, 5779 SDs, 0 SdLazy, 11068 SolverSat, 317 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29277 GetRequests, 24172 SyntacticMatches, 0 SemanticMatches, 5105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 138.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1204occurred in iteration=110, 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.4s AutomataMinimizationTime, 110 MinimizatonAttempts, 323 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 7.4s SatisfiabilityAnalysisTime, 148.6s InterpolantComputationTime, 30590 NumberOfCodeBlocks, 30590 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 29277 ConstructedInterpolants, 0 QuantifiedInterpolants, 34590593 SizeOfPredicates, 110 NumberOfNonLiveVariables, 88051 ConjunctsInSsa, 5215 ConjunctsInUnsatCore, 110 InterpolantComputations, 2 PerfectInterpolantSequences, 1853770/5432119 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...