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/20170304-DifficultPathPrograms/half_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:34:05,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:34:05,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:34:05,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:34:05,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:34:05,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:34:05,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:34:05,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:34:05,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:34:05,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:34:05,437 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:34:05,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:34:05,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:34:05,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:34:05,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:34:05,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:34:05,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:34:05,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:34:05,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:34:05,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:34:05,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:34:05,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:34:05,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:34:05,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:34:05,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:34:05,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:34:05,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:34:05,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:34:05,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:34:05,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:34:05,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:34:05,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:34:05,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:34:05,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:34:05,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:34:05,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:34:05,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:34:05,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:34:05,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:34:05,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:34:05,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:34:05,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:34:05,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:34:05,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:34:05,526 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:34:05,527 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:34:05,527 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/half_2.i_3.bpl [2019-08-04 21:34:05,528 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/half_2.i_3.bpl' [2019-08-04 21:34:05,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:34:05,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:34:05,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:34:05,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:34:05,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:34:05,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (1/1) ... [2019-08-04 21:34:05,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (1/1) ... [2019-08-04 21:34:05,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:34:05,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:34:05,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:34:05,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:34:05,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (1/1) ... [2019-08-04 21:34:05,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (1/1) ... [2019-08-04 21:34:05,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (1/1) ... [2019-08-04 21:34:05,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (1/1) ... [2019-08-04 21:34:05,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (1/1) ... [2019-08-04 21:34:05,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (1/1) ... [2019-08-04 21:34:05,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (1/1) ... [2019-08-04 21:34:05,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:34:05,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:34:05,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:34:05,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:34:05,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (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:34:05,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:34:05,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:34:05,955 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:34:05,956 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-04 21:34:05,957 INFO L202 PluginConnector]: Adding new model half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:34:05 BoogieIcfgContainer [2019-08-04 21:34:05,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:34:05,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:34:05,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:34:05,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:34:05,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:05" (1/2) ... [2019-08-04 21:34:05,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6c02a7 and model type half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:34:05, skipping insertion in model container [2019-08-04 21:34:05,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:34:05" (2/2) ... [2019-08-04 21:34:05,968 INFO L109 eAbstractionObserver]: Analyzing ICFG half_2.i_3.bpl [2019-08-04 21:34:05,979 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:34:05,992 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:34:06,009 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:34:06,033 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:34:06,034 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:34:06,034 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:34:06,034 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:34:06,034 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:34:06,034 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:34:06,034 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:34:06,035 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:34:06,035 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:34:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:34:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:34:06,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:06,055 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:34:06,058 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:34:06,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:06,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:34:06,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:06,257 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:34:06,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:34:06,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:34:06,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:34:06,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:34:06,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:34:06,278 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:34:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:06,325 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:34:06,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:34:06,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:34:06,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:06,345 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:34:06,345 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:34:06,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:34:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:34:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:34:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:34:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:34:06,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:34:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:06,406 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:34:06,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:34:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:34:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:34:06,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:06,408 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:34:06,408 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:34:06,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:06,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:34:06,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:06,564 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:34:06,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:06,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:34:06,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:34:06,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:34:06,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:34:06,568 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:34:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:06,598 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:34:06,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:34:06,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:34:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:06,599 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:34:06,599 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:34:06,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:34:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:34:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:34:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:34:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:34:06,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:34:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:06,603 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:34:06,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:34:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:34:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:34:06,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:06,605 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:34:06,605 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:06,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:34:06,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:06,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:34:06,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:06,774 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:34:06,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:06,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:34:06,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:34:06,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:34:06,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:34:06,777 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:34:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:06,837 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:34:06,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:34:06,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:34:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:06,839 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:34:06,839 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:34:06,840 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:34:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:34:06,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:34:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:34:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:34:06,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:34:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:06,842 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:34:06,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:34:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:34:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:34:06,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:06,844 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:34:06,844 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:06,845 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:34:06,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:06,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:34:06,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:07,109 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:34:07,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:07,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:34:07,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:34:07,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:34:07,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:34:07,111 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:34:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:07,294 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:34:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:34:07,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:34:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:07,297 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:34:07,297 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:34:07,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:34:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:34:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:34:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:34:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:34:07,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:34:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:07,301 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:34:07,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:34:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:34:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:34:07,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:07,302 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:34:07,302 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:34:07,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:07,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:34:07,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:07,566 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:34:07,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:07,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:34:07,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:34:07,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:34:07,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:34:07,568 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:34:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:07,620 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:34:07,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:34:07,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:34:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:07,623 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:34:07,623 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:34:07,624 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:34:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:34:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:34:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:34:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:34:07,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:34:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:07,627 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:34:07,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:34:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:34:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:34:07,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:07,628 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:34:07,628 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:07,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:07,628 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:34:07,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:07,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:34:07,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:07,910 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:34:07,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:07,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:34:07,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:34:07,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:34:07,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:34:07,913 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:34:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:08,042 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:34:08,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:34:08,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:34:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:08,045 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:34:08,045 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:34:08,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:34:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:34:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:34:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:34:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:34:08,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:34:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:08,048 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:34:08,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:34:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:34:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:34:08,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:08,049 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:34:08,050 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:08,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:34:08,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:08,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:34:08,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:08,351 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:34:08,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:08,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:34:08,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:34:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:34:08,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:34:08,353 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:34:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:08,650 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:34:08,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:34:08,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:34:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:08,652 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:34:08,652 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:34:08,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:34:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:34:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:34:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:34:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:34:08,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:34:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:08,656 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:34:08,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:34:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:34:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:34:08,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:08,657 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:34:08,658 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:08,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:08,658 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:34:08,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:08,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:34:08,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:08,898 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:34:08,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:08,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:34:08,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:34:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:34:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:34:08,900 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:34:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:08,997 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:34:08,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:34:08,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:34:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:08,999 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:34:08,999 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:34:09,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:34:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:34:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:34:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:34:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:34:09,003 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:34:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:09,003 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:34:09,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:34:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:34:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:34:09,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:09,004 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:34:09,005 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:34:09,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:09,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:34:09,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:09,273 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:34:09,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:09,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:34:09,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:34:09,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:34:09,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:34:09,275 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:34:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:09,413 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:34:09,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:34:09,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:34:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:09,414 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:34:09,414 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:34:09,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:34:09,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:34:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:34:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:34:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:34:09,417 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:34:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:09,417 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:34:09,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:34:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:34:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:34:09,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:09,418 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:34:09,418 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:09,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:09,419 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-04 21:34:09,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:09,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:34:09,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:09,722 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:34:09,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:09,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:34:09,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:34:09,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:34:09,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:34:09,724 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:34:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:09,818 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:34:09,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:34:09,819 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:34:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:09,820 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:34:09,820 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:34:09,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:34:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:34:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:34:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:34:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:34:09,824 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:34:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:09,824 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:34:09,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:34:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:34:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:34:09,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:09,825 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:34:09,825 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-04 21:34:09,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:09,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:34:09,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:10,247 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:34:10,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:10,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:34:10,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:34:10,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:34:10,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:34:10,249 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:34:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:10,408 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:34:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:34:10,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:34:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:10,409 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:34:10,410 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:34:10,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:34:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:34:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:34:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:34:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:34:10,412 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:34:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:10,413 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:34:10,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:34:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:34:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:34:10,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:10,413 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:34:10,414 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:10,414 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-04 21:34:10,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:10,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:34:10,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:10,888 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:34:10,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:10,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:34:10,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:34:10,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:34:10,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:34:10,890 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:34:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:11,052 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:34:11,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:34:11,053 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:34:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:11,054 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:34:11,054 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:34:11,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:34:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:34:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:34:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:34:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:34:11,058 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:34:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:11,059 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:34:11,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:34:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:34:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:34:11,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:11,060 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:34:11,060 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-04 21:34:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:11,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:34:11,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:11,409 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:34:11,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:11,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:34:11,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:34:11,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:34:11,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:34:11,411 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:34:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:11,766 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:34:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:34:11,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:34:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:11,773 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:34:11,773 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:34:11,774 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:34:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:34:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:34:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:34:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:34:11,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:34:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:11,777 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:34:11,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:34:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:34:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:34:11,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:11,778 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:34:11,778 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-04 21:34:11,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:11,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:34:11,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:12,114 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:34:12,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:12,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:34:12,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:34:12,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:34:12,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:34:12,117 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:34:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:12,287 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:34:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:34:12,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:34:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:12,289 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:34:12,289 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:34:12,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:34:12,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:34:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:34:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:34:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:34:12,293 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:34:12,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:12,293 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:34:12,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:34:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:34:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:34:12,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:12,294 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:34:12,294 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-04 21:34:12,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:12,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:34:12,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:12,749 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:34:12,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:12,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:34:12,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:34:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:34:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:34:12,751 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:34:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:13,057 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:34:13,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:34:13,065 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:34:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:13,066 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:34:13,066 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:34:13,066 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:34:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:34:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:34:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:34:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:34:13,069 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:34:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:13,069 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:34:13,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:34:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:34:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:34:13,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:13,070 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:34:13,070 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:13,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-04 21:34:13,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:13,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:34:13,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:13,766 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:34:13,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:13,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:34:13,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:34:13,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:34:13,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:34:13,768 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:34:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:13,995 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:34:13,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:34:13,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:34:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:13,997 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:34:13,997 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:34:13,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:34:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:34:14,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:34:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:34:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:34:14,001 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:34:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:14,002 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:34:14,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:34:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:34:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:34:14,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:14,003 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:34:14,003 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:14,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:14,003 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-04 21:34:14,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:14,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:34:14,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:14,398 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:34:14,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:14,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:34:14,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:34:14,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:34:14,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:34:14,401 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:34:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:14,650 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:34:14,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:34:14,652 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:34:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:14,652 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:34:14,652 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:34:14,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:34:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:34:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:34:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:34:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:34:14,655 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:34:14,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:14,656 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:34:14,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:34:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:34:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:34:14,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:14,656 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:34:14,657 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:14,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:14,657 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-04 21:34:14,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:14,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:34:14,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:14,979 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:34:14,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:14,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:34:14,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:34:14,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:34:14,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:34:14,981 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:34:15,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:15,382 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:34:15,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:34:15,383 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:34:15,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:15,383 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:34:15,383 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:34:15,384 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:34:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:34:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:34:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:34:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:34:15,387 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:34:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:15,387 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:34:15,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:34:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:34:15,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:34:15,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:15,388 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:34:15,388 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:15,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:15,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-04 21:34:15,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:15,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:34:15,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:15,806 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:34:15,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:15,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:34:15,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:34:15,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:34:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:34:15,809 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:34:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:16,109 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:34:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:34:16,109 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:34:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:16,110 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:34:16,110 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:34:16,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:34:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:34:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:34:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:34:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:34:16,114 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:34:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:16,114 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:34:16,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:34:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:34:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:34:16,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:16,115 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:34:16,116 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:16,116 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-04 21:34:16,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:16,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:34:16,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:16,847 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:34:16,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:16,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:34:16,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:34:16,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:34:16,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:34:16,849 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:34:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:17,229 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:34:17,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:34:17,230 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:34:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:17,231 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:34:17,231 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:34:17,232 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:34:17,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:34:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:34:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:34:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:34:17,235 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:34:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:17,235 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:34:17,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:34:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:34:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:34:17,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:17,236 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:34:17,236 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:17,237 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-04 21:34:17,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:17,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:34:17,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:18,814 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:34:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:34:18,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:34:18,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:34:18,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:34:18,816 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:34:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:19,219 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:34:19,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:34:19,220 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:34:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:19,221 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:34:19,221 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:34:19,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:34:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:34:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:34:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:34:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:34:19,225 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:34:19,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:19,225 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:34:19,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:34:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:34:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:34:19,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:19,226 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:34:19,226 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:19,227 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-04 21:34:19,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:19,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:34:19,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:19,618 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:34:19,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:19,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:34:19,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:34:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:34:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:34:19,620 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:34:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:20,017 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:34:20,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:34:20,020 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:34:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:20,020 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:34:20,021 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:34:20,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:34:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:34:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:34:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:34:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:34:20,024 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:34:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:20,024 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:34:20,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:34:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:34:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:34:20,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:20,025 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:34:20,026 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-04 21:34:20,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:20,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:34:20,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:20,685 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:34:20,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:20,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:34:20,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:34:20,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:34:20,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:34:20,687 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:34:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:21,440 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:34:21,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:34:21,441 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:34:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:21,441 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:34:21,441 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:34:21,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:34:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:34:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:34:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:34:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:34:21,444 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:34:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:21,445 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:34:21,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:34:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:34:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:34:21,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:21,446 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:34:21,446 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:21,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:21,446 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-04 21:34:21,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:21,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:34:21,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:23,010 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:34:23,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:23,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:34:23,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:34:23,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:34:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:34:23,013 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:34:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:23,712 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:34:23,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:34:23,716 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:34:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:23,717 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:34:23,717 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:34:23,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:34:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:34:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:34:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:34:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:34:23,722 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:34:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:23,722 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:34:23,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:34:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:34:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:34:23,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:23,723 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:34:23,723 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:23,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-04 21:34:23,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:23,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:34:23,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:24,296 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:34:24,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:24,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:34:24,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:34:24,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:34:24,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:34:24,298 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:34:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:24,745 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:34:24,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:34:24,745 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:34:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:24,746 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:34:24,746 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:34:24,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:34:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:34:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:34:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:34:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:34:24,750 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:34:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:24,750 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:34:24,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:34:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:34:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:34:24,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:24,751 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:34:24,751 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-04 21:34:24,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:24,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:34:24,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:25,224 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:34:25,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:25,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:34:25,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:34:25,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:34:25,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:34:25,226 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:34:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:25,901 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:34:25,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:34:25,901 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:34:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:25,902 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:34:25,902 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:34:25,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:34:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:34:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:34:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:34:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:34:25,906 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:34:25,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:25,906 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:34:25,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:34:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:34:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:34:25,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:25,907 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:34:25,907 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:25,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-04 21:34:25,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:25,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:34:25,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:26,450 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:34:26,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:26,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:34:26,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:34:26,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:34:26,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:34:26,452 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:34:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:26,998 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:34:26,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:34:26,999 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:34:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:26,999 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:34:27,000 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:34:27,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:34:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:34:27,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:34:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:34:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:34:27,003 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:34:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:27,003 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:34:27,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:34:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:34:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:34:27,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:27,004 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:34:27,004 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:27,005 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-04 21:34:27,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:27,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:34:27,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:27,591 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:34:27,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:27,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:34:27,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:34:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:34:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:34:27,592 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:34:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:28,146 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:34:28,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:34:28,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:34:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:28,147 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:34:28,147 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:34:28,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:34:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:34:28,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:34:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:34:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:34:28,152 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:34:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:28,152 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:34:28,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:34:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:34:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:34:28,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:28,153 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:34:28,153 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:28,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:28,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-04 21:34:28,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:28,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:34:28,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:28,919 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:34:28,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:28,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:34:28,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:34:28,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:34:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:34:28,920 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:34:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:29,545 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:34:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:34:29,546 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:34:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:29,546 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:34:29,546 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:34:29,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:34:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:34:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:34:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:34:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:34:29,551 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:34:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:29,551 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:34:29,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:34:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:34:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:34:29,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:29,552 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:34:29,552 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:29,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-04 21:34:29,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:29,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:34:29,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:30,167 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:34:30,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:30,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:34:30,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:34:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:34:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:34:30,168 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:34:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:30,942 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:34:30,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:34:30,946 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:34:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:30,946 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:34:30,946 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:34:30,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:34:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:34:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:34:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:34:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:34:30,949 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:34:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:30,950 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:34:30,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:34:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:34:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:34:30,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:30,950 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:34:30,951 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:30,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-04 21:34:30,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:30,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:34:30,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:31,923 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:34:31,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:31,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:34:31,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:34:31,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:34:31,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:34:31,925 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:34:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:32,640 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:34:32,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:34:32,641 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:34:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:32,642 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:34:32,642 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:34:32,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:34:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:34:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:34:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:34:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:34:32,646 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:34:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:32,646 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:34:32,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:34:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:34:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:34:32,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:32,647 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:34:32,647 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-04 21:34:32,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:32,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:34:32,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:33,369 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:34:33,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:33,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:34:33,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:34:33,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:34:33,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:34:33,372 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:34:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:34,098 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:34:34,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:34:34,099 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:34:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:34,100 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:34:34,100 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:34:34,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:34:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:34:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:34:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:34:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:34:34,104 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:34:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:34,104 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:34:34,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:34:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:34:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:34:34,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:34,105 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:34:34,105 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:34,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-04 21:34:34,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:34,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:34:34,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:35,073 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:34:35,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:35,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:34:35,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:34:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:34:35,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:34:35,075 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:34:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:35,945 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:34:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:34:35,945 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:34:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:35,946 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:34:35,946 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:34:35,947 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:34:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:34:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:34:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:34:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:34:35,950 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:34:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:35,951 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:34:35,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:34:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:34:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:34:35,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:35,951 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:34:35,952 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:35,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:35,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-04 21:34:35,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:35,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:34:35,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:36,996 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:34:36,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:36,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:34:36,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:34:36,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:34:36,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:34:36,997 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:34:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:37,826 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:34:37,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:34:37,827 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:34:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:37,827 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:34:37,827 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:34:37,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:34:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:34:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:34:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:34:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:34:37,830 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:34:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:37,831 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:34:37,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:34:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:34:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:34:37,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:37,832 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:34:37,832 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:37,832 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-04 21:34:37,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:37,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:34:37,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:38,665 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:34:38,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:38,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:34:38,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:34:38,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:34:38,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:34:38,667 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:34:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:39,536 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:34:39,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:34:39,536 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:34:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:39,537 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:34:39,537 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:34:39,538 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:34:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:34:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:34:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:34:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:34:39,540 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:34:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:39,541 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:34:39,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:34:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:34:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:34:39,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:39,541 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:34:39,542 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:39,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:39,542 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-04 21:34:39,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:39,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:34:39,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:40,447 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:34:40,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:40,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:34:40,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:34:40,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:34:40,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:34:40,449 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:34:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:41,536 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:34:41,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:34:41,537 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:34:41,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:41,537 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:34:41,537 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:34:41,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:34:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:34:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:34:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:34:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:34:41,540 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:34:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:41,541 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:34:41,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:34:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:34:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:34:41,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:41,542 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:34:41,542 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-04 21:34:41,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:41,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:34:41,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:42,609 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:34:42,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:42,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:34:42,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:34:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:34:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:34:42,611 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:34:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:43,594 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:34:43,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:34:43,595 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:34:43,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:43,596 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:34:43,596 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:34:43,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:34:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:34:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:34:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:34:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:34:43,599 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:34:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:43,599 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:34:43,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:34:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:34:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:34:43,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:43,600 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:34:43,601 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:43,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:43,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-04 21:34:43,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:43,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:34:43,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:44,688 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:34:44,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:44,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:34:44,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:34:44,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:34:44,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:34:44,691 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:34:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:45,695 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:34:45,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:34:45,695 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:34:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:45,696 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:34:45,696 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:34:45,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:34:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:34:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:34:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:34:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:34:45,699 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:34:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:45,700 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:34:45,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:34:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:34:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:34:45,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:45,701 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:34:45,701 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-04 21:34:45,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:45,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:34:45,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:46,896 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:34:46,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:46,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:34:46,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:34:46,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:34:46,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:34:46,897 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:34:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:48,037 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:34:48,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:34:48,038 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:34:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:48,039 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:34:48,039 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:34:48,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:34:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:34:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:34:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:34:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:34:48,042 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:34:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:48,042 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:34:48,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:34:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:34:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:34:48,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:48,043 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:34:48,043 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-04 21:34:48,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:48,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:34:48,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:48,985 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:34:48,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:48,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:34:48,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:34:48,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:34:48,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:34:48,987 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:34:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:50,094 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:34:50,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:34:50,094 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:34:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:50,095 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:34:50,095 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:34:50,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:34:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:34:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:34:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:34:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:34:50,098 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:34:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:50,098 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:34:50,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:34:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:34:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:34:50,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:50,099 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:34:50,099 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:50,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-04 21:34:50,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:50,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:34:50,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:52,043 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:34:52,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:52,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:34:52,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:34:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:34:52,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:34:52,045 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:34:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:53,248 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:34:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:34:53,248 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:34:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:53,249 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:34:53,249 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:34:53,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:34:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:34:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:34:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:34:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:34:53,252 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:34:53,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:53,252 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:34:53,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:34:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:34:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:34:53,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:53,253 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:34:53,253 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:53,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:53,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-04 21:34:53,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:53,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:34:53,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:54,323 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:34:54,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:54,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:34:54,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:34:54,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:34:54,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:34:54,325 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:34:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:55,563 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:34:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:34:55,564 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:34:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:55,565 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:34:55,565 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:34:55,566 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:34:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:34:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:34:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:34:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:34:55,568 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:34:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:55,568 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:34:55,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:34:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:34:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:34:55,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:55,569 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:34:55,569 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-04 21:34:55,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:55,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:34:55,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:57,028 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:34:57,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:57,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:34:57,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:34:57,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:34:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:34:57,029 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:34:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:58,305 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:34:58,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:34:58,305 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:34:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:58,306 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:34:58,306 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:34:58,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:34:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:34:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:34:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:34:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:34:58,309 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:34:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:58,310 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:34:58,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:34:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:34:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:34:58,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:58,310 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:34:58,311 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-04 21:34:58,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:58,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:34:58,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:59,467 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:34:59,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:59,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:34:59,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:34:59,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:34:59,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:34:59,469 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:35:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:00,875 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:35:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:35:00,876 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:35:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:00,876 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:35:00,876 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:35:00,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:35:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:35:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:35:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:35:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:35:00,879 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:35:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:00,879 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:35:00,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:35:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:35:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:35:00,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:00,880 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:35:00,881 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:00,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:00,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-04 21:35:00,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:00,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-04 21:35:00,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:02,246 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:35:02,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:02,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:35:02,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:35:02,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:35:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:35:02,247 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:35:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:03,638 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:35:03,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:35:03,639 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:35:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:03,639 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:35:03,640 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:35:03,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:35:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:35:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:35:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:35:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:35:03,643 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:35:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:03,643 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:35:03,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:35:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:35:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:35:03,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:03,644 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:35:03,644 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:03,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-04 21:35:03,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:03,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:35:03,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:04,959 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:35:04,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:04,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:35:04,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:35:04,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:35:04,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:35:04,960 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:35:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:06,518 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:35:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:35:06,518 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:35:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:06,519 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:35:06,519 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:35:06,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:35:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:35:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:35:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:35:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:35:06,522 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:35:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:06,522 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:35:06,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:35:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:35:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:35:06,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:06,523 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:35:06,523 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-04 21:35:06,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:06,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:35:06,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:08,052 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:35:08,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:08,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:35:08,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:35:08,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:35:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:35:08,053 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:35:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:09,626 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:35:09,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:35:09,626 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:35:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:09,627 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:35:09,627 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:35:09,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:35:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:35:09,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:35:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:35:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:35:09,629 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:35:09,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:09,629 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:35:09,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:35:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:35:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:35:09,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:09,629 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:35:09,630 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:09,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:09,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-04 21:35:09,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:09,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-04 21:35:09,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:10,945 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:35:10,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:10,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:35:10,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:35:10,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:35:10,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:35:10,946 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:35:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:12,668 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:35:12,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:35:12,668 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:35:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:12,669 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:35:12,669 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:35:12,670 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:35:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:35:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:35:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:35:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:35:12,672 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:35:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:12,673 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:35:12,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:35:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:35:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:35:12,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:12,674 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:35:12,674 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:12,674 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-04 21:35:12,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:12,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:35:12,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:14,076 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:35:14,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:14,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:35:14,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:35:14,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:35:14,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:35:14,077 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:35:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:15,751 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:35:15,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:35:15,751 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:35:15,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:15,752 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:35:15,752 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:35:15,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:35:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:35:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:35:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:35:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:35:15,756 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:35:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:15,756 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:35:15,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:35:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:35:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:35:15,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:15,757 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:35:15,757 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-04 21:35:15,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:15,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:35:15,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:17,316 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:35:17,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:17,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:35:17,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:35:17,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:35:17,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:35:17,317 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:35:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:19,092 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:35:19,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:35:19,093 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:35:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:19,094 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:35:19,094 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:35:19,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:35:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:35:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:35:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:35:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:35:19,097 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:35:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:19,097 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:35:19,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:35:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:35:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:35:19,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:19,098 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:35:19,098 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-04 21:35:19,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:19,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-04 21:35:19,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:20,652 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:35:20,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:20,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:35:20,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:35:20,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:35:20,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:35:20,654 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:35:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:22,612 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:35:22,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:35:22,612 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:35:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:22,613 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:35:22,614 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:35:22,614 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:35:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:35:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:35:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:35:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:35:22,616 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:35:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:22,616 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:35:22,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:35:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:35:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:35:22,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:22,617 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:35:22,617 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:22,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:22,618 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-04 21:35:22,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:22,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-04 21:35:22,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:24,221 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:35:24,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:24,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:35:24,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:35:24,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:35:24,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:35:24,223 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:35:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:26,120 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:35:26,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:35:26,120 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:35:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:26,121 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:35:26,121 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:35:26,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:35:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:35:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:35:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:35:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:35:26,124 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:35:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:26,124 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:35:26,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:35:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:35:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:35:26,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:26,125 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:35:26,125 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:26,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:26,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-04 21:35:26,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:26,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-04 21:35:26,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:27,903 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:35:27,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:27,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:35:27,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:35:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:35:27,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:35:27,904 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:35:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:29,925 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:35:29,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:35:29,926 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:35:29,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:29,926 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:35:29,926 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:35:29,927 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:35:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:35:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:35:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:35:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:35:29,930 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:35:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:29,930 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:35:29,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:35:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:35:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:35:29,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:29,931 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:35:29,931 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:29,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:29,931 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-04 21:35:29,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:29,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-04 21:35:29,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:31,520 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:35:31,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:31,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:35:31,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:35:31,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:35:31,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:35:31,521 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:35:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:33,715 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:35:33,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:35:33,716 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:35:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:33,717 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:35:33,717 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:35:33,718 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:35:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:35:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:35:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:35:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:35:33,720 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:35:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:33,720 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:35:33,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:35:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:35:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:35:33,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:33,721 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:35:33,721 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:33,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-04 21:35:33,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:33,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-04 21:35:33,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:35,357 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:35:35,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:35,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:35:35,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:35:35,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:35:35,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:35:35,358 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:35:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:37,712 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:35:37,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:35:37,712 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:35:37,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:37,713 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:35:37,713 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:35:37,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:35:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:35:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:35:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:35:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:35:37,716 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:35:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:37,716 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:35:37,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:35:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:35:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:35:37,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:37,717 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:35:37,717 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:37,717 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-04 21:35:37,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:37,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-04 21:35:37,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:39,436 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:35:39,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:39,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:35:39,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:35:39,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:35:39,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:35:39,437 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:35:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:41,672 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:35:41,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:35:41,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:35:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:41,674 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:35:41,674 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:35:41,674 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:35:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:35:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:35:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:35:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:35:41,677 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:35:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:41,677 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:35:41,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:35:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:35:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:35:41,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:41,678 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:35:41,678 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:41,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-04 21:35:41,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:41,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-04 21:35:41,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:43,950 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:35:43,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:43,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:35:43,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:35:43,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:35:43,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:35:43,951 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:35:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:46,209 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:35:46,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:35:46,209 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:35:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:46,210 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:35:46,210 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:35:46,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:35:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:35:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:35:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:35:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:35:46,213 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:35:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:46,213 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:35:46,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:35:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:35:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:35:46,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:46,214 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:35:46,214 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:46,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-04 21:35:46,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:46,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-04 21:35:46,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:48,270 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:35:48,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:48,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:35:48,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:35:48,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:35:48,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:35:48,271 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:35:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:50,577 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:35:50,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:35:50,578 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:35:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:50,579 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:35:50,579 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:35:50,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:35:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:35:50,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:35:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:35:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:35:50,582 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:35:50,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:50,583 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:35:50,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:35:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:35:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:35:50,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:50,583 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:35:50,583 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-04 21:35:50,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:50,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-04 21:35:50,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:52,534 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:35:52,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:52,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:35:52,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:35:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:35:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:35:52,536 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:35:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:54,993 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:35:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:35:54,994 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:35:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:54,994 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:35:54,995 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:35:54,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:35:54,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:35:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:35:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:35:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:35:54,997 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:35:54,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:54,997 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:35:54,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:35:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:35:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:35:54,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:54,998 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:35:54,998 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:54,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-04 21:35:54,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:55,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-04 21:35:55,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:57,126 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:35:57,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:57,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:35:57,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:35:57,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:35:57,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:35:57,127 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:35:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:59,821 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:35:59,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:35:59,822 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:35:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:59,823 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:35:59,823 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:35:59,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:35:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:35:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:35:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:35:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:35:59,826 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:35:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:59,826 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:35:59,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:35:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:35:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:35:59,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:59,826 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:35:59,827 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:59,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:59,827 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-04 21:35:59,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:59,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-04 21:35:59,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:03,393 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:36:03,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:03,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:36:03,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:36:03,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:36:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:36:03,395 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:36:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:06,059 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:36:06,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:36:06,059 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:36:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:06,060 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:36:06,060 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:36:06,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:36:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:36:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:36:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:36:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:36:06,063 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:36:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:06,063 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:36:06,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:36:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:36:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:36:06,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:06,064 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:36:06,064 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:06,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-04 21:36:06,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:06,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-04 21:36:06,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:08,327 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:36:08,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:08,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:36:08,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:36:08,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:36:08,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:36:08,328 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:36:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:11,003 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:36:11,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:36:11,004 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:36:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:11,005 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:36:11,005 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:36:11,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:36:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:36:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:36:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:36:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:36:11,007 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:36:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:11,008 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:36:11,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:36:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:36:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:36:11,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:11,008 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:36:11,009 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-04 21:36:11,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:11,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-04 21:36:11,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:13,533 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:36:13,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:13,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:36:13,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:36:13,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:36:13,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:36:13,534 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:36:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:16,231 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:36:16,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:36:16,232 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:36:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:16,233 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:36:16,233 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:36:16,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:36:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:36:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:36:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:36:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:36:16,236 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:36:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:16,236 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:36:16,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:36:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:36:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:36:16,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:16,237 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:36:16,237 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:16,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-04 21:36:16,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:16,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-04 21:36:16,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:18,501 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:36:18,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:18,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:36:18,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:36:18,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:36:18,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:36:18,502 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:36:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:21,317 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:36:21,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:36:21,317 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:36:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:21,318 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:36:21,318 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:36:21,319 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:36:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:36:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:36:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:36:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:36:21,321 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:36:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:21,322 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:36:21,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:36:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:36:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:36:21,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:21,323 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:36:21,323 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-04 21:36:21,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:21,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-04 21:36:21,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:23,800 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:36:23,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:23,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:36:23,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:36:23,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:36:23,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:36:23,801 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:36:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:26,759 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:36:26,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:36:26,760 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:36:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:26,761 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:36:26,761 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:36:26,761 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:36:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:36:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:36:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:36:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:36:26,762 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:36:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:26,763 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:36:26,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:36:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:36:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:36:26,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:26,764 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:36:26,764 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:26,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:26,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-04 21:36:26,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:26,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-04 21:36:26,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:29,531 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:36:29,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:29,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:36:29,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:36:29,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:36:29,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:36:29,532 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:36:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:32,617 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:36:32,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:36:32,617 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:36:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:32,618 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:36:32,618 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:36:32,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:36:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:36:32,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:36:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:36:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:36:32,621 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:36:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:32,621 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:36:32,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:36:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:36:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:36:32,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:32,622 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:36:32,622 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-04 21:36:32,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:32,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-04 21:36:32,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:35,565 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:36:35,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:35,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:36:35,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:36:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:36:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:36:35,567 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:36:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:38,841 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:36:38,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:36:38,841 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:36:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:38,842 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:36:38,842 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:36:38,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:36:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:36:38,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:36:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:36:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:36:38,845 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:36:38,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:38,845 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:36:38,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:36:38,846 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:36:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:36:38,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:38,846 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:36:38,846 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:38,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-04 21:36:38,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:38,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-04 21:36:38,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:41,358 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:36:41,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:41,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:36:41,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:36:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:36:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:36:41,359 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:36:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:44,740 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:36:44,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:36:44,741 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:36:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:44,742 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:36:44,742 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:36:44,742 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:36:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:36:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:36:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:36:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:36:44,744 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:36:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:44,745 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:36:44,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:36:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:36:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:36:44,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:44,745 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:36:44,746 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:44,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:44,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-04 21:36:44,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:44,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-04 21:36:44,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:47,247 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:36:47,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:47,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:36:47,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:36:47,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:36:47,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:36:47,248 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:36:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:50,670 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:36:50,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:36:50,671 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:36:50,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:50,672 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:36:50,672 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:36:50,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:36:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:36:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:36:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:36:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:36:50,674 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:36:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:50,675 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:36:50,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:36:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:36:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:36:50,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:50,676 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:36:50,676 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:50,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:50,676 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-04 21:36:50,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:50,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-04 21:36:50,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:53,306 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:36:53,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:53,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:36:53,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:36:53,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:36:53,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:36:53,307 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:36:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:56,878 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:36:56,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:36:56,879 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:36:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:56,880 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:36:56,880 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:36:56,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:36:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:36:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:36:56,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:36:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:36:56,883 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:36:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:56,883 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:36:56,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:36:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:36:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:36:56,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:56,884 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:36:56,884 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:56,885 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-04 21:36:56,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:57,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-04 21:36:57,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:59,949 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:36:59,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:59,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:36:59,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:36:59,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:36:59,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:36:59,951 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:37:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:03,458 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:37:03,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:37:03,459 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:37:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:03,459 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:37:03,459 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:37:03,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:37:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:37:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:37:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:37:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:37:03,463 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:37:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:03,463 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:37:03,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:37:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:37:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:37:03,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:03,464 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:37:03,464 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-04 21:37:03,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:03,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-04 21:37:03,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:06,798 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:37:06,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:06,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:37:06,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:37:06,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:37:06,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:37:06,800 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:37:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:10,765 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:37:10,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:37:10,765 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:37:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:10,766 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:37:10,766 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:37:10,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:37:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:37:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:37:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:37:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:37:10,770 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:37:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:10,770 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:37:10,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:37:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:37:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:37:10,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:10,771 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:37:10,771 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:10,772 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-04 21:37:10,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:10,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-04 21:37:10,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:13,571 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:37:13,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:13,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:37:13,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:37:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:37:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:37:13,573 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:37:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:17,459 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:37:17,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:37:17,459 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:37:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:17,460 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:37:17,460 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:37:17,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:37:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:37:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:37:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:37:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:37:17,463 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:37:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:17,464 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:37:17,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:37:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:37:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:37:17,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:17,464 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:37:17,465 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-04 21:37:17,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:17,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-04 21:37:17,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:20,690 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:37:20,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:20,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:37:20,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:37:20,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:37:20,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:37:20,691 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:37:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:24,582 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:37:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:37:24,582 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:37:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:24,583 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:37:24,583 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:37:24,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:37:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:37:24,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:37:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:37:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:37:24,585 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:37:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:24,585 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:37:24,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:37:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:37:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:37:24,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:24,585 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:37:24,586 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-04 21:37:24,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:24,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-04 21:37:24,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:27,728 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:37:27,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:27,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:37:27,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:37:27,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:37:27,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:37:27,729 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:37:31,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:31,964 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:37:31,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:37:31,964 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:37:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:31,965 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:37:31,965 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:37:31,966 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:37:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:37:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:37:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:37:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:37:31,969 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:37:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:31,969 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:37:31,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:37:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:37:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:37:31,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:31,970 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:37:31,970 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-04 21:37:31,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:32,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-04 21:37:32,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:35,277 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:37:35,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:35,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:37:35,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:37:35,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:37:35,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:37:35,278 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:37:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:39,487 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:37:39,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:37:39,488 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:37:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:39,488 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:37:39,489 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:37:39,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:37:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:37:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:37:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:37:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:37:39,491 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:37:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:39,492 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:37:39,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:37:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:37:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:37:39,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:39,492 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:37:39,493 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:39,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-04 21:37:39,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:39,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-04 21:37:39,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:42,827 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:37:42,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:42,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:37:42,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:37:42,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:37:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:37:42,829 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-04 21:37:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:47,298 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:37:47,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:37:47,298 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:37:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:47,298 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:37:47,299 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:37:47,299 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:37:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:37:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:37:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:37:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:37:47,301 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-04 21:37:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:47,301 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:37:47,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:37:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:37:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:37:47,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:47,302 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:37:47,302 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-04 21:37:47,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:47,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-04 21:37:47,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:50,852 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:37:50,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:50,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:37:50,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:37:50,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:37:50,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:37:50,853 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-04 21:37:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:55,624 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:37:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:37:55,624 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-04 21:37:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:55,625 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:37:55,625 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:37:55,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:37:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:37:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:37:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:37:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-04 21:37:55,629 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-04 21:37:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:55,629 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-04 21:37:55,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:37:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-04 21:37:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:37:55,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:55,630 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-04 21:37:55,630 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-04 21:37:55,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:55,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-04 21:37:55,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:59,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:59,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:37:59,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:37:59,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:37:59,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:37:59,061 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-04 21:38:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:03,822 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-04 21:38:03,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:38:03,822 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-04 21:38:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:03,823 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:38:03,823 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:38:03,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:38:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:38:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:38:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:38:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-04 21:38:03,827 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-04 21:38:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:03,827 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-04 21:38:03,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:38:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-04 21:38:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:38:03,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:03,828 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-04 21:38:03,828 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:03,828 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-04 21:38:03,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:03,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-04 21:38:03,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:07,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:07,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:38:07,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:38:07,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:38:07,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:38:07,541 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-04 21:38:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:12,332 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-04 21:38:12,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:38:12,333 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-04 21:38:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:12,334 INFO L225 Difference]: With dead ends: 84 [2019-08-04 21:38:12,334 INFO L226 Difference]: Without dead ends: 84 [2019-08-04 21:38:12,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:38:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-04 21:38:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-04 21:38:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:38:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-04 21:38:12,337 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-04 21:38:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:12,337 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-04 21:38:12,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:38:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-04 21:38:12,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-04 21:38:12,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:12,338 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-04 21:38:12,338 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:12,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:12,339 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-04 21:38:12,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:12,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-04 21:38:12,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:15,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:15,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:38:15,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:38:15,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:38:15,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:38:15,880 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. Received shutdown request... [2019-08-04 21:38:16,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:16,241 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:38:16,247 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:38:16,247 INFO L202 PluginConnector]: Adding new model half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:16 BoogieIcfgContainer [2019-08-04 21:38:16,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:16,250 INFO L168 Benchmark]: Toolchain (without parser) took 250685.86 ms. Allocated memory was 136.8 MB in the beginning and 302.5 MB in the end (delta: 165.7 MB). Free memory was 107.6 MB in the beginning and 150.7 MB in the end (delta: -43.0 MB). Peak memory consumption was 122.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:16,251 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 136.8 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-04 21:38:16,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.08 ms. Allocated memory is still 136.8 MB. Free memory was 107.4 MB in the beginning and 105.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:16,252 INFO L168 Benchmark]: Boogie Preprocessor took 18.96 ms. Allocated memory is still 136.8 MB. Free memory was 105.8 MB in the beginning and 104.6 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:38:16,253 INFO L168 Benchmark]: RCFGBuilder took 339.41 ms. Allocated memory is still 136.8 MB. Free memory was 104.6 MB in the beginning and 94.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:16,253 INFO L168 Benchmark]: TraceAbstraction took 250287.99 ms. Allocated memory was 136.8 MB in the beginning and 302.5 MB in the end (delta: 165.7 MB). Free memory was 94.7 MB in the beginning and 150.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 109.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:16,256 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.19 ms. Allocated memory is still 136.8 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.08 ms. Allocated memory is still 136.8 MB. Free memory was 107.4 MB in the beginning and 105.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.96 ms. Allocated memory is still 136.8 MB. Free memory was 105.8 MB in the beginning and 104.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 339.41 ms. Allocated memory is still 136.8 MB. Free memory was 104.6 MB in the beginning and 94.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250287.99 ms. Allocated memory was 136.8 MB in the beginning and 302.5 MB in the end (delta: 165.7 MB). Free memory was 94.7 MB in the beginning and 150.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 109.7 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 constructing difference of abstraction (84states) and FLOYD_HOARE automaton (currently 6 states, 83 states before enhancement),while ReachableStatesComputation was computing reachable states (4 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 250.2s OverallTime, 81 OverallIterations, 80 TraceHistogramMax, 129.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 241 SDtfs, 0 SDslu, 3240 SDs, 0 SdLazy, 180683 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3402 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 113.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=80, 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, 80 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 116.5s InterpolantComputationTime, 3483 NumberOfCodeBlocks, 3483 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 3402 ConstructedInterpolants, 0 QuantifiedInterpolants, 1630066 SizeOfPredicates, 324 NumberOfNonLiveVariables, 17982 ConjunctsInSsa, 6966 ConjunctsInUnsatCore, 81 InterpolantComputations, 1 PerfectInterpolantSequences, 0/88560 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown