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/abstractInterpretation/regression/non_con/loop-CountTillBound-2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:13:51,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:13:51,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:13:51,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:13:51,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:13:51,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:13:51,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:13:51,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:13:51,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:13:51,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:13:51,357 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:13:51,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:13:51,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:13:51,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:13:51,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:13:51,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:13:51,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:13:51,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:13:51,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:13:51,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:13:51,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:13:51,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:13:51,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:13:51,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:13:51,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:13:51,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:13:51,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:13:51,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:13:51,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:13:51,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:13:51,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:13:51,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:13:51,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:13:51,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:13:51,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:13:51,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:13:51,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:13:51,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:13:51,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:13:51,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:13:51,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:13:51,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:13:51,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:13:51,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:13:51,453 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:13:51,454 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:13:51,455 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_con/loop-CountTillBound-2.bpl [2019-08-05 11:13:51,456 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_con/loop-CountTillBound-2.bpl' [2019-08-05 11:13:51,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:13:51,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:13:51,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:51,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:13:51,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:13:51,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (1/1) ... [2019-08-05 11:13:51,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (1/1) ... [2019-08-05 11:13:51,525 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:13:51,525 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:13:51,525 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:13:51,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:51,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:13:51,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:13:51,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:13:51,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (1/1) ... [2019-08-05 11:13:51,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (1/1) ... [2019-08-05 11:13:51,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (1/1) ... [2019-08-05 11:13:51,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (1/1) ... [2019-08-05 11:13:51,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (1/1) ... [2019-08-05 11:13:51,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (1/1) ... [2019-08-05 11:13:51,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (1/1) ... [2019-08-05 11:13:51,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:13:51,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:13:51,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:13:51,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:13:51,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (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:13:51,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:13:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:13:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:13:51,857 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:13:51,858 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:13:51,859 INFO L202 PluginConnector]: Adding new model loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:51 BoogieIcfgContainer [2019-08-05 11:13:51,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:13:51,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:13:51,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:13:51,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:13:51,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:51" (1/2) ... [2019-08-05 11:13:51,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d8824f and model type loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:13:51, skipping insertion in model container [2019-08-05 11:13:51,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:51" (2/2) ... [2019-08-05 11:13:51,867 INFO L109 eAbstractionObserver]: Analyzing ICFG loop-CountTillBound-2.bpl [2019-08-05 11:13:51,876 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:13:51,883 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:13:51,898 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:13:51,922 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:13:51,923 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:13:51,924 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:13:51,924 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:13:51,924 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:13:51,924 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:13:51,925 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:13:51,925 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:13:51,925 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:13:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:13:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:13:51,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:51,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:13:51,948 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:51,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:51,953 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 11:13:51,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:52,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:13:52,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:52,075 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:13:52,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:52,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:13:52,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:13:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:13:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:13:52,097 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:13:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:52,176 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 11:13:52,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:13:52,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:13:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:52,189 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:13:52,189 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:13:52,191 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:13:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:13:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:13:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:13:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:13:52,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 11:13:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:52,224 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:13:52,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:13:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:13:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:13:52,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:52,226 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:13:52,226 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-08-05 11:13:52,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:52,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:13:52,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:52,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:52,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:13:52,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:13:52,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:13:52,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:52,346 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 11:13:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:52,470 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 11:13:52,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:13:52,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:13:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:52,472 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:13:52,472 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:13:52,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:13:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:13:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:13:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 11:13:52,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 11:13:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:52,477 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 11:13:52,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:13:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 11:13:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:13:52,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:52,479 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 11:13:52,479 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:52,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:52,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1866691308, now seen corresponding path program 2 times [2019-08-05 11:13:52,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:52,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:13:52,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:52,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:52,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:13:52,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:13:52,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:13:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:13:52,749 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-08-05 11:13:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:52,873 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-08-05 11:13:52,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:13:52,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:13:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:52,874 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:13:52,874 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:13:52,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:13:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:13:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:13:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:13:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 11:13:52,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2019-08-05 11:13:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:52,878 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 11:13:52,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:13:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 11:13:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:13:52,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:52,879 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2019-08-05 11:13:52,880 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:52,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:52,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1406223566, now seen corresponding path program 3 times [2019-08-05 11:13:52,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:52,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:13:52,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:53,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:53,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:13:53,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:13:53,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:13:53,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:13:53,011 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2019-08-05 11:13:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:53,082 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-08-05 11:13:53,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:13:53,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:13:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:53,083 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:13:53,083 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:13:53,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:13:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:13:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:13:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:13:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 11:13:53,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2019-08-05 11:13:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:53,087 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 11:13:53,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:13:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 11:13:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:13:53,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:53,088 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2019-08-05 11:13:53,089 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:53,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:53,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1533610488, now seen corresponding path program 4 times [2019-08-05 11:13:53,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:53,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:13:53,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:53,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:53,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:13:53,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:13:53,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:13:53,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:13:53,375 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2019-08-05 11:13:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:53,432 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-08-05 11:13:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:13:53,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:13:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:53,433 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:13:53,434 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:13:53,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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:13:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:13:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:13:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:13:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-08-05 11:13:53,437 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2019-08-05 11:13:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:53,438 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-08-05 11:13:53,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:13:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-08-05 11:13:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:13:53,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:53,439 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2019-08-05 11:13:53,439 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:53,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:53,439 INFO L82 PathProgramCache]: Analyzing trace with hash 625655614, now seen corresponding path program 5 times [2019-08-05 11:13:53,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:53,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:13:53,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:53,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:53,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:13:53,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:13:53,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:13:53,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:13:53,673 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2019-08-05 11:13:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:53,738 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2019-08-05 11:13:53,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:13:53,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 11:13:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:53,739 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:13:53,739 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:13:53,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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:13:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:13:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:13:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:13:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-08-05 11:13:53,744 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2019-08-05 11:13:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:53,744 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-08-05 11:13:53,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:13:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-08-05 11:13:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:13:53,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:53,746 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2019-08-05 11:13:53,746 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash -40617212, now seen corresponding path program 6 times [2019-08-05 11:13:53,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:53,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:13:53,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:53,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:53,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:13:53,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:13:53,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:13:53,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:13:53,971 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2019-08-05 11:13:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:54,023 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-08-05 11:13:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:13:54,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 11:13:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:54,024 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:13:54,024 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:13:54,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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:13:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:13:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:13:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:13:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-08-05 11:13:54,028 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2019-08-05 11:13:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:54,028 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-08-05 11:13:54,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:13:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2019-08-05 11:13:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:13:54,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:54,029 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2019-08-05 11:13:54,029 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash -378675894, now seen corresponding path program 7 times [2019-08-05 11:13:54,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:54,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:13:54,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:54,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:54,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:13:54,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:13:54,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:13:54,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:13:54,174 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2019-08-05 11:13:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:54,219 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2019-08-05 11:13:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:13:54,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 11:13:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:54,220 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:13:54,221 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:13:54,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:13:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:13:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:13:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:13:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-08-05 11:13:54,225 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2019-08-05 11:13:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:54,225 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-08-05 11:13:54,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:13:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-08-05 11:13:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:13:54,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:54,227 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2019-08-05 11:13:54,227 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:54,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:54,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1164445200, now seen corresponding path program 8 times [2019-08-05 11:13:54,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:54,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:13:54,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:54,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:54,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:13:54,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:13:54,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:13:54,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:13:54,655 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2019-08-05 11:13:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:54,705 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2019-08-05 11:13:54,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:13:54,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 11:13:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:54,707 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:13:54,707 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:13:54,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:13:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:13:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:13:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:13:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-08-05 11:13:54,710 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 19 [2019-08-05 11:13:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:54,710 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-08-05 11:13:54,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:13:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2019-08-05 11:13:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:13:54,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:54,711 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1] [2019-08-05 11:13:54,712 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:54,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1954867882, now seen corresponding path program 9 times [2019-08-05 11:13:54,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:54,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:13:54,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:54,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:54,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:13:54,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:13:54,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:13:54,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:13:54,902 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-08-05 11:13:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:54,947 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2019-08-05 11:13:54,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:13:54,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 11:13:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:54,948 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:13:54,948 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:13:54,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 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:13:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:13:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:13:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:13:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 11:13:54,952 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 21 [2019-08-05 11:13:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:54,953 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 11:13:54,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:13:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 11:13:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:13:54,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:54,954 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1] [2019-08-05 11:13:54,954 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:54,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:54,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1727567076, now seen corresponding path program 10 times [2019-08-05 11:13:54,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:54,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:13:54,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:55,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:55,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:13:55,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:13:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:13:55,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:13:55,125 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 11:13:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:55,385 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. [2019-08-05 11:13:55,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:13:55,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 11:13:55,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:55,386 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:13:55,386 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:13:55,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:13:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:13:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:13:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:13:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 11:13:55,393 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 23 [2019-08-05 11:13:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:55,396 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 11:13:55,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:13:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 11:13:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:13:55,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:55,397 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1] [2019-08-05 11:13:55,400 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:55,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1960142690, now seen corresponding path program 11 times [2019-08-05 11:13:55,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:55,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:13:55,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:55,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:55,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:13:55,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:13:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:13:55,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:13:55,683 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 11:13:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:55,745 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-08-05 11:13:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:13:55,745 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 11:13:55,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:55,746 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:13:55,747 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:13:55,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:13:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:13:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:13:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:13:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 11:13:55,751 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 25 [2019-08-05 11:13:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:55,751 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 11:13:55,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:13:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 11:13:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:13:55,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:55,753 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1] [2019-08-05 11:13:55,753 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1793758680, now seen corresponding path program 12 times [2019-08-05 11:13:55,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:55,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:13:55,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:55,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:55,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:13:55,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:13:55,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:13:55,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:13:55,948 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 11:13:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:56,007 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2019-08-05 11:13:56,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:13:56,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-08-05 11:13:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:56,008 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:13:56,009 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:13:56,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 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:13:56,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:13:56,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:13:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:13:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 11:13:56,013 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 27 [2019-08-05 11:13:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:56,014 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 11:13:56,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:13:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 11:13:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:13:56,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:56,015 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1] [2019-08-05 11:13:56,015 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:56,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:56,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1520446610, now seen corresponding path program 13 times [2019-08-05 11:13:56,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:56,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:13:56,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:56,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:56,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:13:56,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:13:56,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:13:56,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:13:56,279 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 11:13:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:56,314 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2019-08-05 11:13:56,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:13:56,314 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 11:13:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:56,315 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:13:56,315 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:13:56,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 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:13:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:13:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:13:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:13:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 11:13:56,321 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 29 [2019-08-05 11:13:56,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:56,322 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 11:13:56,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:13:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 11:13:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:13:56,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:56,323 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1] [2019-08-05 11:13:56,323 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:56,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:56,323 INFO L82 PathProgramCache]: Analyzing trace with hash -860552396, now seen corresponding path program 14 times [2019-08-05 11:13:56,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:56,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:13:56,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:56,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:56,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:13:56,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:13:56,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:13:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:13:56,703 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 11:13:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:56,740 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2019-08-05 11:13:56,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:13:56,741 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-08-05 11:13:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:56,742 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:13:56,742 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:13:56,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:13:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:13:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:13:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:13:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 11:13:56,747 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 31 [2019-08-05 11:13:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:56,747 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 11:13:56,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:13:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 11:13:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:13:56,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:56,748 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1] [2019-08-05 11:13:56,749 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:56,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1937594746, now seen corresponding path program 15 times [2019-08-05 11:13:56,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:56,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:13:56,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:57,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:57,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:13:57,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:13:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:13:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:13:57,266 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 11:13:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:57,321 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-08-05 11:13:57,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:13:57,322 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 11:13:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:57,323 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:13:57,323 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:13:57,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:13:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:13:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:13:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:13:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 11:13:57,328 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 33 [2019-08-05 11:13:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:57,328 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 11:13:57,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:13:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 11:13:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:13:57,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:57,329 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1] [2019-08-05 11:13:57,330 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1987496384, now seen corresponding path program 16 times [2019-08-05 11:13:57,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:57,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:13:57,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:57,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:57,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:13:57,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:13:57,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:13:57,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:13:57,513 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 11:13:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:57,576 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2019-08-05 11:13:57,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:13:57,576 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-08-05 11:13:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:57,576 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:13:57,576 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:13:57,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:13:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:13:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:13:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:13:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 11:13:57,581 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 35 [2019-08-05 11:13:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:57,581 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 11:13:57,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:13:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 11:13:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:13:57,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:57,582 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1] [2019-08-05 11:13:57,583 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:57,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:57,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1276180870, now seen corresponding path program 17 times [2019-08-05 11:13:57,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:57,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:13:57,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:58,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:58,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:13:58,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:13:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:13:58,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:13:58,128 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 11:13:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:58,219 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-08-05 11:13:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:13:58,219 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 11:13:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:58,220 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:13:58,220 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:13:58,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:13:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:13:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:13:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:13:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 11:13:58,227 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 37 [2019-08-05 11:13:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:58,228 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 11:13:58,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:13:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 11:13:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:13:58,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:58,232 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1] [2019-08-05 11:13:58,232 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:58,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:58,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1951071412, now seen corresponding path program 18 times [2019-08-05 11:13:58,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:58,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:58,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:58,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:58,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:13:58,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:58,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:58,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:58,744 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 11:13:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:58,801 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2019-08-05 11:13:58,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:58,801 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-08-05 11:13:58,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:58,802 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:13:58,802 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:13:58,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 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:13:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:13:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:13:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:13:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 11:13:58,807 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 39 [2019-08-05 11:13:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:58,807 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 11:13:58,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 11:13:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:13:58,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:58,808 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1] [2019-08-05 11:13:58,809 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1920840594, now seen corresponding path program 19 times [2019-08-05 11:13:58,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:58,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:58,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:59,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:59,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:13:59,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:13:59,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:59,129 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 11:13:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,175 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2019-08-05 11:13:59,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:13:59,175 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 11:13:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,176 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:13:59,176 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:13:59,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:13:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:13:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:13:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 11:13:59,181 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 41 [2019-08-05 11:13:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,182 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 11:13:59,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:13:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 11:13:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:13:59,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,183 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1] [2019-08-05 11:13:59,183 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash -908367272, now seen corresponding path program 20 times [2019-08-05 11:13:59,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:59,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:13:59,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:59,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:59,489 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 11:13:59,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,522 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2019-08-05 11:13:59,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:59,523 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-08-05 11:13:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,524 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:13:59,524 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:13:59,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:13:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:13:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:13:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 11:13:59,528 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 43 [2019-08-05 11:13:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,529 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 11:13:59,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 11:13:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:13:59,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,530 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1] [2019-08-05 11:13:59,530 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1062828130, now seen corresponding path program 21 times [2019-08-05 11:13:59,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:59,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:59,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:13:59,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:13:59,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:13:59,837 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 11:13:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,917 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2019-08-05 11:13:59,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:13:59,919 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 11:13:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,920 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:13:59,920 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:13:59,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:13:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:13:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:13:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:13:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 11:13:59,923 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 45 [2019-08-05 11:13:59,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,924 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 11:13:59,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:13:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 11:13:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:13:59,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,924 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1] [2019-08-05 11:13:59,925 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,925 INFO L82 PathProgramCache]: Analyzing trace with hash 824142692, now seen corresponding path program 22 times [2019-08-05 11:13:59,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:00,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:14:00,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:00,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:00,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:00,249 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 11:14:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,288 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2019-08-05 11:14:00,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:00,289 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-08-05 11:14:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,289 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:14:00,290 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:14:00,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:14:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:14:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:14:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 11:14:00,295 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 47 [2019-08-05 11:14:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,295 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 11:14:00,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 11:14:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:14:00,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,296 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1] [2019-08-05 11:14:00,297 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1726903722, now seen corresponding path program 23 times [2019-08-05 11:14:00,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:00,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:14:00,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:14:00,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:14:00,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:00,736 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 11:14:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,774 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2019-08-05 11:14:00,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:14:00,775 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 11:14:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,776 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:14:00,776 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:14:00,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:14:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:14:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:14:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:14:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 11:14:00,781 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 49 [2019-08-05 11:14:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,781 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 11:14:00,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:14:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 11:14:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:14:00,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,782 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1] [2019-08-05 11:14:00,782 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1696859760, now seen corresponding path program 24 times [2019-08-05 11:14:00,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:01,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:14:01,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:14:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:14:01,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:01,549 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 11:14:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,613 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-08-05 11:14:01,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:14:01,614 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-08-05 11:14:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,615 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:14:01,615 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:14:01,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:14:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:14:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:14:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:14:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2019-08-05 11:14:01,619 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 51 [2019-08-05 11:14:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,619 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2019-08-05 11:14:01,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:14:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2019-08-05 11:14:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:14:01,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,620 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1] [2019-08-05 11:14:01,620 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1405583946, now seen corresponding path program 25 times [2019-08-05 11:14:01,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:02,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:02,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:14:02,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:14:02,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:14:02,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:14:02,171 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand 28 states. [2019-08-05 11:14:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,227 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2019-08-05 11:14:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:14:02,227 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 11:14:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,228 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:14:02,229 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:14:02,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:14:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:14:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:14:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:14:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2019-08-05 11:14:02,232 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 53 [2019-08-05 11:14:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,232 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2019-08-05 11:14:02,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:14:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2019-08-05 11:14:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:14:02,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,233 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1] [2019-08-05 11:14:02,234 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2146681988, now seen corresponding path program 26 times [2019-08-05 11:14:02,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:03,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:03,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:14:03,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:14:03,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:14:03,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:14:03,144 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand 29 states. [2019-08-05 11:14:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:03,193 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2019-08-05 11:14:03,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:14:03,193 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 11:14:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:03,194 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:14:03,194 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:14:03,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:14:03,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:14:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:14:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:14:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2019-08-05 11:14:03,198 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 55 [2019-08-05 11:14:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:03,198 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2019-08-05 11:14:03,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:14:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2019-08-05 11:14:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:14:03,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:03,199 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1] [2019-08-05 11:14:03,199 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1377329214, now seen corresponding path program 27 times [2019-08-05 11:14:03,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:03,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:03,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:03,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:03,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:14:03,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:14:03,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:14:03,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:14:03,746 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand 30 states. [2019-08-05 11:14:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:03,786 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2019-08-05 11:14:03,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:14:03,787 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 11:14:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:03,788 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:14:03,788 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:14:03,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 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:14:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:14:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:14:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:14:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2019-08-05 11:14:03,792 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 57 [2019-08-05 11:14:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:03,792 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2019-08-05 11:14:03,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:14:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2019-08-05 11:14:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:14:03,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:03,793 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1] [2019-08-05 11:14:03,793 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash -763688312, now seen corresponding path program 28 times [2019-08-05 11:14:03,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:03,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:14:03,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:04,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:04,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:14:04,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:14:04,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:14:04,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:14:04,170 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand 31 states. [2019-08-05 11:14:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,222 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2019-08-05 11:14:04,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:14:04,223 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-08-05 11:14:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,224 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:14:04,224 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:14:04,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:14:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:14:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:14:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:14:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2019-08-05 11:14:04,228 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 59 [2019-08-05 11:14:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,228 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2019-08-05 11:14:04,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:14:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2019-08-05 11:14:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:14:04,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,229 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1] [2019-08-05 11:14:04,229 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,230 INFO L82 PathProgramCache]: Analyzing trace with hash 534698958, now seen corresponding path program 29 times [2019-08-05 11:14:04,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:04,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:04,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:14:04,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:14:04,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:14:04,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:14:04,665 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 32 states. [2019-08-05 11:14:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,764 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2019-08-05 11:14:04,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:14:04,764 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 11:14:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,765 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:14:04,767 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:14:04,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 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:14:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:14:04,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:14:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:14:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2019-08-05 11:14:04,771 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 61 [2019-08-05 11:14:04,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,771 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2019-08-05 11:14:04,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:14:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2019-08-05 11:14:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:14:04,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,772 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1] [2019-08-05 11:14:04,773 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1550617708, now seen corresponding path program 30 times [2019-08-05 11:14:04,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:05,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:14:05,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:14:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:14:05,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:14:05,176 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 33 states. [2019-08-05 11:14:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:05,349 INFO L93 Difference]: Finished difference Result 66 states and 97 transitions. [2019-08-05 11:14:05,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:14:05,350 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-08-05 11:14:05,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:05,351 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:14:05,351 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:14:05,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:14:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:14:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:14:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:14:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2019-08-05 11:14:05,354 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 63 [2019-08-05 11:14:05,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:05,355 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2019-08-05 11:14:05,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:14:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2019-08-05 11:14:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:14:05,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:05,355 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1] [2019-08-05 11:14:05,356 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash 209793498, now seen corresponding path program 31 times [2019-08-05 11:14:05,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:05,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:14:05,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:05,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:14:05,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:14:05,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:14:05,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:14:05,829 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 34 states. [2019-08-05 11:14:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:05,884 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2019-08-05 11:14:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:14:05,884 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 11:14:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:05,885 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:14:05,886 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:14:05,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 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:14:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:14:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:14:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:14:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2019-08-05 11:14:05,889 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 65 [2019-08-05 11:14:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:05,890 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2019-08-05 11:14:05,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:14:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2019-08-05 11:14:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:14:05,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:05,890 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1] [2019-08-05 11:14:05,891 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:05,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash -252152160, now seen corresponding path program 32 times [2019-08-05 11:14:05,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:05,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:14:05,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:07,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:07,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:14:07,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:14:07,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:14:07,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:07,444 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 35 states. [2019-08-05 11:14:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:07,510 INFO L93 Difference]: Finished difference Result 70 states and 103 transitions. [2019-08-05 11:14:07,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:14:07,511 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-08-05 11:14:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:07,511 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:14:07,511 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:14:07,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:14:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:14:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:14:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:14:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2019-08-05 11:14:07,514 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 67 [2019-08-05 11:14:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:07,514 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 103 transitions. [2019-08-05 11:14:07,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:14:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2019-08-05 11:14:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:14:07,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:07,515 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1] [2019-08-05 11:14:07,515 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1800298010, now seen corresponding path program 33 times [2019-08-05 11:14:07,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:07,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:14:07,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:08,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:08,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:14:08,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:14:08,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:14:08,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:14:08,212 INFO L87 Difference]: Start difference. First operand 70 states and 103 transitions. Second operand 36 states. [2019-08-05 11:14:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:08,271 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2019-08-05 11:14:08,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:14:08,278 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 11:14:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:08,279 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:14:08,279 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:14:08,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 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:14:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:14:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:14:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:14:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 106 transitions. [2019-08-05 11:14:08,282 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 106 transitions. Word has length 69 [2019-08-05 11:14:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:08,282 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 106 transitions. [2019-08-05 11:14:08,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:14:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 106 transitions. [2019-08-05 11:14:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:14:08,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:08,283 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1] [2019-08-05 11:14:08,283 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:08,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:08,283 INFO L82 PathProgramCache]: Analyzing trace with hash 785191852, now seen corresponding path program 34 times [2019-08-05 11:14:08,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:08,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:14:08,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:08,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:08,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:14:08,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:14:08,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:14:08,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:14:08,915 INFO L87 Difference]: Start difference. First operand 72 states and 106 transitions. Second operand 37 states. [2019-08-05 11:14:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:08,986 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2019-08-05 11:14:08,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:14:08,986 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-08-05 11:14:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:08,987 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:14:08,987 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:14:08,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:14:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:14:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:14:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:14:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-08-05 11:14:08,991 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 71 [2019-08-05 11:14:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:08,991 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-08-05 11:14:08,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:14:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2019-08-05 11:14:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:14:08,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:08,992 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1] [2019-08-05 11:14:08,992 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:08,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:08,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1345115150, now seen corresponding path program 35 times [2019-08-05 11:14:08,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:09,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:09,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:14:09,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:14:09,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:14:09,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:09,505 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 38 states. [2019-08-05 11:14:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:09,584 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2019-08-05 11:14:09,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:14:09,585 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 11:14:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:09,586 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:14:09,586 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:14:09,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:14:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:14:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:14:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:14:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2019-08-05 11:14:09,590 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 73 [2019-08-05 11:14:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:09,590 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2019-08-05 11:14:09,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:14:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2019-08-05 11:14:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:14:09,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:09,591 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1] [2019-08-05 11:14:09,591 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash 129256120, now seen corresponding path program 36 times [2019-08-05 11:14:09,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:10,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:10,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:14:10,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:14:10,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:14:10,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:10,451 INFO L87 Difference]: Start difference. First operand 76 states and 112 transitions. Second operand 39 states. [2019-08-05 11:14:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:10,519 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2019-08-05 11:14:10,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:14:10,520 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-08-05 11:14:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:10,521 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:14:10,521 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:14:10,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:14:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:14:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:14:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:14:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 115 transitions. [2019-08-05 11:14:10,524 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 115 transitions. Word has length 75 [2019-08-05 11:14:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:10,524 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 115 transitions. [2019-08-05 11:14:10,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:14:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2019-08-05 11:14:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:14:10,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:10,525 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1] [2019-08-05 11:14:10,525 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash -339161090, now seen corresponding path program 37 times [2019-08-05 11:14:10,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:10,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:14:10,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:11,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:11,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:14:11,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:14:11,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:14:11,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:14:11,297 INFO L87 Difference]: Start difference. First operand 78 states and 115 transitions. Second operand 40 states. [2019-08-05 11:14:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:11,362 INFO L93 Difference]: Finished difference Result 80 states and 118 transitions. [2019-08-05 11:14:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:14:11,362 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 11:14:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:11,363 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:14:11,364 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:14:11,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 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:14:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:14:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:14:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:14:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2019-08-05 11:14:11,367 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 77 [2019-08-05 11:14:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:11,368 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2019-08-05 11:14:11,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:14:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2019-08-05 11:14:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:14:11,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:11,368 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1] [2019-08-05 11:14:11,369 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash 483466180, now seen corresponding path program 38 times [2019-08-05 11:14:11,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:11,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:14:11,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:12,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:12,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:14:12,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:14:12,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:14:12,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:14:12,004 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand 41 states. [2019-08-05 11:14:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:12,066 INFO L93 Difference]: Finished difference Result 82 states and 121 transitions. [2019-08-05 11:14:12,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:14:12,066 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-08-05 11:14:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:12,067 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:14:12,068 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:14:12,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 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:14:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:14:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:14:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:14:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 121 transitions. [2019-08-05 11:14:12,071 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 121 transitions. Word has length 79 [2019-08-05 11:14:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:12,071 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 121 transitions. [2019-08-05 11:14:12,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:14:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 121 transitions. [2019-08-05 11:14:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:14:12,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:12,072 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1] [2019-08-05 11:14:12,072 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:12,072 INFO L82 PathProgramCache]: Analyzing trace with hash 754290186, now seen corresponding path program 39 times [2019-08-05 11:14:12,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:12,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:14:12,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:13,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:13,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:14:13,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:14:13,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:14:13,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:13,157 INFO L87 Difference]: Start difference. First operand 82 states and 121 transitions. Second operand 42 states. [2019-08-05 11:14:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:13,217 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-08-05 11:14:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:14:13,218 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 11:14:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:13,219 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:14:13,219 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:14:13,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:14:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:14:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:14:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:14:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2019-08-05 11:14:13,223 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 81 [2019-08-05 11:14:13,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:13,223 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2019-08-05 11:14:13,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:14:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2019-08-05 11:14:13,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:14:13,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:13,224 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1] [2019-08-05 11:14:13,224 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:13,224 INFO L82 PathProgramCache]: Analyzing trace with hash -976845104, now seen corresponding path program 40 times [2019-08-05 11:14:13,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:13,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:14:13,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:13,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:13,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:14:13,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:14:13,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:14:13,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:13,918 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand 43 states. [2019-08-05 11:14:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:13,987 INFO L93 Difference]: Finished difference Result 86 states and 127 transitions. [2019-08-05 11:14:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:14:13,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-08-05 11:14:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:13,989 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:14:13,989 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:14:13,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:14:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:14:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:14:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:14:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions. [2019-08-05 11:14:13,992 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 127 transitions. Word has length 83 [2019-08-05 11:14:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:13,993 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 127 transitions. [2019-08-05 11:14:13,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:14:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 127 transitions. [2019-08-05 11:14:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:14:13,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:13,994 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1] [2019-08-05 11:14:13,994 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:13,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:13,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1849452054, now seen corresponding path program 41 times [2019-08-05 11:14:13,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:14,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:14:14,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:14,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:14,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:14:14,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:14:14,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:14:14,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:14,960 INFO L87 Difference]: Start difference. First operand 86 states and 127 transitions. Second operand 44 states. [2019-08-05 11:14:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,116 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2019-08-05 11:14:15,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:14:15,117 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 11:14:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,118 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:14:15,118 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:14:15,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:14:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:14:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:14:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:14:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2019-08-05 11:14:15,121 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 85 [2019-08-05 11:14:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,122 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2019-08-05 11:14:15,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:14:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2019-08-05 11:14:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:14:15,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,122 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1] [2019-08-05 11:14:15,123 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash -793277476, now seen corresponding path program 42 times [2019-08-05 11:14:15,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:15,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:15,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:14:15,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:14:15,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:14:15,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:14:15,839 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand 45 states. [2019-08-05 11:14:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,906 INFO L93 Difference]: Finished difference Result 90 states and 133 transitions. [2019-08-05 11:14:15,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:14:15,907 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-08-05 11:14:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,908 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:14:15,908 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:14:15,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:14:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:14:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:14:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:14:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 133 transitions. [2019-08-05 11:14:15,911 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 133 transitions. Word has length 87 [2019-08-05 11:14:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,912 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 133 transitions. [2019-08-05 11:14:15,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:14:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 133 transitions. [2019-08-05 11:14:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:14:15,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,912 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1] [2019-08-05 11:14:15,913 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2130683870, now seen corresponding path program 43 times [2019-08-05 11:14:15,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:16,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:16,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:14:16,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:14:16,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:14:16,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:14:16,682 INFO L87 Difference]: Start difference. First operand 90 states and 133 transitions. Second operand 46 states. [2019-08-05 11:14:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:16,745 INFO L93 Difference]: Finished difference Result 92 states and 136 transitions. [2019-08-05 11:14:16,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:14:16,745 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 11:14:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:16,746 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:14:16,746 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:14:16,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 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:14:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:14:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:14:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:14:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2019-08-05 11:14:16,750 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 89 [2019-08-05 11:14:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:16,750 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2019-08-05 11:14:16,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:14:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2019-08-05 11:14:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:14:16,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:16,751 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1] [2019-08-05 11:14:16,751 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:16,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:16,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1111960296, now seen corresponding path program 44 times [2019-08-05 11:14:16,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:16,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:14:16,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:17,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:17,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:14:17,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:14:17,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:14:17,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:14:17,904 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand 47 states. [2019-08-05 11:14:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:18,121 INFO L93 Difference]: Finished difference Result 94 states and 139 transitions. [2019-08-05 11:14:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:14:18,121 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-08-05 11:14:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:18,122 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:14:18,122 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:14:18,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 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:14:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:14:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:14:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:14:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2019-08-05 11:14:18,125 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 91 [2019-08-05 11:14:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:18,125 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2019-08-05 11:14:18,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:14:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2019-08-05 11:14:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:14:18,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:18,126 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1] [2019-08-05 11:14:18,127 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:18,127 INFO L82 PathProgramCache]: Analyzing trace with hash -853253074, now seen corresponding path program 45 times [2019-08-05 11:14:18,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:18,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:14:18,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:19,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:19,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:14:19,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:14:19,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:14:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:14:19,212 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand 48 states. [2019-08-05 11:14:19,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:19,323 INFO L93 Difference]: Finished difference Result 96 states and 142 transitions. [2019-08-05 11:14:19,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:14:19,323 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 11:14:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:19,324 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:14:19,324 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:14:19,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 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:14:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:14:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:14:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:14:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 142 transitions. [2019-08-05 11:14:19,328 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 142 transitions. Word has length 93 [2019-08-05 11:14:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:19,328 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 142 transitions. [2019-08-05 11:14:19,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:14:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2019-08-05 11:14:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:14:19,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:19,329 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1] [2019-08-05 11:14:19,330 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:19,330 INFO L82 PathProgramCache]: Analyzing trace with hash 362308596, now seen corresponding path program 46 times [2019-08-05 11:14:19,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:19,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:14:19,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:20,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:20,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:14:20,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:14:20,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:14:20,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:14:20,225 INFO L87 Difference]: Start difference. First operand 96 states and 142 transitions. Second operand 49 states. [2019-08-05 11:14:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:20,525 INFO L93 Difference]: Finished difference Result 98 states and 145 transitions. [2019-08-05 11:14:20,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:14:20,526 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-08-05 11:14:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:20,527 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:14:20,527 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:14:20,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:14:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:14:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:14:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:14:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2019-08-05 11:14:20,530 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 95 [2019-08-05 11:14:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:20,530 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2019-08-05 11:14:20,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:14:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2019-08-05 11:14:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:14:20,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:20,531 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1] [2019-08-05 11:14:20,531 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash 285968954, now seen corresponding path program 47 times [2019-08-05 11:14:20,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:20,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:14:20,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:21,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:21,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:14:21,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:14:21,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:14:21,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:14:21,575 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand 50 states. [2019-08-05 11:14:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:21,648 INFO L93 Difference]: Finished difference Result 100 states and 148 transitions. [2019-08-05 11:14:21,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:14:21,648 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 11:14:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:21,649 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:14:21,649 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:14:21,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:14:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:14:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:14:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:14:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2019-08-05 11:14:21,653 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 97 [2019-08-05 11:14:21,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:21,653 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2019-08-05 11:14:21,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:14:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2019-08-05 11:14:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:14:21,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:21,654 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1] [2019-08-05 11:14:21,654 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:21,655 INFO L82 PathProgramCache]: Analyzing trace with hash -61982976, now seen corresponding path program 48 times [2019-08-05 11:14:21,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:21,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:14:21,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:22,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:22,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:14:22,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:14:22,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:14:22,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:14:22,963 INFO L87 Difference]: Start difference. First operand 100 states and 148 transitions. Second operand 51 states. [2019-08-05 11:14:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:23,040 INFO L93 Difference]: Finished difference Result 102 states and 151 transitions. [2019-08-05 11:14:23,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:14:23,041 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-08-05 11:14:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:23,042 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:14:23,042 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:14:23,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 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:14:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:14:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 11:14:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:14:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2019-08-05 11:14:23,046 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 99 [2019-08-05 11:14:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:23,047 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2019-08-05 11:14:23,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:14:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2019-08-05 11:14:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:14:23,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:23,048 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1] [2019-08-05 11:14:23,048 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:23,048 INFO L82 PathProgramCache]: Analyzing trace with hash 563661382, now seen corresponding path program 49 times [2019-08-05 11:14:23,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:23,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:14:23,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:23,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:23,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:14:23,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:14:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:14:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:14:23,998 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand 52 states. [2019-08-05 11:14:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:24,159 INFO L93 Difference]: Finished difference Result 104 states and 154 transitions. [2019-08-05 11:14:24,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:14:24,159 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 11:14:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:24,161 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:14:24,161 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:14:24,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:14:24,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:14:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 11:14:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:14:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-08-05 11:14:24,165 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 101 [2019-08-05 11:14:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:24,165 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-08-05 11:14:24,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:14:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-08-05 11:14:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:14:24,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:24,166 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1] [2019-08-05 11:14:24,166 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:24,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:24,166 INFO L82 PathProgramCache]: Analyzing trace with hash 512467980, now seen corresponding path program 50 times [2019-08-05 11:14:24,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:24,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:14:24,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:25,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:25,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:14:25,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:14:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:14:25,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:14:25,240 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 53 states. [2019-08-05 11:14:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:25,337 INFO L93 Difference]: Finished difference Result 106 states and 157 transitions. [2019-08-05 11:14:25,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:14:25,338 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-08-05 11:14:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:25,339 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:14:25,340 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:14:25,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:14:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:14:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:14:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:14:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2019-08-05 11:14:25,342 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 103 [2019-08-05 11:14:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:25,343 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2019-08-05 11:14:25,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:14:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2019-08-05 11:14:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:14:25,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:25,344 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1] [2019-08-05 11:14:25,344 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:25,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1439751086, now seen corresponding path program 51 times [2019-08-05 11:14:25,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:25,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:14:25,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:26,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:26,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:14:26,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:14:26,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:14:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:14:26,927 INFO L87 Difference]: Start difference. First operand 106 states and 157 transitions. Second operand 54 states. [2019-08-05 11:14:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:27,026 INFO L93 Difference]: Finished difference Result 108 states and 160 transitions. [2019-08-05 11:14:27,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:14:27,026 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 11:14:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:27,028 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:14:27,028 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:14:27,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:14:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:14:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 11:14:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:14:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2019-08-05 11:14:27,032 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 105 [2019-08-05 11:14:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:27,032 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2019-08-05 11:14:27,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:14:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2019-08-05 11:14:27,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:14:27,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:27,033 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1] [2019-08-05 11:14:27,033 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:27,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:27,034 INFO L82 PathProgramCache]: Analyzing trace with hash -621565160, now seen corresponding path program 52 times [2019-08-05 11:14:27,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:27,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:14:27,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:28,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:28,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:14:28,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:14:28,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:14:28,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:14:28,485 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand 55 states. [2019-08-05 11:14:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:28,579 INFO L93 Difference]: Finished difference Result 110 states and 163 transitions. [2019-08-05 11:14:28,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:14:28,579 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-08-05 11:14:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:28,580 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:14:28,581 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:14:28,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:14:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:14:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:14:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:14:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 163 transitions. [2019-08-05 11:14:28,585 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 163 transitions. Word has length 107 [2019-08-05 11:14:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:28,585 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 163 transitions. [2019-08-05 11:14:28,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:14:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 163 transitions. [2019-08-05 11:14:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:14:28,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:28,586 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1] [2019-08-05 11:14:28,586 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash -323905442, now seen corresponding path program 53 times [2019-08-05 11:14:28,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:28,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:14:28,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:29,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:29,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:14:29,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:14:29,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:14:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:14:29,827 INFO L87 Difference]: Start difference. First operand 110 states and 163 transitions. Second operand 56 states. [2019-08-05 11:14:29,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:29,945 INFO L93 Difference]: Finished difference Result 112 states and 166 transitions. [2019-08-05 11:14:29,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:14:29,945 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2019-08-05 11:14:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:29,946 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:14:29,947 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:14:29,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:14:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:14:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:14:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:14:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 166 transitions. [2019-08-05 11:14:29,951 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 166 transitions. Word has length 109 [2019-08-05 11:14:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:29,951 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 166 transitions. [2019-08-05 11:14:29,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:14:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 166 transitions. [2019-08-05 11:14:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:14:29,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:29,952 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1] [2019-08-05 11:14:29,953 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:29,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2035725276, now seen corresponding path program 54 times [2019-08-05 11:14:29,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:29,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:14:29,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:31,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:31,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:14:31,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:14:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:14:31,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:14:31,132 INFO L87 Difference]: Start difference. First operand 112 states and 166 transitions. Second operand 57 states. [2019-08-05 11:14:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:31,278 INFO L93 Difference]: Finished difference Result 114 states and 169 transitions. [2019-08-05 11:14:31,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:14:31,279 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-08-05 11:14:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:31,280 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:14:31,280 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:14:31,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 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:14:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:14:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:14:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:14:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2019-08-05 11:14:31,284 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 111 [2019-08-05 11:14:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:31,284 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2019-08-05 11:14:31,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:14:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2019-08-05 11:14:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:14:31,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:31,285 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1] [2019-08-05 11:14:31,285 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2122111382, now seen corresponding path program 55 times [2019-08-05 11:14:31,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:31,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:14:31,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:32,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:32,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:14:32,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:14:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:14:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:14:32,404 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand 58 states. [2019-08-05 11:14:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:32,761 INFO L93 Difference]: Finished difference Result 116 states and 172 transitions. [2019-08-05 11:14:32,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:14:32,762 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2019-08-05 11:14:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:32,762 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:14:32,762 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:14:32,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:14:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:14:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 11:14:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:14:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2019-08-05 11:14:32,769 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 113 [2019-08-05 11:14:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:32,769 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-08-05 11:14:32,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:14:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2019-08-05 11:14:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:14:32,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:32,770 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1] [2019-08-05 11:14:32,770 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:32,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:32,770 INFO L82 PathProgramCache]: Analyzing trace with hash 760186672, now seen corresponding path program 56 times [2019-08-05 11:14:32,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:32,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:14:32,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:33,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:33,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:14:33,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:14:33,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:14:33,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:14:33,942 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand 59 states. [2019-08-05 11:14:34,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,049 INFO L93 Difference]: Finished difference Result 118 states and 175 transitions. [2019-08-05 11:14:34,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:14:34,049 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2019-08-05 11:14:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,050 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:14:34,051 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:14:34,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:14:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:14:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 11:14:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:14:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 175 transitions. [2019-08-05 11:14:34,054 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 175 transitions. Word has length 115 [2019-08-05 11:14:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,054 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 175 transitions. [2019-08-05 11:14:34,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:14:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 175 transitions. [2019-08-05 11:14:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:14:34,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,055 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1] [2019-08-05 11:14:34,055 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash 394710646, now seen corresponding path program 57 times [2019-08-05 11:14:34,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:35,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:35,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:14:35,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:14:35,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:14:35,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:14:35,351 INFO L87 Difference]: Start difference. First operand 118 states and 175 transitions. Second operand 60 states. [2019-08-05 11:14:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,537 INFO L93 Difference]: Finished difference Result 120 states and 178 transitions. [2019-08-05 11:14:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:14:35,537 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2019-08-05 11:14:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,538 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:14:35,539 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:14:35,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:14:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:14:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 11:14:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:14:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2019-08-05 11:14:35,543 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 117 [2019-08-05 11:14:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,543 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2019-08-05 11:14:35,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:14:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2019-08-05 11:14:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:14:35,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:35,544 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1] [2019-08-05 11:14:35,544 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:35,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:35,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1359567932, now seen corresponding path program 58 times [2019-08-05 11:14:35,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:35,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:14:35,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:36,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:36,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:14:36,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:14:36,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:14:36,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:14:36,841 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand 61 states. [2019-08-05 11:14:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:36,955 INFO L93 Difference]: Finished difference Result 122 states and 181 transitions. [2019-08-05 11:14:36,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:14:36,955 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2019-08-05 11:14:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:36,956 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:14:36,957 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:14:36,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:14:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:14:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 11:14:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:14:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2019-08-05 11:14:36,959 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 119 [2019-08-05 11:14:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:36,960 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2019-08-05 11:14:36,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:14:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2019-08-05 11:14:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:14:36,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:36,961 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1] [2019-08-05 11:14:36,961 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash 874483842, now seen corresponding path program 59 times [2019-08-05 11:14:36,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:36,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:14:36,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:38,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:38,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:14:38,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:14:38,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:14:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:14:38,808 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand 62 states. [2019-08-05 11:14:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:38,909 INFO L93 Difference]: Finished difference Result 124 states and 184 transitions. [2019-08-05 11:14:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:14:38,909 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-08-05 11:14:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:38,910 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:14:38,910 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:14:38,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:14:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:14:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 11:14:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:14:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2019-08-05 11:14:38,914 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 121 [2019-08-05 11:14:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:38,914 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2019-08-05 11:14:38,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:14:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2019-08-05 11:14:38,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:14:38,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:38,915 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1] [2019-08-05 11:14:38,916 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:38,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:38,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1434858680, now seen corresponding path program 60 times [2019-08-05 11:14:38,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:38,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:14:38,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:40,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:40,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:14:40,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:14:40,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:14:40,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:14:40,266 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand 63 states. [2019-08-05 11:14:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:40,377 INFO L93 Difference]: Finished difference Result 126 states and 187 transitions. [2019-08-05 11:14:40,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:14:40,378 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2019-08-05 11:14:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:40,379 INFO L225 Difference]: With dead ends: 126 [2019-08-05 11:14:40,379 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 11:14:40,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:14:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 11:14:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-08-05 11:14:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 11:14:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 187 transitions. [2019-08-05 11:14:40,382 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 187 transitions. Word has length 123 [2019-08-05 11:14:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:40,382 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 187 transitions. [2019-08-05 11:14:40,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:14:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 187 transitions. [2019-08-05 11:14:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 11:14:40,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:40,383 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1] [2019-08-05 11:14:40,383 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash -214930290, now seen corresponding path program 61 times [2019-08-05 11:14:40,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:40,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:14:40,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:41,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:41,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:14:41,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:14:41,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:14:41,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:14:41,782 INFO L87 Difference]: Start difference. First operand 126 states and 187 transitions. Second operand 64 states. [2019-08-05 11:14:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:41,920 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2019-08-05 11:14:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:14:41,920 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2019-08-05 11:14:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:41,921 INFO L225 Difference]: With dead ends: 128 [2019-08-05 11:14:41,921 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 11:14:41,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:14:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 11:14:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-05 11:14:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:14:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-08-05 11:14:41,925 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 125 [2019-08-05 11:14:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:41,925 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-08-05 11:14:41,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:14:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-08-05 11:14:41,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:14:41,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:41,926 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1] [2019-08-05 11:14:41,926 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash -389819308, now seen corresponding path program 62 times [2019-08-05 11:14:41,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:41,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:14:41,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:43,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:43,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:14:43,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:14:43,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:14:43,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:14:43,764 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 65 states. [2019-08-05 11:14:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:43,883 INFO L93 Difference]: Finished difference Result 130 states and 193 transitions. [2019-08-05 11:14:43,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:14:43,884 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2019-08-05 11:14:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:43,884 INFO L225 Difference]: With dead ends: 130 [2019-08-05 11:14:43,884 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 11:14:43,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:14:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 11:14:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-08-05 11:14:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 11:14:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2019-08-05 11:14:43,886 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 127 [2019-08-05 11:14:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:43,887 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2019-08-05 11:14:43,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:14:43,887 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2019-08-05 11:14:43,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 11:14:43,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:43,887 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1] [2019-08-05 11:14:43,888 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:43,888 INFO L82 PathProgramCache]: Analyzing trace with hash -954441062, now seen corresponding path program 63 times [2019-08-05 11:14:43,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:43,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:14:43,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:45,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:45,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:14:45,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:14:45,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:14:45,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:14:45,961 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand 66 states. [2019-08-05 11:14:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:46,122 INFO L93 Difference]: Finished difference Result 132 states and 196 transitions. [2019-08-05 11:14:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:14:46,122 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2019-08-05 11:14:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:46,124 INFO L225 Difference]: With dead ends: 132 [2019-08-05 11:14:46,124 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 11:14:46,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:14:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 11:14:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 11:14:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 11:14:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 196 transitions. [2019-08-05 11:14:46,127 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 196 transitions. Word has length 129 [2019-08-05 11:14:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:46,128 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 196 transitions. [2019-08-05 11:14:46,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:14:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 196 transitions. [2019-08-05 11:14:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 11:14:46,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:46,129 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1] [2019-08-05 11:14:46,129 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1904899936, now seen corresponding path program 64 times [2019-08-05 11:14:46,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:46,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:14:46,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:47,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:47,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:14:47,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:14:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:14:47,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:14:47,605 INFO L87 Difference]: Start difference. First operand 132 states and 196 transitions. Second operand 67 states. [2019-08-05 11:14:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:47,751 INFO L93 Difference]: Finished difference Result 134 states and 199 transitions. [2019-08-05 11:14:47,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:14:47,751 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2019-08-05 11:14:47,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:47,753 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:14:47,753 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 11:14:47,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 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:14:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 11:14:47,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-08-05 11:14:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:14:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2019-08-05 11:14:47,755 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 131 [2019-08-05 11:14:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:47,756 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2019-08-05 11:14:47,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:14:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2019-08-05 11:14:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:14:47,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:47,757 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1] [2019-08-05 11:14:47,757 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash 952529574, now seen corresponding path program 65 times [2019-08-05 11:14:47,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:47,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:14:47,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:49,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:49,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:14:49,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:14:49,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:14:49,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:14:49,611 INFO L87 Difference]: Start difference. First operand 134 states and 199 transitions. Second operand 68 states. [2019-08-05 11:14:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:49,753 INFO L93 Difference]: Finished difference Result 136 states and 202 transitions. [2019-08-05 11:14:49,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:14:49,753 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2019-08-05 11:14:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:49,754 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:14:49,755 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:14:49,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:14:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:14:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-05 11:14:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:14:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2019-08-05 11:14:49,758 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 133 [2019-08-05 11:14:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:49,759 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 202 transitions. [2019-08-05 11:14:49,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:14:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2019-08-05 11:14:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:14:49,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:49,759 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1] [2019-08-05 11:14:49,760 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:49,760 INFO L82 PathProgramCache]: Analyzing trace with hash 552645740, now seen corresponding path program 66 times [2019-08-05 11:14:49,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:49,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:14:49,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:53,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:53,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:14:53,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:14:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:14:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:14:53,945 INFO L87 Difference]: Start difference. First operand 136 states and 202 transitions. Second operand 69 states. [2019-08-05 11:14:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:54,161 INFO L93 Difference]: Finished difference Result 138 states and 205 transitions. [2019-08-05 11:14:54,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:14:54,161 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2019-08-05 11:14:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:54,162 INFO L225 Difference]: With dead ends: 138 [2019-08-05 11:14:54,162 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 11:14:54,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:14:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 11:14:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-08-05 11:14:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:14:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 205 transitions. [2019-08-05 11:14:54,166 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 205 transitions. Word has length 135 [2019-08-05 11:14:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:54,166 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 205 transitions. [2019-08-05 11:14:54,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:14:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 205 transitions. [2019-08-05 11:14:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 11:14:54,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:54,167 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1] [2019-08-05 11:14:54,168 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:54,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1483629390, now seen corresponding path program 67 times [2019-08-05 11:14:54,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:54,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:14:54,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:55,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:55,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:14:55,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:14:55,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:14:55,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:14:55,781 INFO L87 Difference]: Start difference. First operand 138 states and 205 transitions. Second operand 70 states. [2019-08-05 11:14:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:55,972 INFO L93 Difference]: Finished difference Result 140 states and 208 transitions. [2019-08-05 11:14:55,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:14:55,972 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-08-05 11:14:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:55,973 INFO L225 Difference]: With dead ends: 140 [2019-08-05 11:14:55,973 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 11:14:55,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 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:14:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 11:14:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 11:14:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 11:14:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 208 transitions. [2019-08-05 11:14:55,977 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 208 transitions. Word has length 137 [2019-08-05 11:14:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:55,977 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 208 transitions. [2019-08-05 11:14:55,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:14:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 208 transitions. [2019-08-05 11:14:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 11:14:55,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:55,978 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1] [2019-08-05 11:14:55,978 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash 161057656, now seen corresponding path program 68 times [2019-08-05 11:14:55,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:55,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:14:55,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:57,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:57,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:14:57,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:14:57,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:14:57,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:14:57,709 INFO L87 Difference]: Start difference. First operand 140 states and 208 transitions. Second operand 71 states. [2019-08-05 11:14:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:57,954 INFO L93 Difference]: Finished difference Result 142 states and 211 transitions. [2019-08-05 11:14:57,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:14:57,955 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2019-08-05 11:14:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:57,956 INFO L225 Difference]: With dead ends: 142 [2019-08-05 11:14:57,956 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 11:14:57,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:14:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 11:14:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-08-05 11:14:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 11:14:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 211 transitions. [2019-08-05 11:14:57,959 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 211 transitions. Word has length 139 [2019-08-05 11:14:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:57,959 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 211 transitions. [2019-08-05 11:14:57,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:14:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 211 transitions. [2019-08-05 11:14:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 11:14:57,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:57,960 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1] [2019-08-05 11:14:57,960 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:57,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash 157343934, now seen corresponding path program 69 times [2019-08-05 11:14:57,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:57,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:14:57,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:59,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:59,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:14:59,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:14:59,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:14:59,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:14:59,989 INFO L87 Difference]: Start difference. First operand 142 states and 211 transitions. Second operand 72 states. [2019-08-05 11:15:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:00,165 INFO L93 Difference]: Finished difference Result 144 states and 214 transitions. [2019-08-05 11:15:00,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:15:00,165 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-08-05 11:15:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:00,167 INFO L225 Difference]: With dead ends: 144 [2019-08-05 11:15:00,167 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 11:15:00,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:15:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 11:15:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-08-05 11:15:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 11:15:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2019-08-05 11:15:00,170 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 141 [2019-08-05 11:15:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:00,170 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2019-08-05 11:15:00,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:15:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2019-08-05 11:15:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 11:15:00,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:00,171 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1] [2019-08-05 11:15:00,172 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:00,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:00,172 INFO L82 PathProgramCache]: Analyzing trace with hash 883424388, now seen corresponding path program 70 times [2019-08-05 11:15:00,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:00,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:15:00,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:01,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:01,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:15:01,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:15:01,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:15:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:15:01,991 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand 73 states. [2019-08-05 11:15:02,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:02,166 INFO L93 Difference]: Finished difference Result 146 states and 217 transitions. [2019-08-05 11:15:02,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:15:02,167 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2019-08-05 11:15:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:02,168 INFO L225 Difference]: With dead ends: 146 [2019-08-05 11:15:02,168 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 11:15:02,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:15:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 11:15:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-08-05 11:15:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 11:15:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2019-08-05 11:15:02,172 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 143 [2019-08-05 11:15:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:02,173 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2019-08-05 11:15:02,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:15:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2019-08-05 11:15:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 11:15:02,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:02,174 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1] [2019-08-05 11:15:02,174 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:02,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1432928566, now seen corresponding path program 71 times [2019-08-05 11:15:02,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:02,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:15:02,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:04,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:04,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:15:04,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:15:04,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:15:04,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:15:04,364 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand 74 states. [2019-08-05 11:15:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:04,539 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2019-08-05 11:15:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:15:04,539 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-08-05 11:15:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:04,540 INFO L225 Difference]: With dead ends: 148 [2019-08-05 11:15:04,541 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 11:15:04,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:15:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 11:15:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 11:15:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 11:15:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2019-08-05 11:15:04,544 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 145 [2019-08-05 11:15:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:04,545 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2019-08-05 11:15:04,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:15:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2019-08-05 11:15:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 11:15:04,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:04,546 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1] [2019-08-05 11:15:04,546 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:04,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1639909264, now seen corresponding path program 72 times [2019-08-05 11:15:04,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:04,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:15:04,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:06,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:06,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:15:06,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:15:06,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:15:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:15:06,509 INFO L87 Difference]: Start difference. First operand 148 states and 220 transitions. Second operand 75 states. [2019-08-05 11:15:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:06,715 INFO L93 Difference]: Finished difference Result 150 states and 223 transitions. [2019-08-05 11:15:06,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:15:06,715 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2019-08-05 11:15:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:06,717 INFO L225 Difference]: With dead ends: 150 [2019-08-05 11:15:06,717 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 11:15:06,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:15:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 11:15:06,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-08-05 11:15:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 11:15:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 223 transitions. [2019-08-05 11:15:06,720 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 223 transitions. Word has length 147 [2019-08-05 11:15:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:06,720 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 223 transitions. [2019-08-05 11:15:06,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:15:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 223 transitions. [2019-08-05 11:15:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 11:15:06,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:06,722 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1] [2019-08-05 11:15:06,722 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash -300435754, now seen corresponding path program 73 times [2019-08-05 11:15:06,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:06,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:15:06,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:08,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:08,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:15:08,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:15:08,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:15:08,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:15:08,985 INFO L87 Difference]: Start difference. First operand 150 states and 223 transitions. Second operand 76 states. [2019-08-05 11:15:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:09,190 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2019-08-05 11:15:09,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:15:09,191 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2019-08-05 11:15:09,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:09,192 INFO L225 Difference]: With dead ends: 152 [2019-08-05 11:15:09,192 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 11:15:09,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:15:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 11:15:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-08-05 11:15:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 11:15:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 226 transitions. [2019-08-05 11:15:09,195 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 226 transitions. Word has length 149 [2019-08-05 11:15:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:09,196 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 226 transitions. [2019-08-05 11:15:09,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:15:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2019-08-05 11:15:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 11:15:09,196 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:09,197 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1] [2019-08-05 11:15:09,197 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:09,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash -956191588, now seen corresponding path program 74 times [2019-08-05 11:15:09,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:09,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:15:09,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:11,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:11,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:15:11,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:15:11,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:15:11,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:15:11,830 INFO L87 Difference]: Start difference. First operand 152 states and 226 transitions. Second operand 77 states. [2019-08-05 11:15:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:12,029 INFO L93 Difference]: Finished difference Result 154 states and 229 transitions. [2019-08-05 11:15:12,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:15:12,030 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2019-08-05 11:15:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:12,031 INFO L225 Difference]: With dead ends: 154 [2019-08-05 11:15:12,031 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 11:15:12,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:15:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 11:15:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-08-05 11:15:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 11:15:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2019-08-05 11:15:12,034 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 151 [2019-08-05 11:15:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:12,034 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 229 transitions. [2019-08-05 11:15:12,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:15:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 229 transitions. [2019-08-05 11:15:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 11:15:12,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:12,035 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1] [2019-08-05 11:15:12,035 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash 222644450, now seen corresponding path program 75 times [2019-08-05 11:15:12,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:12,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:15:12,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:14,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:14,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:15:14,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:15:14,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:15:14,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:15:14,338 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand 78 states. [2019-08-05 11:15:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:14,561 INFO L93 Difference]: Finished difference Result 156 states and 232 transitions. [2019-08-05 11:15:14,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:15:14,561 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-08-05 11:15:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:14,562 INFO L225 Difference]: With dead ends: 156 [2019-08-05 11:15:14,563 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 11:15:14,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:15:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 11:15:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-08-05 11:15:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 11:15:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 232 transitions. [2019-08-05 11:15:14,566 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 232 transitions. Word has length 153 [2019-08-05 11:15:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:14,566 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 232 transitions. [2019-08-05 11:15:14,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:15:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 232 transitions. [2019-08-05 11:15:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 11:15:14,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:14,567 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1] [2019-08-05 11:15:14,567 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:14,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:14,567 INFO L82 PathProgramCache]: Analyzing trace with hash -787289176, now seen corresponding path program 76 times [2019-08-05 11:15:14,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:14,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:15:14,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:16,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:16,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:15:16,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:15:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:15:16,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:15:16,627 INFO L87 Difference]: Start difference. First operand 156 states and 232 transitions. Second operand 79 states. [2019-08-05 11:15:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:16,841 INFO L93 Difference]: Finished difference Result 158 states and 235 transitions. [2019-08-05 11:15:16,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:15:16,841 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-08-05 11:15:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:16,843 INFO L225 Difference]: With dead ends: 158 [2019-08-05 11:15:16,843 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 11:15:16,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:15:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 11:15:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-08-05 11:15:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:15:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 235 transitions. [2019-08-05 11:15:16,846 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 235 transitions. Word has length 155 [2019-08-05 11:15:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:16,846 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 235 transitions. [2019-08-05 11:15:16,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:15:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 235 transitions. [2019-08-05 11:15:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:15:16,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:16,847 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1] [2019-08-05 11:15:16,847 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:16,848 INFO L82 PathProgramCache]: Analyzing trace with hash -670894866, now seen corresponding path program 77 times [2019-08-05 11:15:16,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:16,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:15:16,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:19,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:19,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:15:19,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:15:19,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:15:19,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:15:19,327 INFO L87 Difference]: Start difference. First operand 158 states and 235 transitions. Second operand 80 states. [2019-08-05 11:15:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:19,565 INFO L93 Difference]: Finished difference Result 160 states and 238 transitions. [2019-08-05 11:15:19,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:15:19,565 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2019-08-05 11:15:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:19,566 INFO L225 Difference]: With dead ends: 160 [2019-08-05 11:15:19,567 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 11:15:19,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:15:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 11:15:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-08-05 11:15:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:15:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 238 transitions. [2019-08-05 11:15:19,570 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 238 transitions. Word has length 157 [2019-08-05 11:15:19,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:19,570 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 238 transitions. [2019-08-05 11:15:19,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:15:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 238 transitions. [2019-08-05 11:15:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:15:19,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:19,571 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1] [2019-08-05 11:15:19,572 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash -485112652, now seen corresponding path program 78 times [2019-08-05 11:15:19,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:19,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:15:19,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:21,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:21,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:15:21,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:15:21,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:15:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:15:21,738 INFO L87 Difference]: Start difference. First operand 160 states and 238 transitions. Second operand 81 states. [2019-08-05 11:15:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:21,990 INFO L93 Difference]: Finished difference Result 162 states and 241 transitions. [2019-08-05 11:15:21,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:15:21,990 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 159 [2019-08-05 11:15:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:21,991 INFO L225 Difference]: With dead ends: 162 [2019-08-05 11:15:21,991 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 11:15:21,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 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:15:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 11:15:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-08-05 11:15:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 11:15:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 241 transitions. [2019-08-05 11:15:21,995 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 241 transitions. Word has length 159 [2019-08-05 11:15:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:21,995 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 241 transitions. [2019-08-05 11:15:21,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:15:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 241 transitions. [2019-08-05 11:15:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 11:15:21,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:21,996 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1] [2019-08-05 11:15:21,996 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1957935866, now seen corresponding path program 79 times [2019-08-05 11:15:21,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:22,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:15:22,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:24,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:24,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:15:24,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:15:24,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:15:24,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:15:24,536 INFO L87 Difference]: Start difference. First operand 162 states and 241 transitions. Second operand 82 states. [2019-08-05 11:15:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:24,764 INFO L93 Difference]: Finished difference Result 164 states and 244 transitions. [2019-08-05 11:15:24,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:15:24,764 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2019-08-05 11:15:24,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:24,766 INFO L225 Difference]: With dead ends: 164 [2019-08-05 11:15:24,766 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 11:15:24,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:15:24,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 11:15:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 11:15:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 11:15:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 244 transitions. [2019-08-05 11:15:24,770 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 244 transitions. Word has length 161 [2019-08-05 11:15:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:24,770 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 244 transitions. [2019-08-05 11:15:24,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:15:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 244 transitions. [2019-08-05 11:15:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 11:15:24,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:24,771 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1] [2019-08-05 11:15:24,771 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:24,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:24,772 INFO L82 PathProgramCache]: Analyzing trace with hash 380450752, now seen corresponding path program 80 times [2019-08-05 11:15:24,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:24,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:15:24,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:27,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:27,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:15:27,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:15:27,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:15:27,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:15:27,113 INFO L87 Difference]: Start difference. First operand 164 states and 244 transitions. Second operand 83 states. [2019-08-05 11:15:27,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:27,365 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions. [2019-08-05 11:15:27,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:15:27,366 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 163 [2019-08-05 11:15:27,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:27,367 INFO L225 Difference]: With dead ends: 166 [2019-08-05 11:15:27,367 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 11:15:27,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 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:15:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 11:15:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-08-05 11:15:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 11:15:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 247 transitions. [2019-08-05 11:15:27,371 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 247 transitions. Word has length 163 [2019-08-05 11:15:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:27,371 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 247 transitions. [2019-08-05 11:15:27,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:15:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 247 transitions. [2019-08-05 11:15:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 11:15:27,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:27,372 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1] [2019-08-05 11:15:27,372 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:27,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash 540711686, now seen corresponding path program 81 times [2019-08-05 11:15:27,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:27,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:15:27,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:30,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:30,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:15:30,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:15:30,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:15:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:15:30,423 INFO L87 Difference]: Start difference. First operand 166 states and 247 transitions. Second operand 84 states. [2019-08-05 11:15:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:30,685 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-08-05 11:15:30,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:15:30,686 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2019-08-05 11:15:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:30,687 INFO L225 Difference]: With dead ends: 168 [2019-08-05 11:15:30,687 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 11:15:30,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:15:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 11:15:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-08-05 11:15:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 11:15:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-08-05 11:15:30,690 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 165 [2019-08-05 11:15:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:30,690 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-08-05 11:15:30,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:15:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-08-05 11:15:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 11:15:30,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:30,691 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1] [2019-08-05 11:15:30,691 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:30,691 INFO L82 PathProgramCache]: Analyzing trace with hash -67353396, now seen corresponding path program 82 times [2019-08-05 11:15:30,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:30,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:15:30,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:33,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:33,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:15:33,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:15:33,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:15:33,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:15:33,633 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 85 states. [2019-08-05 11:15:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:33,929 INFO L93 Difference]: Finished difference Result 170 states and 253 transitions. [2019-08-05 11:15:33,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:15:33,930 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 167 [2019-08-05 11:15:33,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:33,931 INFO L225 Difference]: With dead ends: 170 [2019-08-05 11:15:33,931 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 11:15:33,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:15:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 11:15:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-08-05 11:15:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 11:15:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2019-08-05 11:15:33,934 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 167 [2019-08-05 11:15:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:33,934 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2019-08-05 11:15:33,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:15:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2019-08-05 11:15:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 11:15:33,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:33,936 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1] [2019-08-05 11:15:33,936 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash -302344942, now seen corresponding path program 83 times [2019-08-05 11:15:33,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:33,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:15:33,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:36,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:36,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:15:36,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:15:36,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:15:36,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:15:36,744 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand 86 states. [2019-08-05 11:15:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:37,023 INFO L93 Difference]: Finished difference Result 172 states and 256 transitions. [2019-08-05 11:15:37,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:15:37,023 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2019-08-05 11:15:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:37,025 INFO L225 Difference]: With dead ends: 172 [2019-08-05 11:15:37,025 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 11:15:37,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:15:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 11:15:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-08-05 11:15:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 11:15:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-08-05 11:15:37,028 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 169 [2019-08-05 11:15:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:37,028 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-08-05 11:15:37,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:15:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-08-05 11:15:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 11:15:37,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:37,029 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1] [2019-08-05 11:15:37,029 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1504046040, now seen corresponding path program 84 times [2019-08-05 11:15:37,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:37,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:15:37,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:39,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:39,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:15:39,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:15:39,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:15:39,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:15:39,845 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 87 states. [2019-08-05 11:15:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:40,138 INFO L93 Difference]: Finished difference Result 174 states and 259 transitions. [2019-08-05 11:15:40,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:15:40,138 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 171 [2019-08-05 11:15:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:40,140 INFO L225 Difference]: With dead ends: 174 [2019-08-05 11:15:40,140 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 11:15:40,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:15:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 11:15:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-08-05 11:15:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 11:15:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 259 transitions. [2019-08-05 11:15:40,144 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 259 transitions. Word has length 171 [2019-08-05 11:15:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:40,144 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 259 transitions. [2019-08-05 11:15:40,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:15:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 259 transitions. [2019-08-05 11:15:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 11:15:40,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:40,145 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1] [2019-08-05 11:15:40,145 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:40,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:40,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2015975138, now seen corresponding path program 85 times [2019-08-05 11:15:40,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:40,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:15:40,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:42,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:42,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:15:42,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:15:42,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:15:42,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:15:42,722 INFO L87 Difference]: Start difference. First operand 174 states and 259 transitions. Second operand 88 states. [2019-08-05 11:15:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:43,029 INFO L93 Difference]: Finished difference Result 176 states and 262 transitions. [2019-08-05 11:15:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:15:43,030 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2019-08-05 11:15:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:43,031 INFO L225 Difference]: With dead ends: 176 [2019-08-05 11:15:43,031 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 11:15:43,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:15:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 11:15:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-08-05 11:15:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 11:15:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 262 transitions. [2019-08-05 11:15:43,036 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 262 transitions. Word has length 173 [2019-08-05 11:15:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:43,036 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 262 transitions. [2019-08-05 11:15:43,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:15:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 262 transitions. [2019-08-05 11:15:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 11:15:43,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:43,037 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1] [2019-08-05 11:15:43,037 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:43,038 INFO L82 PathProgramCache]: Analyzing trace with hash -322097948, now seen corresponding path program 86 times [2019-08-05 11:15:43,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:43,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:15:43,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:46,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:46,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:15:46,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:15:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:15:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:15:46,033 INFO L87 Difference]: Start difference. First operand 176 states and 262 transitions. Second operand 89 states. [2019-08-05 11:15:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:46,855 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2019-08-05 11:15:46,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:15:46,856 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 175 [2019-08-05 11:15:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:46,857 INFO L225 Difference]: With dead ends: 178 [2019-08-05 11:15:46,857 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 11:15:46,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:15:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 11:15:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-08-05 11:15:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 11:15:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 265 transitions. [2019-08-05 11:15:46,862 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 265 transitions. Word has length 175 [2019-08-05 11:15:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:46,863 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 265 transitions. [2019-08-05 11:15:46,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:15:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 265 transitions. [2019-08-05 11:15:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:15:46,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:46,864 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1] [2019-08-05 11:15:46,865 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:46,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:46,865 INFO L82 PathProgramCache]: Analyzing trace with hash -298723542, now seen corresponding path program 87 times [2019-08-05 11:15:46,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:46,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:15:46,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:50,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:50,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:15:50,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:15:50,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:15:50,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:15:50,542 INFO L87 Difference]: Start difference. First operand 178 states and 265 transitions. Second operand 90 states. [2019-08-05 11:15:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:50,887 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2019-08-05 11:15:50,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:15:50,888 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2019-08-05 11:15:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:50,889 INFO L225 Difference]: With dead ends: 180 [2019-08-05 11:15:50,889 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 11:15:50,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:15:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 11:15:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-08-05 11:15:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 11:15:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 268 transitions. [2019-08-05 11:15:50,893 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 268 transitions. Word has length 177 [2019-08-05 11:15:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:50,893 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 268 transitions. [2019-08-05 11:15:50,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:15:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2019-08-05 11:15:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 11:15:50,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:50,894 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1] [2019-08-05 11:15:50,894 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:50,894 INFO L82 PathProgramCache]: Analyzing trace with hash 689244144, now seen corresponding path program 88 times [2019-08-05 11:15:50,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:50,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:15:50,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:53,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:53,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:15:53,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:15:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:15:53,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:15:53,567 INFO L87 Difference]: Start difference. First operand 180 states and 268 transitions. Second operand 91 states. [2019-08-05 11:15:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:53,907 INFO L93 Difference]: Finished difference Result 182 states and 271 transitions. [2019-08-05 11:15:53,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:15:53,907 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 179 [2019-08-05 11:15:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:53,909 INFO L225 Difference]: With dead ends: 182 [2019-08-05 11:15:53,909 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 11:15:53,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:15:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 11:15:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-08-05 11:15:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 11:15:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 271 transitions. [2019-08-05 11:15:53,913 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 271 transitions. Word has length 179 [2019-08-05 11:15:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:53,913 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 271 transitions. [2019-08-05 11:15:53,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:15:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 271 transitions. [2019-08-05 11:15:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:15:53,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:53,914 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1] [2019-08-05 11:15:53,914 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:53,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash 938417974, now seen corresponding path program 89 times [2019-08-05 11:15:53,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:53,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:15:53,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:57,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:57,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:15:57,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:15:57,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:15:57,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:15:57,032 INFO L87 Difference]: Start difference. First operand 182 states and 271 transitions. Second operand 92 states. [2019-08-05 11:15:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:57,394 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2019-08-05 11:15:57,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:15:57,395 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2019-08-05 11:15:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:57,396 INFO L225 Difference]: With dead ends: 184 [2019-08-05 11:15:57,396 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 11:15:57,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:15:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 11:15:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 11:15:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:15:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 274 transitions. [2019-08-05 11:15:57,400 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 274 transitions. Word has length 181 [2019-08-05 11:15:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:57,400 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 274 transitions. [2019-08-05 11:15:57,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:15:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2019-08-05 11:15:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:15:57,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:57,401 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1] [2019-08-05 11:15:57,401 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:57,402 INFO L82 PathProgramCache]: Analyzing trace with hash -123699972, now seen corresponding path program 90 times [2019-08-05 11:15:57,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:57,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:15:57,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:00,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:00,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:16:00,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:16:00,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:16:00,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:16:00,644 INFO L87 Difference]: Start difference. First operand 184 states and 274 transitions. Second operand 93 states. [2019-08-05 11:16:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:01,005 INFO L93 Difference]: Finished difference Result 186 states and 277 transitions. [2019-08-05 11:16:01,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:16:01,006 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 183 [2019-08-05 11:16:01,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:01,007 INFO L225 Difference]: With dead ends: 186 [2019-08-05 11:16:01,008 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 11:16:01,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:16:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 11:16:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-08-05 11:16:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 11:16:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 277 transitions. [2019-08-05 11:16:01,011 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 277 transitions. Word has length 183 [2019-08-05 11:16:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:01,011 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 277 transitions. [2019-08-05 11:16:01,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:16:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 277 transitions. [2019-08-05 11:16:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 11:16:01,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:01,012 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1] [2019-08-05 11:16:01,012 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:01,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1383170370, now seen corresponding path program 91 times [2019-08-05 11:16:01,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:01,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:16:01,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:04,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:04,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:16:04,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:16:04,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:16:04,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:16:04,021 INFO L87 Difference]: Start difference. First operand 186 states and 277 transitions. Second operand 94 states. [2019-08-05 11:16:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:04,394 INFO L93 Difference]: Finished difference Result 188 states and 280 transitions. [2019-08-05 11:16:04,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:16:04,395 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2019-08-05 11:16:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:04,396 INFO L225 Difference]: With dead ends: 188 [2019-08-05 11:16:04,396 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 11:16:04,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 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:16:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 11:16:04,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-08-05 11:16:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 11:16:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 280 transitions. [2019-08-05 11:16:04,399 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 280 transitions. Word has length 185 [2019-08-05 11:16:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:04,400 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 280 transitions. [2019-08-05 11:16:04,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:16:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 280 transitions. [2019-08-05 11:16:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 11:16:04,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:04,401 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1] [2019-08-05 11:16:04,401 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:04,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:04,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2081590280, now seen corresponding path program 92 times [2019-08-05 11:16:04,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:04,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:16:04,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:07,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:07,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:16:07,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:16:07,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:16:07,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:16:07,600 INFO L87 Difference]: Start difference. First operand 188 states and 280 transitions. Second operand 95 states. [2019-08-05 11:16:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:08,027 INFO L93 Difference]: Finished difference Result 190 states and 283 transitions. [2019-08-05 11:16:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:16:08,027 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2019-08-05 11:16:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:08,029 INFO L225 Difference]: With dead ends: 190 [2019-08-05 11:16:08,029 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 11:16:08,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:16:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 11:16:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-08-05 11:16:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 11:16:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 283 transitions. [2019-08-05 11:16:08,032 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 283 transitions. Word has length 187 [2019-08-05 11:16:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:08,033 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 283 transitions. [2019-08-05 11:16:08,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:16:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 283 transitions. [2019-08-05 11:16:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 11:16:08,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:08,034 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1] [2019-08-05 11:16:08,034 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:08,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1046741682, now seen corresponding path program 93 times [2019-08-05 11:16:08,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:08,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:16:08,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:11,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:11,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:16:11,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:16:11,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:16:11,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:16:11,506 INFO L87 Difference]: Start difference. First operand 190 states and 283 transitions. Second operand 96 states. [2019-08-05 11:16:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:11,884 INFO L93 Difference]: Finished difference Result 192 states and 286 transitions. [2019-08-05 11:16:11,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:16:11,884 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2019-08-05 11:16:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:11,886 INFO L225 Difference]: With dead ends: 192 [2019-08-05 11:16:11,886 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 11:16:11,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 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:16:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 11:16:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-08-05 11:16:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 11:16:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2019-08-05 11:16:11,889 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 189 [2019-08-05 11:16:11,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:11,890 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2019-08-05 11:16:11,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:16:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2019-08-05 11:16:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 11:16:11,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:11,890 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1] [2019-08-05 11:16:11,891 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:11,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:11,891 INFO L82 PathProgramCache]: Analyzing trace with hash -896649964, now seen corresponding path program 94 times [2019-08-05 11:16:11,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:11,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:16:11,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:15,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:15,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:16:15,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:16:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:16:15,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:16:15,836 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand 97 states. [2019-08-05 11:16:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:16,252 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2019-08-05 11:16:16,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:16:16,253 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 191 [2019-08-05 11:16:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:16,254 INFO L225 Difference]: With dead ends: 194 [2019-08-05 11:16:16,254 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 11:16:16,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:16:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 11:16:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-08-05 11:16:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 11:16:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-08-05 11:16:16,258 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 191 [2019-08-05 11:16:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:16,258 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-08-05 11:16:16,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:16:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-08-05 11:16:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 11:16:16,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:16,259 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1] [2019-08-05 11:16:16,259 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1607570266, now seen corresponding path program 95 times [2019-08-05 11:16:16,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:16,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:16:16,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:19,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:19,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:16:19,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:16:19,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:16:19,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:16:19,389 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 98 states. [2019-08-05 11:16:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:19,936 INFO L93 Difference]: Finished difference Result 196 states and 292 transitions. [2019-08-05 11:16:19,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:16:19,937 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2019-08-05 11:16:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:19,938 INFO L225 Difference]: With dead ends: 196 [2019-08-05 11:16:19,938 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 11:16:19,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 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:16:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 11:16:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 11:16:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 11:16:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 292 transitions. [2019-08-05 11:16:19,941 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 292 transitions. Word has length 193 [2019-08-05 11:16:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:19,941 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 292 transitions. [2019-08-05 11:16:19,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:16:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 292 transitions. [2019-08-05 11:16:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 11:16:19,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:19,943 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1] [2019-08-05 11:16:19,943 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1313441760, now seen corresponding path program 96 times [2019-08-05 11:16:19,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:19,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:16:19,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:23,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:23,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:16:23,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:16:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:16:23,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:16:23,307 INFO L87 Difference]: Start difference. First operand 196 states and 292 transitions. Second operand 99 states. [2019-08-05 11:16:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:23,747 INFO L93 Difference]: Finished difference Result 198 states and 295 transitions. [2019-08-05 11:16:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:16:23,747 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 195 [2019-08-05 11:16:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:23,749 INFO L225 Difference]: With dead ends: 198 [2019-08-05 11:16:23,749 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 11:16:23,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:16:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 11:16:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-08-05 11:16:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 11:16:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 295 transitions. [2019-08-05 11:16:23,753 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 295 transitions. Word has length 195 [2019-08-05 11:16:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:23,753 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 295 transitions. [2019-08-05 11:16:23,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:16:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 295 transitions. [2019-08-05 11:16:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 11:16:23,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:23,754 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1] [2019-08-05 11:16:23,755 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:23,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:23,755 INFO L82 PathProgramCache]: Analyzing trace with hash 502612838, now seen corresponding path program 97 times [2019-08-05 11:16:23,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:23,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:16:23,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:27,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:27,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:16:27,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:16:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:16:27,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:16:27,562 INFO L87 Difference]: Start difference. First operand 198 states and 295 transitions. Second operand 100 states. [2019-08-05 11:16:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:28,124 INFO L93 Difference]: Finished difference Result 200 states and 298 transitions. [2019-08-05 11:16:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:16:28,124 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2019-08-05 11:16:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:28,126 INFO L225 Difference]: With dead ends: 200 [2019-08-05 11:16:28,126 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 11:16:28,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:16:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 11:16:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-08-05 11:16:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 11:16:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 298 transitions. [2019-08-05 11:16:28,130 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 298 transitions. Word has length 197 [2019-08-05 11:16:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:28,130 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 298 transitions. [2019-08-05 11:16:28,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:16:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 298 transitions. [2019-08-05 11:16:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 11:16:28,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:28,131 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1] [2019-08-05 11:16:28,131 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:28,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:28,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1974359340, now seen corresponding path program 98 times [2019-08-05 11:16:28,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:28,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:16:28,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:31,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:31,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:16:31,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:16:31,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:16:31,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:16:31,915 INFO L87 Difference]: Start difference. First operand 200 states and 298 transitions. Second operand 101 states. [2019-08-05 11:16:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:32,462 INFO L93 Difference]: Finished difference Result 202 states and 301 transitions. [2019-08-05 11:16:32,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:16:32,463 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2019-08-05 11:16:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:32,464 INFO L225 Difference]: With dead ends: 202 [2019-08-05 11:16:32,464 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 11:16:32,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:16:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 11:16:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-08-05 11:16:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 11:16:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions. [2019-08-05 11:16:32,467 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 199 [2019-08-05 11:16:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:32,468 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 301 transitions. [2019-08-05 11:16:32,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:16:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 301 transitions. [2019-08-05 11:16:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 11:16:32,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:32,469 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1] [2019-08-05 11:16:32,469 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:32,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:32,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1016459918, now seen corresponding path program 99 times [2019-08-05 11:16:32,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:32,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:16:32,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:36,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:36,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:16:36,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:16:36,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:16:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:16:36,135 INFO L87 Difference]: Start difference. First operand 202 states and 301 transitions. Second operand 102 states. [2019-08-05 11:16:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:36,654 INFO L93 Difference]: Finished difference Result 204 states and 304 transitions. [2019-08-05 11:16:36,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:16:36,654 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2019-08-05 11:16:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:36,656 INFO L225 Difference]: With dead ends: 204 [2019-08-05 11:16:36,656 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 11:16:36,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:16:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 11:16:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-08-05 11:16:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 11:16:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 304 transitions. [2019-08-05 11:16:36,660 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 304 transitions. Word has length 201 [2019-08-05 11:16:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:36,661 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 304 transitions. [2019-08-05 11:16:36,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:16:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 304 transitions. [2019-08-05 11:16:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 11:16:36,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:36,662 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1] [2019-08-05 11:16:36,662 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:36,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:36,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1860645832, now seen corresponding path program 100 times [2019-08-05 11:16:36,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:36,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:16:36,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 9801 trivial. 0 not checked. [2019-08-05 11:16:36,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:36,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:16:36,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:16:36,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:16:36,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:36,814 INFO L87 Difference]: Start difference. First operand 204 states and 304 transitions. Second operand 5 states. [2019-08-05 11:16:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:36,836 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-05 11:16:36,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:36,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-08-05 11:16:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:36,837 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:16:36,837 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:16:36,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 199 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:16:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:16:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:16:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:16:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:16:36,838 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 203 [2019-08-05 11:16:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:36,838 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:16:36,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:16:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:16:36,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:16:36,843 INFO L202 PluginConnector]: Adding new model loop-CountTillBound-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:16:36 BoogieIcfgContainer [2019-08-05 11:16:36,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:16:36,846 INFO L168 Benchmark]: Toolchain (without parser) took 165354.83 ms. Allocated memory was 140.5 MB in the beginning and 384.8 MB in the end (delta: 244.3 MB). Free memory was 108.8 MB in the beginning and 198.5 MB in the end (delta: -89.6 MB). Peak memory consumption was 154.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:36,846 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:16:36,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.76 ms. Allocated memory is still 140.5 MB. Free memory was 108.8 MB in the beginning and 106.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:36,848 INFO L168 Benchmark]: Boogie Preprocessor took 24.43 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 105.8 MB in the end (delta: 900.1 kB). Peak memory consumption was 900.1 kB. Max. memory is 7.1 GB. [2019-08-05 11:16:36,848 INFO L168 Benchmark]: RCFGBuilder took 306.07 ms. Allocated memory is still 140.5 MB. Free memory was 105.8 MB in the beginning and 96.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:36,849 INFO L168 Benchmark]: TraceAbstraction took 164982.91 ms. Allocated memory was 140.5 MB in the beginning and 384.8 MB in the end (delta: 244.3 MB). Free memory was 96.0 MB in the beginning and 198.5 MB in the end (delta: -102.5 MB). Peak memory consumption was 141.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:36,851 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.76 ms. Allocated memory is still 140.5 MB. Free memory was 108.8 MB in the beginning and 106.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.43 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 105.8 MB in the end (delta: 900.1 kB). Peak memory consumption was 900.1 kB. Max. memory is 7.1 GB. * RCFGBuilder took 306.07 ms. Allocated memory is still 140.5 MB. Free memory was 105.8 MB in the beginning and 96.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 164982.91 ms. Allocated memory was 140.5 MB in the beginning and 384.8 MB in the end (delta: 244.3 MB). Free memory was 96.0 MB in the beginning and 198.5 MB in the end (delta: -102.5 MB). Peak memory consumption was 141.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 164.9s OverallTime, 101 OverallIterations, 100 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 12045 SDslu, 10100 SDs, 0 SdLazy, 6771 SolverSat, 327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10302 GetRequests, 5249 SyntacticMatches, 0 SemanticMatches, 5053 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 142.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 145.2s InterpolantComputationTime, 10403 NumberOfCodeBlocks, 10403 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 10302 ConstructedInterpolants, 0 QuantifiedInterpolants, 4165442 SizeOfPredicates, 100 NumberOfNonLiveVariables, 21008 ConjunctsInSsa, 5156 ConjunctsInUnsatCore, 101 InterpolantComputations, 2 PerfectInterpolantSequences, 10000/338350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...