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/20170319-ConjunctivePathPrograms/bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:22:11,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:22:11,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:22:11,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:22:11,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:22:11,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:22:11,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:22:11,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:22:11,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:22:11,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:22:11,441 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:22:11,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:22:11,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:22:11,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:22:11,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:22:11,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:22:11,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:22:11,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:22:11,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:22:11,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:22:11,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:22:11,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:22:11,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:22:11,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:22:11,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:22:11,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:22:11,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:22:11,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:22:11,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:22:11,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:22:11,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:22:11,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:22:11,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:22:11,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:22:11,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:22:11,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:22:11,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:22:11,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:22:11,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:22:11,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:22:11,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:22:11,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:22:11,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:22:11,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:22:11,529 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:22:11,530 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:22:11,530 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-04 21:22:11,531 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl' [2019-08-04 21:22:11,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:22:11,568 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:22:11,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:22:11,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:22:11,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:22:11,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (1/1) ... [2019-08-04 21:22:11,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (1/1) ... [2019-08-04 21:22:11,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:22:11,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:22:11,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:22:11,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:22:11,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (1/1) ... [2019-08-04 21:22:11,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (1/1) ... [2019-08-04 21:22:11,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (1/1) ... [2019-08-04 21:22:11,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (1/1) ... [2019-08-04 21:22:11,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (1/1) ... [2019-08-04 21:22:11,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (1/1) ... [2019-08-04 21:22:11,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (1/1) ... [2019-08-04 21:22:11,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:22:11,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:22:11,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:22:11,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:22:11,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (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-04 21:22:11,678 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-04 21:22:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:22:11,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:22:11,937 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:22:11,937 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:22:11,938 INFO L202 PluginConnector]: Adding new model bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:22:11 BoogieIcfgContainer [2019-08-04 21:22:11,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:22:11,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:22:11,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:22:11,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:22:11,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:22:11" (1/2) ... [2019-08-04 21:22:11,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568c798b and model type bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:22:11, skipping insertion in model container [2019-08-04 21:22:11,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:22:11" (2/2) ... [2019-08-04 21:22:11,947 INFO L109 eAbstractionObserver]: Analyzing ICFG bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-04 21:22:11,956 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:22:11,964 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:22:11,981 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:22:12,008 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:22:12,009 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:22:12,009 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:22:12,009 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:22:12,009 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:22:12,009 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:22:12,010 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:22:12,010 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:22:12,010 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:22:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:22:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:22:12,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:12,034 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:22:12,038 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:12,046 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:22:12,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:12,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:22:12,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:12,291 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-04 21:22:12,314 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-04 21:22:12,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:12,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:22:12,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:22:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:22:12,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:22:12,349 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:22:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:12,383 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:22:12,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:22:12,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:22:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:12,396 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:22:12,396 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:22:12,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:22:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:22:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:22:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:22:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:22:12,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:22:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:12,433 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:22:12,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:22:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:22:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:22:12,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:12,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:22:12,435 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:22:12,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:12,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:22:12,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:12,597 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-04 21:22:12,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:12,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:22:12,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:22:12,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:22:12,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:22:12,601 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:22:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:12,633 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:22:12,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:22:12,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:22:12,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:12,635 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:22:12,635 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:22:12,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:22:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:22:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:22:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:22:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:22:12,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:22:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:12,638 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:22:12,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:22:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:22:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:22:12,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:12,639 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:22:12,640 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:12,640 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:22:12,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:12,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:22:12,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:12,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:12,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:22:12,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:22:12,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:22:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:22:12,832 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:22:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:12,896 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:22:12,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:22:12,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:22:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:12,898 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:22:12,898 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:22:12,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:22:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:22:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:22:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:22:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:22:12,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:22:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:12,903 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:22:12,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:22:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:22:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:22:12,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:12,904 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:22:12,914 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:12,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:12,914 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:22:12,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:12,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:22:12,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:13,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:13,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:22:13,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:22:13,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:22:13,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:22:13,321 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:22:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:13,377 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:22:13,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:22:13,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:22:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:13,379 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:22:13,379 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:22:13,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:22:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:22:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:22:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:22:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:22:13,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:22:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:13,382 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:22:13,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:22:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:22:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:22:13,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:13,383 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:22:13,383 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:13,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:13,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:22:13,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:13,411 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:22:13,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:13,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:13,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:22:13,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:22:13,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:22:13,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:22:13,683 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:22:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:13,757 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:22:13,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:22:13,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:22:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:13,758 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:22:13,758 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:22:13,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:22:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:22:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:22:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:22:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:22:13,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:22:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:13,765 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:22:13,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:22:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:22:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:22:13,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:13,766 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:22:13,766 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:13,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:22:13,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:13,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:22:13,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:13,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:13,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:13,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:13,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:13,981 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:22:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:14,077 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:22:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:22:14,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:22:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:14,078 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:22:14,079 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:22:14,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:22:14,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:22:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:22:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:22:14,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:22:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:14,083 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:22:14,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:22:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:22:14,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:14,084 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:22:14,084 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:14,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:22:14,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:14,116 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:22:14,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:14,360 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-04 21:22:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:14,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:14,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:14,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:14,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:14,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:14,525 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:22:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:14,624 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:22:14,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:22:14,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:22:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:14,627 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:22:14,627 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:22:14,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:22:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:22:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:22:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:22:14,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:22:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:14,630 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:22:14,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:22:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:22:14,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:14,631 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:22:14,631 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:14,632 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:22:14,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:14,659 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:22:14,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:14,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:14,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:22:14,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:14,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:14,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:14,887 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:22:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:14,998 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:22:14,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:22:14,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:22:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:15,000 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:22:15,001 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:22:15,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:22:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:22:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:22:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:22:15,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:22:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:15,005 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:22:15,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:22:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:22:15,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:15,006 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:22:15,006 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:15,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:15,007 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:22:15,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:15,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:22:15,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:15,184 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-04 21:22:15,421 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-04 21:22:15,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:15,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:22:15,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:22:15,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:22:15,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:22:15,422 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:22:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:15,542 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:22:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:22:15,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:22:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:15,543 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:22:15,543 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:22:15,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:22:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:22:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:22:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:22:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:22:15,547 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:22:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:15,548 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:22:15,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:22:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:22:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:15,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:15,549 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:22:15,549 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-04 21:22:15,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:15,577 WARN L254 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:22:15,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:15,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:15,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:22:15,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:22:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:22:15,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:22:15,772 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:22:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:15,895 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:22:15,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:15,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:22:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:15,897 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:22:15,897 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:22:15,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:22:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:22:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:22:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:22:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:22:15,901 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:22:15,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:15,902 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:22:15,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:22:15,902 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:22:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:22:15,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:15,903 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:22:15,903 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:15,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-04 21:22:15,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:15,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:22:15,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:16,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:16,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:22:16,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:22:16,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:22:16,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:22:16,709 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:22:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:16,951 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:22:16,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:22:16,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:22:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:16,953 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:22:16,953 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:22:16,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:22:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:22:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:22:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:22:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:22:16,958 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:22:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:16,958 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:22:16,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:22:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:22:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:22:16,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:16,959 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:22:16,959 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:16,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:16,960 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-04 21:22:16,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:16,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:22:16,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:17,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:17,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:22:17,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:22:17,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:22:17,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:22:17,400 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:22:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:17,553 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:22:17,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:22:17,554 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:22:17,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:17,555 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:22:17,555 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:22:17,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:22:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:22:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:22:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:22:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:22:17,559 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:22:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:17,560 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:22:17,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:22:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:22:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:22:17,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:17,561 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:22:17,561 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-04 21:22:17,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:17,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:22:17,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:17,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:17,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:22:17,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:22:17,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:22:17,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:22:17,844 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:22:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:18,018 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:22:18,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:18,024 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:22:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:18,025 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:22:18,025 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:22:18,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:22:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:22:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:22:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:22:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:22:18,028 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:22:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:18,029 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:22:18,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:22:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:22:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:18,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:18,030 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:22:18,030 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-04 21:22:18,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:18,056 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:22:18,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:18,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:18,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:22:18,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:22:18,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:22:18,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:22:18,408 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:22:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:18,743 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:22:18,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:22:18,744 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:22:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:18,744 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:22:18,745 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:22:18,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:22:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:22:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:22:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:22:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:22:18,749 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:22:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:18,749 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:22:18,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:22:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:22:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:22:18,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:18,750 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:22:18,750 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:18,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-04 21:22:18,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:18,784 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:22:18,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:19,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:19,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:22:19,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:22:19,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:22:19,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:19,252 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:22:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:19,459 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:22:19,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:22:19,459 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:22:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:19,460 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:22:19,460 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:22:19,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:22:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:22:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:22:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:22:19,464 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:22:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:19,464 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:22:19,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:22:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:22:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:19,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:19,465 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:22:19,465 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:19,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:19,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-04 21:22:19,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:19,490 WARN L254 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:22:19,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:20,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:20,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:22:20,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:22:20,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:22:20,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:22:20,089 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:22:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:20,338 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:22:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:22:20,338 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:22:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:20,339 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:22:20,340 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:22:20,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:22:20,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:22:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:22:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:22:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:22:20,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:22:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:20,345 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:22:20,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:22:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:22:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:22:20,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:20,346 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:22:20,346 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:20,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-04 21:22:20,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:20,370 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:22:20,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:20,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:20,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:22:20,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:22:20,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:22:20,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:22:20,667 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:22:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:20,946 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:22:20,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:22:20,947 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:22:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:20,947 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:22:20,947 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:22:20,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:22:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:22:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:22:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:22:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:22:20,951 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:22:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:20,951 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:22:20,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:22:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:22:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:22:20,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:20,952 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:22:20,952 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:20,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:20,953 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-04 21:22:20,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:20,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-04 21:22:20,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:21,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:21,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:22:21,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:22:21,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:22:21,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:21,275 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:22:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:21,619 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:22:21,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:22:21,620 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:22:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:21,621 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:22:21,621 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:22:21,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:22:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:22:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:22:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:22:21,625 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:22:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:21,625 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:22:21,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:22:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:22:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:22:21,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:21,626 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:22:21,627 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:21,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:21,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-04 21:22:21,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:21,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-04 21:22:21,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:22,277 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-04 21:22:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:23,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:23,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:22:23,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:22:23,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:22:23,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:23,030 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:22:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:23,355 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:22:23,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:23,355 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:22:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:23,357 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:22:23,357 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:22:23,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:22:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:22:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:22:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:22:23,361 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:22:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:23,361 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:22:23,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:22:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:22:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:22:23,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:23,362 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:22:23,363 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:23,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-04 21:22:23,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:23,390 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-04 21:22:23,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:24,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:24,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:22:24,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:22:24,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:22:24,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:24,014 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:22:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:24,395 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:22:24,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:22:24,395 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:22:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:24,396 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:22:24,397 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:22:24,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:22:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:22:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:22:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:22:24,400 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:22:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:24,401 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:22:24,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:22:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:22:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:22:24,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:24,401 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:22:24,402 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:24,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:24,402 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-04 21:22:24,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:24,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-04 21:22:24,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:24,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:24,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:22:24,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:22:24,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:22:24,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:22:24,927 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:22:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:25,379 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:22:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:22:25,380 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:22:25,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:25,381 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:22:25,381 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:22:25,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:22:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:22:25,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:22:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:22:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:22:25,385 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:22:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:25,385 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:22:25,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:22:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:22:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:22:25,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:25,386 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:22:25,386 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:25,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-04 21:22:25,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:25,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-04 21:22:25,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:25,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:25,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:22:25,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:22:25,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:22:25,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:22:25,904 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:22:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:26,333 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:22:26,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:22:26,335 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:22:26,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:26,336 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:22:26,336 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:22:26,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:22:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:22:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:22:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:22:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:22:26,340 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:22:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:26,340 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:22:26,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:22:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:22:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:26,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:26,341 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:22:26,342 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:26,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:26,342 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-04 21:22:26,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:26,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-04 21:22:26,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:26,513 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-04 21:22:26,664 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-04 21:22:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:27,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:27,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:22:27,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:22:27,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:22:27,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:22:27,484 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:22:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:28,244 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:22:28,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:22:28,245 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:22:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:28,245 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:22:28,246 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:22:28,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:22:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:22:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:22:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:22:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:22:28,249 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:22:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:28,249 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:22:28,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:22:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:22:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:22:28,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:28,250 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:22:28,250 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:28,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:28,250 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-04 21:22:28,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:28,284 WARN L254 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-04 21:22:28,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:29,019 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-04 21:22:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:29,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:29,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:22:29,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:22:29,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:22:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:22:29,773 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:22:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:30,446 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:22:30,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:22:30,447 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:22:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:30,448 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:22:30,448 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:22:30,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:22:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:22:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:22:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:22:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:22:30,454 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:22:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:30,454 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:22:30,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:22:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:22:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:22:30,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:30,456 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:22:30,456 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:30,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:30,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-04 21:22:30,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:30,487 WARN L254 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-04 21:22:30,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:30,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:30,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:22:30,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:22:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:22:30,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:22:30,980 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:22:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:31,467 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:22:31,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:22:31,468 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:22:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:31,468 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:22:31,468 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:22:31,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:22:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:22:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:22:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:22:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:22:31,473 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:22:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:31,473 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:22:31,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:22:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:22:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:22:31,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:31,474 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:22:31,475 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:31,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-04 21:22:31,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:31,509 WARN L254 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-04 21:22:31,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:32,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:32,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:22:32,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:22:32,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:22:32,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:22:32,259 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:22:32,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:32,817 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:22:32,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:22:32,818 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:22:32,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:32,818 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:22:32,819 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:22:32,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:22:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:22:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:22:32,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:22:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:22:32,822 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:22:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:32,823 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:22:32,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:22:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:22:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:32,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:32,823 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:22:32,824 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:32,824 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-04 21:22:32,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:32,860 WARN L254 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-04 21:22:32,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:33,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:33,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:22:33,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:22:33,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:22:33,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:22:33,835 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:22:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:34,495 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:22:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:22:34,496 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:22:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:34,496 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:22:34,496 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:22:34,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:22:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:22:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:22:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:22:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:22:34,500 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:22:34,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:34,501 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:22:34,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:22:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:22:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:22:34,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:34,502 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:22:34,502 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:34,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:34,502 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-04 21:22:34,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:34,554 WARN L254 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-04 21:22:34,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:35,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:35,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:22:35,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:22:35,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:22:35,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:22:35,361 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:22:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:35,989 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:22:35,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:22:35,989 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:22:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:35,990 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:22:35,990 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:22:35,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:22:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:22:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:22:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:22:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:22:35,994 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:22:35,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:35,995 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:22:35,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:22:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:22:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:22:35,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:35,995 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:22:35,996 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:35,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:35,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-04 21:22:35,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:36,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 176 conjunts are in the unsatisfiable core [2019-08-04 21:22:36,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:36,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:36,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:22:36,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:22:36,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:22:36,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:22:36,634 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:22:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:37,327 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:22:37,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:22:37,328 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:22:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:37,328 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:22:37,328 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:22:37,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:22:37,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:22:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:22:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:22:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:22:37,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:22:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:37,334 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:22:37,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:22:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:22:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:22:37,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:37,335 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:22:37,335 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-04 21:22:37,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:37,376 WARN L254 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-04 21:22:37,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:38,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:38,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:22:38,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:22:38,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:22:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:22:38,010 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:22:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:38,787 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:22:38,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:22:38,788 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:22:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:38,788 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:22:38,788 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:22:38,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:22:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:22:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:22:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:22:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:22:38,792 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:22:38,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:38,793 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:22:38,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:22:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:22:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:22:38,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:38,793 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:22:38,793 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:38,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:38,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-04 21:22:38,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:38,836 WARN L254 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 188 conjunts are in the unsatisfiable core [2019-08-04 21:22:38,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:39,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:39,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:22:39,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:22:39,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:22:39,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:22:39,644 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:22:40,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:40,384 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:22:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:22:40,385 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:22:40,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:40,385 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:22:40,385 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:22:40,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:22:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:22:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:22:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:22:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:22:40,389 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:22:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:40,389 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:22:40,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:22:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:22:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:22:40,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:40,390 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:22:40,390 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:40,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-04 21:22:40,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:40,429 WARN L254 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-04 21:22:40,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:41,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:41,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:22:41,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:22:41,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:22:41,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:22:41,154 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:22:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:41,954 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:22:41,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:22:41,954 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:22:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:41,955 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:22:41,955 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:22:41,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:22:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:22:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:22:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:22:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:22:41,960 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:22:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:41,960 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:22:41,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:22:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:22:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:22:41,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:41,961 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:22:41,961 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-04 21:22:41,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:42,007 WARN L254 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 200 conjunts are in the unsatisfiable core [2019-08-04 21:22:42,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:42,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:42,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:22:42,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:22:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:22:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:22:42,983 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:22:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:43,887 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:22:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:22:43,887 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:22:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:43,888 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:22:43,888 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:22:43,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:22:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:22:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:22:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:22:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:22:43,892 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:22:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:43,892 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:22:43,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:22:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:22:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:22:43,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:43,893 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:22:43,894 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-04 21:22:43,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:43,937 WARN L254 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 206 conjunts are in the unsatisfiable core [2019-08-04 21:22:43,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:45,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:45,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:22:45,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:22:45,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:22:45,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:22:45,069 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:22:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:46,039 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:22:46,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:22:46,040 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:22:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:46,041 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:22:46,041 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:22:46,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:22:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:22:46,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:22:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:22:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:22:46,044 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:22:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:46,044 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:22:46,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:22:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:22:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:22:46,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:46,045 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:22:46,045 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:46,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-04 21:22:46,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:46,098 WARN L254 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 212 conjunts are in the unsatisfiable core [2019-08-04 21:22:46,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:46,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:46,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:22:46,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:22:46,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:22:46,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:22:46,850 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:22:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:47,841 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:22:47,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:22:47,842 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:22:47,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:47,843 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:22:47,843 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:22:47,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:22:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:22:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:22:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:22:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:22:47,847 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:22:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:47,847 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:22:47,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:22:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:22:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:22:47,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:47,848 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:22:47,848 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:47,849 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-04 21:22:47,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:47,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 218 conjunts are in the unsatisfiable core [2019-08-04 21:22:47,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:49,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:49,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:22:49,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:22:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:22:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:22:49,351 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:22:50,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:50,425 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:22:50,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:22:50,426 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:22:50,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:50,426 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:22:50,426 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:22:50,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:22:50,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:22:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:22:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:22:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:22:50,431 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:22:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:50,431 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:22:50,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:22:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:22:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:22:50,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:50,432 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:22:50,432 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:50,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:50,432 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-04 21:22:50,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:50,487 WARN L254 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 224 conjunts are in the unsatisfiable core [2019-08-04 21:22:50,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:51,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:51,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:22:51,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:22:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:22:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:22:51,355 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:22:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:52,462 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:22:52,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:22:52,462 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:22:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:52,463 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:22:52,463 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:22:52,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:22:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:22:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:22:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:22:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:22:52,467 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:22:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:52,467 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:22:52,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:22:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:22:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:22:52,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:52,468 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:22:52,468 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-04 21:22:52,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:52,531 WARN L254 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 230 conjunts are in the unsatisfiable core [2019-08-04 21:22:52,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:53,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:53,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:22:53,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:22:53,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:22:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:22:53,414 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:22:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:54,758 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:22:54,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:22:54,759 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:22:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:54,760 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:22:54,760 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:22:54,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:22:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:22:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:22:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:22:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:22:54,763 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:22:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:54,764 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:22:54,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:22:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:22:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:22:54,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:54,764 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:22:54,765 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:54,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:54,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-04 21:22:54,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:54,837 WARN L254 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 236 conjunts are in the unsatisfiable core [2019-08-04 21:22:54,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:55,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:55,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:22:55,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:22:55,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:22:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:22:55,845 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:22:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:57,065 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:22:57,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:22:57,065 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:22:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:57,066 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:22:57,066 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:22:57,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:22:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:22:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:22:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:22:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:22:57,070 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:22:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:57,070 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:22:57,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:22:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:22:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:22:57,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:57,071 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:22:57,071 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:57,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-04 21:22:57,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:57,138 WARN L254 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 242 conjunts are in the unsatisfiable core [2019-08-04 21:22:57,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:58,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:58,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:22:58,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:22:58,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:22:58,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:22:58,645 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:23:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:00,002 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:23:00,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:23:00,003 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:23:00,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:00,004 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:23:00,004 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:23:00,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:23:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:23:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:23:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:23:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:23:00,007 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:23:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:00,007 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:23:00,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:23:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:23:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:23:00,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:00,007 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:23:00,008 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-04 21:23:00,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:00,079 WARN L254 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 248 conjunts are in the unsatisfiable core [2019-08-04 21:23:00,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:01,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:01,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:23:01,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:23:01,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:23:01,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:23:01,207 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:23:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:02,566 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:23:02,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:23:02,567 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:23:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:02,568 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:23:02,568 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:23:02,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:23:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:23:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:23:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:23:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:23:02,571 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:23:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:02,572 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:23:02,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:23:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:23:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:23:02,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:02,572 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:23:02,573 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:02,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-04 21:23:02,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:02,638 WARN L254 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 254 conjunts are in the unsatisfiable core [2019-08-04 21:23:02,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:03,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:03,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:23:03,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:23:03,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:23:03,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:23:03,699 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:23:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:05,244 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:23:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:23:05,245 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:23:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:05,245 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:23:05,246 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:23:05,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:23:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:23:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:23:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:23:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:23:05,249 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:23:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:05,249 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:23:05,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:23:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:23:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:23:05,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:05,250 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:23:05,250 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-04 21:23:05,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:05,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 260 conjunts are in the unsatisfiable core [2019-08-04 21:23:05,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:06,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:06,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:23:06,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:23:06,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:23:06,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:23:06,416 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:23:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:07,896 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:23:07,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:23:07,896 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:23:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:07,897 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:23:07,897 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:23:07,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:23:07,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:23:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:23:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:23:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:23:07,901 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:23:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:07,901 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:23:07,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:23:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:23:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:23:07,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:07,902 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:23:07,902 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:07,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:07,903 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-04 21:23:07,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:07,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 266 conjunts are in the unsatisfiable core [2019-08-04 21:23:07,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:09,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:09,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:23:09,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:23:09,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:23:09,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:23:09,077 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:23:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:10,775 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:23:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:23:10,775 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:23:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:10,776 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:23:10,776 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:23:10,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:23:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:23:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:23:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:23:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:23:10,779 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:23:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:10,780 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:23:10,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:23:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:23:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:23:10,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:10,781 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:23:10,781 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:10,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:10,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-04 21:23:10,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:10,871 WARN L254 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 272 conjunts are in the unsatisfiable core [2019-08-04 21:23:10,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:12,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:12,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:23:12,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:23:12,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:23:12,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:23:12,500 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:23:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:14,112 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:23:14,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:23:14,113 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:23:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:14,114 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:23:14,114 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:23:14,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:23:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:23:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:23:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:23:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:23:14,117 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:23:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:14,118 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:23:14,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:23:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:23:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:23:14,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:14,119 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:23:14,119 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:14,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:14,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-04 21:23:14,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:14,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 278 conjunts are in the unsatisfiable core [2019-08-04 21:23:14,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:15,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:15,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:23:15,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:23:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:23:15,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:23:15,772 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:23:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:17,469 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:23:17,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:23:17,470 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:23:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:17,471 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:23:17,471 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:23:17,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:23:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:23:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:23:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:23:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:23:17,473 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:23:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:17,474 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:23:17,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:23:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:23:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:23:17,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:17,475 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:23:17,475 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:17,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:17,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-04 21:23:17,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:17,562 WARN L254 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 284 conjunts are in the unsatisfiable core [2019-08-04 21:23:17,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:19,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:19,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:23:19,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:23:19,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:23:19,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:23:19,259 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:23:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:21,086 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:23:21,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:23:21,087 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:23:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:21,088 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:23:21,088 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:23:21,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:23:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:23:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:23:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:23:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:23:21,091 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:23:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:21,091 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:23:21,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:23:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:23:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:23:21,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:21,092 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:23:21,092 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:21,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-04 21:23:21,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:21,160 WARN L254 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 290 conjunts are in the unsatisfiable core [2019-08-04 21:23:21,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:22,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:22,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:23:22,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:23:22,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:23:22,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:23:22,399 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:23:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:24,217 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:23:24,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:23:24,218 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:23:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:24,218 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:23:24,219 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:23:24,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:23:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:23:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:23:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:23:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:23:24,222 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:23:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:24,222 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:23:24,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:23:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:23:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:23:24,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:24,223 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:23:24,223 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-04 21:23:24,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:24,320 WARN L254 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 296 conjunts are in the unsatisfiable core [2019-08-04 21:23:24,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:25,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:25,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:23:25,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:23:25,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:23:25,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:23:25,852 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:23:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:27,752 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:23:27,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:23:27,752 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:23:27,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:27,753 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:23:27,753 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:23:27,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:23:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:23:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:23:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:23:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:23:27,756 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:23:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:27,757 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:23:27,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:23:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:23:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:23:27,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:27,758 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:23:27,758 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-04 21:23:27,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:27,857 WARN L254 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 302 conjunts are in the unsatisfiable core [2019-08-04 21:23:27,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:29,263 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-04 21:23:29,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:29,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:23:29,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:23:29,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:23:29,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:23:29,264 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:23:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:31,357 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:23:31,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:23:31,359 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:23:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:31,360 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:23:31,360 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:23:31,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:23:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:23:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:23:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:23:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:23:31,362 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:23:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:31,362 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:23:31,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:23:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:23:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:23:31,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:31,363 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:23:31,363 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:31,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:31,363 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-04 21:23:31,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:31,445 WARN L254 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 308 conjunts are in the unsatisfiable core [2019-08-04 21:23:31,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:32,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:32,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:23:32,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:23:32,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:23:32,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:23:32,914 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:23:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:34,969 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:23:34,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:23:34,969 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:23:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:34,970 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:23:34,971 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:23:34,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:23:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:23:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:23:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:23:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:23:34,974 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:23:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:34,974 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:23:34,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:23:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:23:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:23:34,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:34,975 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:23:34,975 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:34,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-04 21:23:34,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:35,112 WARN L254 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 314 conjunts are in the unsatisfiable core [2019-08-04 21:23:35,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:36,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:36,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:23:36,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:23:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:23:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:23:36,836 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:23:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:38,997 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:23:38,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:23:38,997 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:23:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:38,998 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:23:38,998 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:23:38,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:23:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:23:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:23:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:23:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:23:39,001 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:23:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:39,001 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:23:39,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:23:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:23:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:23:39,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:39,002 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:23:39,003 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:39,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:39,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-04 21:23:39,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:39,089 WARN L254 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 320 conjunts are in the unsatisfiable core [2019-08-04 21:23:39,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:40,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:40,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:23:40,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:23:40,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:23:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:23:40,866 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:23:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:43,080 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:23:43,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:23:43,081 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:23:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:43,081 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:23:43,082 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:23:43,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:23:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:23:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:23:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:23:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:23:43,085 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:23:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:43,085 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:23:43,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:23:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:23:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:23:43,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:43,086 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:23:43,087 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:43,087 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-04 21:23:43,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:43,197 WARN L254 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 326 conjunts are in the unsatisfiable core [2019-08-04 21:23:43,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:44,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:44,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:23:44,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:23:44,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:23:44,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:23:44,800 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:23:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:47,209 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:23:47,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:23:47,210 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:23:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:47,211 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:23:47,211 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:23:47,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:23:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:23:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:23:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:23:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:23:47,213 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:23:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:47,214 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:23:47,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:23:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:23:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:23:47,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:47,214 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:23:47,215 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:47,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:47,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-04 21:23:47,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:47,306 WARN L254 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 332 conjunts are in the unsatisfiable core [2019-08-04 21:23:47,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:48,134 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-04 21:23:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:49,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:49,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:23:49,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:23:49,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:23:49,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:23:49,705 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:23:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:52,210 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:23:52,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:23:52,211 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:23:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:52,212 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:23:52,212 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:23:52,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:23:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:23:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:23:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:23:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:23:52,215 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:23:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:52,215 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:23:52,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:23:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:23:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:23:52,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:52,216 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:23:52,216 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:52,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:52,216 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-04 21:23:52,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:52,307 WARN L254 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 338 conjunts are in the unsatisfiable core [2019-08-04 21:23:52,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:54,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:54,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:23:54,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:23:54,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:23:54,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:23:54,025 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:23:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:56,626 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:23:56,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:23:56,626 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:23:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:56,627 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:23:56,627 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:23:56,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:23:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:23:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:23:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:23:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:23:56,631 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:23:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:56,631 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:23:56,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:23:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:23:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:23:56,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:56,632 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:23:56,633 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:56,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:56,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-04 21:23:56,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:56,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 344 conjunts are in the unsatisfiable core [2019-08-04 21:23:56,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:58,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:23:58,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:23:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:23:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:23:58,527 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:24:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:01,248 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:24:01,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:24:01,249 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:24:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:01,250 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:24:01,250 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:24:01,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:24:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:24:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:24:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:24:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:24:01,253 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:24:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:01,254 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:24:01,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:24:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:24:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:24:01,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:01,255 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:24:01,255 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-04 21:24:01,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:01,357 WARN L254 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 350 conjunts are in the unsatisfiable core [2019-08-04 21:24:01,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:03,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:03,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:24:03,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:24:03,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:24:03,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:24:03,252 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:24:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:05,932 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:24:05,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:24:05,932 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:24:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:05,932 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:24:05,932 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:24:05,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:24:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:24:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:24:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:24:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:24:05,935 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:24:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:05,935 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:24:05,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:24:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:24:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:24:05,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:05,936 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:24:05,936 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-04 21:24:05,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:06,051 WARN L254 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 356 conjunts are in the unsatisfiable core [2019-08-04 21:24:06,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:08,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:08,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:24:08,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:24:08,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:24:08,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:24:08,130 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:24:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:10,862 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:24:10,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:24:10,862 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:24:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:10,863 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:24:10,863 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:24:10,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:24:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:24:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:24:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:24:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:24:10,866 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:24:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:10,867 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:24:10,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:24:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:24:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:24:10,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:10,867 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:24:10,868 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:10,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-04 21:24:10,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:10,998 WARN L254 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 362 conjunts are in the unsatisfiable core [2019-08-04 21:24:11,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:13,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:13,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:24:13,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:24:13,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:24:13,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:24:13,153 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:24:15,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:15,955 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:24:15,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:24:15,955 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:24:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:15,956 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:24:15,956 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:24:15,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:24:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:24:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:24:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:24:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:24:15,959 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:24:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:15,960 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:24:15,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:24:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:24:15,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:24:15,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:15,960 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:24:15,961 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:15,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-04 21:24:15,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:16,108 WARN L254 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 368 conjunts are in the unsatisfiable core [2019-08-04 21:24:16,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:18,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:18,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:24:18,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:24:18,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:24:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:24:18,313 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:24:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:21,273 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:24:21,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:24:21,273 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:24:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:21,274 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:24:21,274 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:24:21,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:24:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:24:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:24:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:24:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:24:21,276 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:24:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:21,276 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:24:21,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:24:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:24:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:24:21,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:21,277 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:24:21,277 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:21,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-04 21:24:21,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:21,452 WARN L254 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 374 conjunts are in the unsatisfiable core [2019-08-04 21:24:21,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:23,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:23,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:24:23,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:24:23,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:24:23,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:24:23,550 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:24:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:26,709 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:24:26,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:24:26,709 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:24:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:26,710 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:24:26,710 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:24:26,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:24:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:24:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:24:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:24:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:24:26,712 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:24:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:26,712 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:24:26,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:24:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:24:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:24:26,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:26,713 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:24:26,713 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:26,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:26,714 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-04 21:24:26,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:26,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 380 conjunts are in the unsatisfiable core [2019-08-04 21:24:26,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:29,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:29,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:24:29,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:24:29,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:24:29,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:24:29,540 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:24:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:32,810 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:24:32,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:24:32,811 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:24:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:32,812 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:24:32,812 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:24:32,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:24:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:24:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:24:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:24:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:24:32,815 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:24:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:32,816 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:24:32,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:24:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:24:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:24:32,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:32,816 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:24:32,817 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-04 21:24:32,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:32,967 WARN L254 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 386 conjunts are in the unsatisfiable core [2019-08-04 21:24:32,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:35,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:35,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:24:35,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:24:35,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:24:35,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:24:35,103 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:24:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:38,403 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:24:38,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:24:38,404 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:24:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:38,405 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:24:38,405 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:24:38,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:24:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:24:38,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:24:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:24:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:24:38,408 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:24:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:38,409 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:24:38,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:24:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:24:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:24:38,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:38,410 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:24:38,410 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:38,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:38,410 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-04 21:24:38,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:38,690 WARN L254 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 392 conjunts are in the unsatisfiable core [2019-08-04 21:24:38,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:41,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:41,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:24:41,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:24:41,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:24:41,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:24:41,086 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:24:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:44,560 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:24:44,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:24:44,561 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:24:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:44,561 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:24:44,562 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:24:44,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:24:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:24:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:24:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:24:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:24:44,564 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:24:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:44,565 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:24:44,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:24:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:24:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:24:44,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:44,566 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:24:44,566 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:44,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-04 21:24:44,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:44,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 398 conjunts are in the unsatisfiable core [2019-08-04 21:24:44,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:47,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:47,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:24:47,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:24:47,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:24:47,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:24:47,173 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:24:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:50,588 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:24:50,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:24:50,589 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:24:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:50,589 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:24:50,590 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:24:50,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:24:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:24:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:24:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:24:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:24:50,592 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:24:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:50,592 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:24:50,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:24:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:24:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:24:50,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:50,593 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:24:50,593 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-04 21:24:50,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:50,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 404 conjunts are in the unsatisfiable core [2019-08-04 21:24:50,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:53,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:53,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:24:53,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:24:53,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:24:53,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:24:53,457 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:24:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:56,947 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:24:56,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:24:56,953 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:24:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:56,953 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:24:56,954 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:24:56,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:24:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:24:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:24:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:24:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:24:56,955 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:24:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:56,956 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:24:56,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:24:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:24:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:24:56,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:56,956 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:24:56,957 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-04 21:24:56,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:57,161 WARN L254 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 410 conjunts are in the unsatisfiable core [2019-08-04 21:24:57,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:59,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:59,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:24:59,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:24:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:24:59,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:24:59,654 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:25:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:03,463 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:25:03,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:25:03,463 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:25:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:03,464 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:25:03,464 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:25:03,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:25:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:25:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:25:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:25:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:25:03,467 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:25:03,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:03,468 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:25:03,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:25:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:25:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:25:03,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:03,468 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:25:03,468 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:03,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-04 21:25:03,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:03,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 416 conjunts are in the unsatisfiable core [2019-08-04 21:25:03,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:06,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:06,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:25:06,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:25:06,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:25:06,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:25:06,094 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:25:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:09,904 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:25:09,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:25:09,905 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:25:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:09,906 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:25:09,906 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:25:09,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:25:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:25:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:25:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:25:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:25:09,908 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:25:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:09,909 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:25:09,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:25:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:25:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:25:09,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:09,910 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:25:09,910 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-04 21:25:09,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:10,083 WARN L254 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 422 conjunts are in the unsatisfiable core [2019-08-04 21:25:10,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:12,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:12,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:25:12,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:25:12,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:25:12,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:25:12,846 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:25:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:16,698 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:25:16,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:25:16,699 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:25:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:16,700 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:25:16,700 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:25:16,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:25:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:25:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:25:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:25:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:25:16,704 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:25:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:16,705 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:25:16,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:25:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:25:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:25:16,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:16,705 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:25:16,706 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:16,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-04 21:25:16,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:16,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 428 conjunts are in the unsatisfiable core [2019-08-04 21:25:16,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:19,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:19,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:25:19,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:25:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:25:19,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:25:19,810 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:25:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:23,897 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:25:23,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:25:23,898 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:25:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:23,899 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:25:23,899 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:25:23,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:25:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:25:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:25:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:25:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:25:23,902 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:25:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:23,902 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:25:23,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:25:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:25:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:25:23,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:23,903 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:25:23,903 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:23,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-04 21:25:23,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:24,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 434 conjunts are in the unsatisfiable core [2019-08-04 21:25:24,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:26,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:26,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:25:26,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:25:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:25:26,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:25:26,951 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:25:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:31,117 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:25:31,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:25:31,117 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:25:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:31,119 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:25:31,119 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:25:31,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:25:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:25:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:25:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:25:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:25:31,122 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:25:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:31,123 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:25:31,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:25:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:25:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:25:31,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:31,123 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:25:31,124 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-04 21:25:31,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:31,342 WARN L254 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 440 conjunts are in the unsatisfiable core [2019-08-04 21:25:31,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:34,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:34,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:25:34,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:25:34,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:25:34,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:25:34,220 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:25:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:38,491 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:25:38,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:25:38,491 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:25:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:38,492 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:25:38,492 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:25:38,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:25:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:25:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:25:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:25:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:25:38,496 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:25:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:38,496 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:25:38,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:25:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:25:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:25:38,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:38,496 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:25:38,497 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:38,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-04 21:25:38,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:38,691 WARN L254 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 446 conjunts are in the unsatisfiable core [2019-08-04 21:25:38,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:41,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:41,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:25:41,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:25:41,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:25:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:25:41,482 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:25:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:45,857 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:25:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:25:45,857 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:25:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:45,858 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:25:45,858 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:25:45,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:25:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:25:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:25:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:25:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:25:45,861 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:25:45,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:45,861 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:25:45,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:25:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:25:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:25:45,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:45,862 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:25:45,863 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:45,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:45,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-04 21:25:45,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:46,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 452 conjunts are in the unsatisfiable core [2019-08-04 21:25:46,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:49,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:49,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:25:49,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:25:49,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:25:49,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:25:49,199 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:25:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:53,732 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:25:53,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:25:53,732 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:25:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:53,733 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:25:53,733 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:25:53,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:25:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:25:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:25:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:25:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:25:53,735 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:25:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:53,735 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:25:53,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:25:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:25:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:25:53,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:53,736 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:25:53,737 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:53,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:53,737 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-04 21:25:53,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:53,940 WARN L254 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 458 conjunts are in the unsatisfiable core [2019-08-04 21:25:53,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:56,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:56,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:25:56,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:25:56,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:25:56,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:25:56,829 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:26:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:01,458 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:26:01,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:26:01,458 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:26:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:01,459 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:26:01,459 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:26:01,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:26:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:26:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:26:01,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:26:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:26:01,462 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:26:01,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:01,462 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:26:01,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:26:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:26:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:26:01,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:01,463 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:26:01,463 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-04 21:26:01,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:01,712 WARN L254 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 464 conjunts are in the unsatisfiable core [2019-08-04 21:26:01,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:04,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:04,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:26:04,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:26:04,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:26:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:26:04,888 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-04 21:26:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:09,634 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:26:09,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:26:09,635 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:26:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:09,636 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:26:09,636 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:26:09,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:26:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:26:09,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:26:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:26:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:26:09,638 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-04 21:26:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:09,639 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:26:09,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:26:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:26:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:26:09,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:09,640 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:26:09,640 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-04 21:26:09,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:09,857 WARN L254 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 470 conjunts are in the unsatisfiable core [2019-08-04 21:26:09,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:12,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:12,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:26:12,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:26:12,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:26:12,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:26:12,863 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-04 21:26:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:17,886 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:26:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:26:17,887 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-04 21:26:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:17,888 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:26:17,888 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:26:17,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:26:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:26:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:26:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:26:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-04 21:26:17,894 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-04 21:26:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:17,894 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-04 21:26:17,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:26:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-04 21:26:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:26:17,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:17,895 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-04 21:26:17,895 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:17,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-04 21:26:17,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:18,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 476 conjunts are in the unsatisfiable core [2019-08-04 21:26:18,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-04 21:26:21,379 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-04 21:26:21,379 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:26:21,383 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:26:21,383 INFO L202 PluginConnector]: Adding new model bhmr2007.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:26:21 BoogieIcfgContainer [2019-08-04 21:26:21,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:26:21,385 INFO L168 Benchmark]: Toolchain (without parser) took 249817.03 ms. Allocated memory was 133.7 MB in the beginning and 485.5 MB in the end (delta: 351.8 MB). Free memory was 110.1 MB in the beginning and 113.8 MB in the end (delta: -3.8 MB). Peak memory consumption was 348.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:26:21,386 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:26:21,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.73 ms. Allocated memory is still 133.7 MB. Free memory was 109.9 MB in the beginning and 108.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:26:21,387 INFO L168 Benchmark]: Boogie Preprocessor took 19.46 ms. Allocated memory is still 133.7 MB. Free memory was 108.4 MB in the beginning and 107.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:26:21,387 INFO L168 Benchmark]: RCFGBuilder took 318.74 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 97.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:26:21,388 INFO L168 Benchmark]: TraceAbstraction took 249443.38 ms. Allocated memory was 133.7 MB in the beginning and 485.5 MB in the end (delta: 351.8 MB). Free memory was 97.1 MB in the beginning and 113.8 MB in the end (delta: -16.7 MB). Peak memory consumption was 335.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:26:21,391 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 133.7 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.73 ms. Allocated memory is still 133.7 MB. Free memory was 109.9 MB in the beginning and 108.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.46 ms. Allocated memory is still 133.7 MB. Free memory was 108.4 MB in the beginning and 107.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 318.74 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 97.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249443.38 ms. Allocated memory was 133.7 MB in the beginning and 485.5 MB in the end (delta: 351.8 MB). Free memory was 97.1 MB in the beginning and 113.8 MB in the end (delta: -16.7 MB). Peak memory consumption was 335.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 78,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 249.3s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 132.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 0 SDslu, 3081 SDs, 0 SdLazy, 167401 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 111.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3159 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3081 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 103.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=78, 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, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 109.3s InterpolantComputationTime, 3237 NumberOfCodeBlocks, 3237 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 3159 ConstructedInterpolants, 0 QuantifiedInterpolants, 1655836 SizeOfPredicates, 312 NumberOfNonLiveVariables, 31824 ConjunctsInSsa, 18642 ConjunctsInUnsatCore, 78 InterpolantComputations, 1 PerfectInterpolantSequences, 0/79079 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown