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/cggmp2005_variant.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:29:36,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:29:36,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:29:36,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:29:36,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:29:36,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:29:36,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:29:36,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:29:36,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:29:36,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:29:36,547 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:29:36,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:29:36,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:29:36,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:29:36,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:29:36,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:29:36,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:29:36,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:29:36,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:29:36,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:29:36,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:29:36,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:29:36,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:29:36,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:29:36,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:29:36,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:29:36,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:29:36,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:29:36,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:29:36,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:29:36,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:29:36,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:29:36,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:29:36,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:29:36,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:29:36,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:29:36,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:29:36,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:29:36,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:29:36,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:29:36,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:29:36,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:29:36,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:29:36,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:29:36,657 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:29:36,658 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:29:36,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005_variant.c.i_3.bpl [2019-08-04 21:29:36,659 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005_variant.c.i_3.bpl' [2019-08-04 21:29:36,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:29:36,702 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:29:36,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:29:36,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:29:36,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:29:36,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (1/1) ... [2019-08-04 21:29:36,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (1/1) ... [2019-08-04 21:29:36,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:29:36,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:29:36,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:29:36,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:29:36,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (1/1) ... [2019-08-04 21:29:36,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (1/1) ... [2019-08-04 21:29:36,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (1/1) ... [2019-08-04 21:29:36,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (1/1) ... [2019-08-04 21:29:36,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (1/1) ... [2019-08-04 21:29:36,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (1/1) ... [2019-08-04 21:29:36,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (1/1) ... [2019-08-04 21:29:36,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:29:36,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:29:36,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:29:36,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:29:36,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (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:29:36,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:29:36,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:29:37,019 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:29:37,019 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:29:37,020 INFO L202 PluginConnector]: Adding new model cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:29:37 BoogieIcfgContainer [2019-08-04 21:29:37,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:29:37,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:29:37,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:29:37,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:29:37,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:29:36" (1/2) ... [2019-08-04 21:29:37,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3893a8 and model type cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:29:37, skipping insertion in model container [2019-08-04 21:29:37,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:29:37" (2/2) ... [2019-08-04 21:29:37,028 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant.c.i_3.bpl [2019-08-04 21:29:37,038 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:29:37,045 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:29:37,062 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:29:37,088 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:29:37,089 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:29:37,089 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:29:37,089 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:29:37,089 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:29:37,090 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:29:37,090 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:29:37,090 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:29:37,090 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:29:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:29:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:29:37,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:37,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:29:37,114 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:29:37,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:37,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:29:37,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:37,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:29:37,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:29:37,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:29:37,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:29:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:29:37,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:29:37,279 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:29:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:37,322 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:29:37,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:29:37,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:29:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:37,335 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:29:37,335 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:29:37,337 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:29:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:29:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:29:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:29:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:29:37,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:29:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:37,366 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:29:37,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:29:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:29:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:29:37,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:37,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:29:37,368 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:37,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:37,368 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:29:37,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:37,391 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:29:37,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:37,529 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-04 21:29:37,636 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:29:37,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:37,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:29:37,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:29:37,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:29:37,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:29:37,639 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:29:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:37,684 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:29:37,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:29:37,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:29:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:37,686 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:29:37,686 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:29:37,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:29:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:29:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:29:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:29:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:29:37,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:29:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:37,689 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:29:37,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:29:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:29:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:29:37,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:37,690 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:29:37,691 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:37,691 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:29:37,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:37,712 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:29:37,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:37,851 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:29:37,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:37,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:29:37,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:29:37,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:29:37,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:29:37,853 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:29:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:37,907 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:29:37,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:29:37,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:29:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:37,908 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:29:37,908 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:29:37,909 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:29:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:29:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:29:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:29:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:29:37,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:29:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:37,914 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:29:37,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:29:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:29:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:29:37,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:37,915 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:29:37,916 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:29:37,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:37,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:29:37,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:38,231 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:29:38,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:38,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:29:38,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:29:38,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:29:38,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:29:38,233 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:29:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:38,410 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:29:38,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:29:38,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:29:38,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:38,411 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:29:38,411 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:29:38,412 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:29:38,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:29:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:29:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:29:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:29:38,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:29:38,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:38,414 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:29:38,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:29:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:29:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:29:38,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:38,415 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:29:38,416 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:38,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:38,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:29:38,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:38,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:29:38,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:38,663 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:29:38,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:38,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:29:38,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:29:38,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:29:38,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:29:38,665 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:29:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:38,828 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:29:38,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:29:38,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:29:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:38,829 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:29:38,830 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:29:38,830 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:29:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:29:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:29:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:29:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:29:38,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:29:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:38,834 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:29:38,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:29:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:29:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:29:38,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:38,835 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:29:38,836 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:29:38,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:38,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:29:38,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:39,122 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:29:39,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:39,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:29:39,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:29:39,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:29:39,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:29:39,125 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:29:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:39,212 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:29:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:29:39,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:29:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:39,214 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:29:39,214 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:29:39,214 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:29:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:29:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:29:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:29:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:29:39,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:29:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:39,217 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:29:39,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:29:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:29:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:29:39,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:39,218 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:29:39,218 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:29:39,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:39,243 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:29:39,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:39,733 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:29:39,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:39,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:29:39,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:29:39,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:29:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:29:39,735 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:29:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:39,821 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:29:39,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:29:39,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:29:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:39,823 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:29:39,823 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:29:39,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:29:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:29:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:29:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:29:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:29:39,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:29:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:39,828 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:29:39,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:29:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:29:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:29:39,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:39,829 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:29:39,829 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:29:39,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:39,851 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:29:39,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:40,147 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:29:40,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:40,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:29:40,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:29:40,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:29:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:29:40,149 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:29:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:40,244 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:29:40,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:29:40,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:29:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:40,245 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:29:40,246 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:29:40,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:29:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:29:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:29:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:29:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:29:40,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:29:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:40,250 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:29:40,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:29:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:29:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:29:40,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:40,251 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:29:40,257 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:40,258 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:29:40,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:40,280 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:29:40,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:40,579 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:29:40,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:40,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:29:40,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:29:40,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:29:40,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:29:40,580 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:29:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:40,701 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:29:40,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:29:40,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:29:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:40,702 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:29:40,702 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:29:40,703 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:29:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:29:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:29:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:29:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:29:40,706 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:29:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:40,706 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:29:40,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:29:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:29:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:29:40,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:40,707 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:29:40,708 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:40,708 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-04 21:29:40,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:40,730 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:29:40,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:41,060 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:29:41,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:41,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:29:41,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:29:41,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:29:41,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:29:41,062 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:29:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:41,201 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:29:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:29:41,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:29:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:41,202 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:29:41,202 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:29:41,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:29:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:29:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:29:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:29:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:29:41,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:29:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:41,207 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:29:41,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:29:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:29:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:29:41,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:41,208 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:29:41,208 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-04 21:29:41,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:41,230 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:29:41,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:41,577 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:29:41,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:41,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:29:41,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:29:41,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:29:41,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:29:41,579 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:29:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:41,715 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:29:41,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:29:41,721 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:29:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:41,722 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:29:41,722 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:29:41,723 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:29:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:29:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:29:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:29:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:29:41,725 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:29:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:41,726 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:29:41,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:29:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:29:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:29:41,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:41,727 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:29:41,727 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:41,727 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-04 21:29:41,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:41,760 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:29:41,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:42,356 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:29:42,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:42,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:29:42,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:29:42,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:29:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:29:42,358 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:29:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:42,503 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:29:42,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:29:42,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:29:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:42,505 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:29:42,505 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:29:42,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:29:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:29:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:29:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:29:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:29:42,509 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:29:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:42,510 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:29:42,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:29:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:29:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:29:42,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:42,511 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:29:42,511 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-04 21:29:42,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:42,531 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:29:42,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:42,813 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:29:42,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:42,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:29:42,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:29:42,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:29:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:29:42,815 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:29:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:43,005 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:29:43,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:29:43,011 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:29:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:43,012 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:29:43,012 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:29:43,013 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:29:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:29:43,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:29:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:29:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:29:43,017 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:29:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:43,018 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:29:43,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:29:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:29:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:29:43,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:43,019 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:29:43,019 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:43,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-04 21:29:43,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:43,057 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:29:43,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:43,364 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:29:43,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:29:43,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:29:43,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:29:43,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:29:43,366 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:29:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:43,572 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:29:43,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:29:43,573 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:29:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:43,574 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:29:43,574 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:29:43,574 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:29:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:29:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:29:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:29:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:29:43,578 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:29:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:43,578 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:29:43,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:29:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:29:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:29:43,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:43,592 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:29:43,592 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-04 21:29:43,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:43,613 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:29:43,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:44,097 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:29:44,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:29:44,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:29:44,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:29:44,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:29:44,098 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:29:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:44,479 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:29:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:29:44,479 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:29:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:44,480 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:29:44,480 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:29:44,480 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:29:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:29:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:29:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:29:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:29:44,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:29:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:44,483 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:29:44,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:29:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:29:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:29:44,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:44,484 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:29:44,484 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:44,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-04 21:29:44,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:44,506 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:29:44,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:44,827 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:29:44,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:44,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:29:44,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:29:44,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:29:44,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:29:44,828 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:29:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:45,080 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:29:45,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:29:45,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:29:45,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:45,082 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:29:45,082 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:29:45,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:29:45,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:29:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:29:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:29:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:29:45,086 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:29:45,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:45,086 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:29:45,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:29:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:29:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:29:45,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:45,087 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:29:45,087 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-04 21:29:45,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:45,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:29:45,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:45,426 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:29:45,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:45,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:29:45,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:29:45,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:29:45,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:29:45,427 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:29:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:45,703 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:29:45,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:29:45,705 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:29:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:45,706 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:29:45,706 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:29:45,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:29:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:29:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:29:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:29:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:29:45,709 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:29:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:45,710 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:29:45,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:29:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:29:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:29:45,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:45,711 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:29:45,711 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:45,711 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-04 21:29:45,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:45,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:29:45,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:46,030 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:29:46,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:46,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:29:46,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:29:46,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:29:46,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:29:46,032 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:29:46,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:46,427 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:29:46,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:29:46,428 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:29:46,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:46,429 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:29:46,429 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:29:46,430 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:29:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:29:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:29:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:29:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:29:46,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:29:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:46,434 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:29:46,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:29:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:29:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:29:46,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:46,435 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:29:46,435 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:46,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-04 21:29:46,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:46,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-04 21:29:46,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:46,989 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:29:46,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:46,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:29:46,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:29:46,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:29:46,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:29:46,990 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:29:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:47,323 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:29:47,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:29:47,325 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:29:47,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:47,325 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:29:47,326 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:29:47,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:29:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:29:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:29:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:29:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:29:47,329 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:29:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:47,330 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:29:47,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:29:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:29:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:29:47,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:47,331 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:29:47,331 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:47,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-04 21:29:47,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:47,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-04 21:29:47,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:47,786 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:29:47,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:47,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:29:47,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:29:47,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:29:47,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:29:47,788 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:29:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:48,143 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:29:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:29:48,144 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:29:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:48,144 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:29:48,144 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:29:48,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:29:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:29:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:29:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:29:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:29:48,157 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:29:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:48,157 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:29:48,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:29:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:29:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:29:48,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:48,158 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:29:48,158 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:48,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-04 21:29:48,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:48,183 WARN L254 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-04 21:29:48,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:48,865 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:29:48,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:48,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:29:48,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:29:48,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:29:48,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:29:48,867 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:29:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:49,381 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:29:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:29:49,382 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:29:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:49,383 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:29:49,383 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:29:49,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:29:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:29:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:29:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:29:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:29:49,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:29:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:49,387 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:29:49,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:29:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:29:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:29:49,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:49,388 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:29:49,388 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:49,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-04 21:29:49,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:49,413 WARN L254 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-04 21:29:49,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:50,117 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:29:50,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:50,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:29:50,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:29:50,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:29:50,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:29:50,118 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:29:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:50,637 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:29:50,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:29:50,640 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:29:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:50,641 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:29:50,641 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:29:50,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:29:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:29:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:29:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:29:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:29:50,647 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:29:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:50,647 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:29:50,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:29:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:29:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:29:50,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:50,648 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:29:50,648 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-04 21:29:50,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:50,672 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-04 21:29:50,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:51,100 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:29:51,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:51,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:29:51,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:29:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:29:51,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:29:51,102 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:29:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:51,953 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:29:51,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:29:51,955 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:29:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:51,956 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:29:51,956 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:29:51,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:29:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:29:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:29:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:29:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:29:51,959 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:29:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:51,959 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:29:51,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:29:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:29:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:29:51,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:51,960 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:29:51,961 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-04 21:29:51,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:51,984 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-04 21:29:51,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:53,124 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:29:53,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:53,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:29:53,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:29:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:29:53,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:29:53,126 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:29:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:54,392 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:29:54,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:29:54,392 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:29:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:54,393 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:29:54,393 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:29:54,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:29:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:29:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:29:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:29:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:29:54,396 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:29:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:54,397 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:29:54,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:29:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:29:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:29:54,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:54,398 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:29:54,398 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:54,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:54,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-04 21:29:54,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:54,424 WARN L254 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-04 21:29:54,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:56,003 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:29:56,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:56,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:29:56,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:29:56,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:29:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:29:56,005 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:29:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:56,566 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:29:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:29:56,567 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:29:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:56,568 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:29:56,568 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:29:56,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:29:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:29:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:29:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:29:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:29:56,572 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:29:56,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:56,572 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:29:56,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:29:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:29:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:29:56,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:56,573 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:29:56,573 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:56,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:56,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-04 21:29:56,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:56,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-04 21:29:56,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:57,344 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:29:57,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:57,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:29:57,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:29:57,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:29:57,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:29:57,346 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:29:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:57,968 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:29:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:29:57,969 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:29:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:57,969 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:29:57,970 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:29:57,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:29:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:29:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:29:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:29:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:29:57,973 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:29:57,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:57,973 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:29:57,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:29:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:29:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:29:57,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:57,974 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:29:57,974 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:57,975 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-04 21:29:57,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:58,001 WARN L254 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-04 21:29:58,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:58,655 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:29:58,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:58,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:29:58,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:29:58,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:29:58,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:29:58,657 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:29:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:59,351 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:29:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:29:59,352 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:29:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:59,352 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:29:59,352 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:29:59,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:29:59,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:29:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:29:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:29:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:29:59,355 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:29:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:59,356 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:29:59,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:29:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:29:59,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:29:59,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:59,357 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:29:59,357 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:59,357 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-04 21:29:59,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:59,384 WARN L254 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-04 21:29:59,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:59,963 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:29:59,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:59,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:29:59,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:29:59,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:29:59,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:29:59,965 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:30:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:00,678 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:30:00,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:30:00,678 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:30:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:00,679 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:30:00,679 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:30:00,680 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:30:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:30:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:30:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:30:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:30:00,683 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:30:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:00,684 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:30:00,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:30:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:30:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:30:00,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:00,685 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:30:00,685 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-04 21:30:00,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:00,714 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-04 21:30:00,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:01,341 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:30:01,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:01,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:30:01,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:30:01,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:30:01,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:30:01,343 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:30:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:02,097 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:30:02,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:30:02,098 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:30:02,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:02,098 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:30:02,099 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:30:02,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:30:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:30:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:30:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:30:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:30:02,103 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:30:02,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:02,103 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:30:02,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:30:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:30:02,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:30:02,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:02,104 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:30:02,104 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:02,105 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-04 21:30:02,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:02,134 WARN L254 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-04 21:30:02,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:02,879 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:30:02,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:02,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:30:02,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:30:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:30:02,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:30:02,880 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:30:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:03,629 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:30:03,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:30:03,630 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:30:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:03,630 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:30:03,631 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:30:03,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:30:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:30:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:30:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:30:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:30:03,635 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:30:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:03,635 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:30:03,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:30:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:30:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:30:03,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:03,636 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:30:03,636 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:03,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-04 21:30:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:03,671 WARN L254 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-04 21:30:03,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:04,514 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:30:04,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:04,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:30:04,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:30:04,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:30:04,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:30:04,516 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:30:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:05,354 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:30:05,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:30:05,355 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:30:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:05,355 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:30:05,355 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:30:05,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:30:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:30:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:30:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:30:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:30:05,359 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:30:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:05,360 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:30:05,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:30:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:30:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:30:05,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:05,360 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:30:05,361 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-04 21:30:05,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:05,387 WARN L254 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-04 21:30:05,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:06,107 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:30:06,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:06,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:30:06,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:30:06,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:30:06,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:30:06,109 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:30:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:06,965 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:30:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:30:06,966 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:30:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:06,966 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:30:06,966 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:30:06,967 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:30:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:30:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:30:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:30:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:30:06,971 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:30:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:06,971 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:30:06,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:30:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:30:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:30:06,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:06,972 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:30:06,972 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:06,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:06,973 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-04 21:30:06,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:07,009 WARN L254 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-04 21:30:07,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:07,767 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:30:07,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:07,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:30:07,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:30:07,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:30:07,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:30:07,769 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:30:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:08,692 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:30:08,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:30:08,693 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:30:08,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:08,693 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:30:08,693 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:30:08,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:30:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:30:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:30:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:30:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:30:08,698 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:30:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:08,698 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:30:08,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:30:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:30:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:30:08,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:08,699 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:30:08,699 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:08,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-04 21:30:08,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:08,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-04 21:30:08,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:09,751 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:30:09,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:09,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:30:09,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:30:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:30:09,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:30:09,752 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:30:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:10,723 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:30:10,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:30:10,724 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:30:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:10,725 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:30:10,725 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:30:10,726 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:30:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:30:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:30:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:30:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:30:10,728 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:30:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:10,728 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:30:10,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:30:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:30:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:30:10,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:10,729 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:30:10,729 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:10,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-04 21:30:10,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:10,776 WARN L254 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-04 21:30:10,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:11,589 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:30:11,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:11,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:30:11,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:30:11,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:30:11,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:30:11,590 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:30:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:12,596 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:30:12,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:30:12,596 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:30:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:12,597 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:30:12,597 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:30:12,598 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:30:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:30:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:30:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:30:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:30:12,601 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:30:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:12,602 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:30:12,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:30:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:30:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:30:12,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:12,602 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:30:12,603 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-04 21:30:12,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:12,644 WARN L254 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-04 21:30:12,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:13,550 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:30:13,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:13,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:30:13,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:30:13,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:30:13,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:30:13,552 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:30:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:14,685 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:30:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:30:14,685 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:30:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:14,686 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:30:14,686 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:30:14,686 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:30:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:30:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:30:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:30:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:30:14,688 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:30:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:14,688 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:30:14,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:30:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:30:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:30:14,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:14,689 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:30:14,689 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:14,690 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-04 21:30:14,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:14,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-04 21:30:14,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:15,707 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:30:15,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:15,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:30:15,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:30:15,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:30:15,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:30:15,708 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:30:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:16,830 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:30:16,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:30:16,832 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:30:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:16,832 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:30:16,833 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:30:16,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:30:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:30:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:30:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:30:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:30:16,835 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:30:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:16,835 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:30:16,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:30:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:30:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:30:16,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:16,836 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:30:16,836 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:16,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-04 21:30:16,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:16,872 WARN L254 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 231 conjunts are in the unsatisfiable core [2019-08-04 21:30:16,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:17,889 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:30:17,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:17,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:30:17,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:30:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:30:17,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:30:17,891 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:30:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:19,087 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:30:19,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:30:19,087 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:30:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:19,088 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:30:19,088 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:30:19,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:30:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:30:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:30:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:30:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:30:19,092 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:30:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:19,092 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:30:19,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:30:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:30:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:30:19,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:19,093 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:30:19,093 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-04 21:30:19,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:19,142 WARN L254 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-04 21:30:19,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:20,422 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:30:20,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:20,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:30:20,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:30:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:30:20,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:30:20,424 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:30:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:21,680 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:30:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:30:21,681 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:30:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:21,682 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:30:21,682 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:30:21,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:30:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:30:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:30:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:30:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:30:21,685 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:30:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:21,685 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:30:21,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:30:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:30:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:30:21,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:21,686 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:30:21,686 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-04 21:30:21,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:21,723 WARN L254 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 243 conjunts are in the unsatisfiable core [2019-08-04 21:30:21,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:22,702 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:30:22,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:22,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:30:22,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:30:22,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:30:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:30:22,703 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:30:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:24,046 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:30:24,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:30:24,046 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:30:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:24,047 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:30:24,047 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:30:24,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:30:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:30:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:30:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:30:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:30:24,050 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:30:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:24,051 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:30:24,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:30:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:30:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:30:24,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:24,051 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:30:24,052 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:24,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:24,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-04 21:30:24,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:24,105 WARN L254 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-04 21:30:24,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:25,366 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:30:25,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:25,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:30:25,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:30:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:30:25,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:30:25,368 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:30:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:26,759 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:30:26,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:30:26,759 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:30:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:26,760 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:30:26,760 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:30:26,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:30:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:30:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:30:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:30:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:30:26,763 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:30:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:26,764 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:30:26,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:30:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:30:26,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:30:26,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:26,764 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:30:26,764 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:26,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-04 21:30:26,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:26,819 WARN L254 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 255 conjunts are in the unsatisfiable core [2019-08-04 21:30:26,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:28,052 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:30:28,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:28,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:30:28,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:30:28,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:30:28,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:30:28,054 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:30:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:29,507 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:30:29,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:30:29,508 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:30:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:29,509 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:30:29,509 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:30:29,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:30:29,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:30:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:30:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:30:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:30:29,512 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:30:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:29,512 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:30:29,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:30:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:30:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:30:29,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:29,513 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:30:29,513 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-04 21:30:29,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:29,563 WARN L254 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-04 21:30:29,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:31,037 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:30:31,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:31,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:30:31,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:30:31,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:30:31,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:30:31,039 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:30:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:32,553 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:30:32,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:30:32,553 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:30:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:32,554 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:30:32,554 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:30:32,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:30:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:30:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:30:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:30:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:30:32,558 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:30:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:32,558 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:30:32,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:30:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:30:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:30:32,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:32,559 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:30:32,559 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:32,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:32,559 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-04 21:30:32,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:32,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-04 21:30:32,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:34,102 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:30:34,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:34,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:30:34,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:30:34,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:30:34,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:30:34,104 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:30:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:35,808 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:30:35,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:30:35,809 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:30:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:35,810 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:30:35,810 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:30:35,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:30:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:30:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:30:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:30:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:30:35,813 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:30:35,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:35,813 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:30:35,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:30:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:30:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:30:35,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:35,814 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:30:35,814 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:35,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:35,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-04 21:30:35,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:35,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-04 21:30:35,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:37,060 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:30:37,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:37,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:30:37,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:30:37,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:30:37,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:30:37,061 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:30:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:38,718 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:30:38,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:30:38,719 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:30:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:38,720 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:30:38,720 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:30:38,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:30:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:30:38,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:30:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:30:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:30:38,722 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:30:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:38,723 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:30:38,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:30:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:30:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:30:38,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:38,724 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:30:38,724 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-04 21:30:38,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:38,788 WARN L254 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 279 conjunts are in the unsatisfiable core [2019-08-04 21:30:38,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:40,230 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:30:40,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:40,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:30:40,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:30:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:30:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:30:40,231 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:30:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:42,030 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:30:42,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:30:42,031 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:30:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:42,031 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:30:42,031 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:30:42,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:30:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:30:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:30:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:30:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:30:42,034 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:30:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:42,034 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:30:42,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:30:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:30:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:30:42,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:42,035 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:30:42,035 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-04 21:30:42,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:42,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-04 21:30:42,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:43,926 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:30:43,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:43,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:30:43,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:30:43,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:30:43,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:30:43,927 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:30:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:45,799 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:30:45,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:30:45,800 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:30:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:45,801 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:30:45,801 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:30:45,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:30:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:30:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:30:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:30:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:30:45,804 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:30:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:45,804 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:30:45,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:30:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:30:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:30:45,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:45,805 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:30:45,805 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:45,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:45,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-04 21:30:45,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:45,870 WARN L254 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 291 conjunts are in the unsatisfiable core [2019-08-04 21:30:45,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:47,226 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:30:47,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:47,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:30:47,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:30:47,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:30:47,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:30:47,228 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:30:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:49,104 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:30:49,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:30:49,105 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:30:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:49,106 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:30:49,106 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:30:49,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:30:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:30:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:30:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:30:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:30:49,109 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:30:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:49,109 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:30:49,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:30:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:30:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:30:49,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:49,110 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:30:49,110 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:49,111 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-04 21:30:49,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:49,180 WARN L254 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-04 21:30:49,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:50,763 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:30:50,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:50,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:30:50,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:30:50,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:30:50,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:30:50,764 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:30:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:52,739 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:30:52,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:30:52,740 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:30:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:52,741 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:30:52,741 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:30:52,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:30:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:30:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:30:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:30:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:30:52,744 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:30:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:52,745 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:30:52,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:30:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:30:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:30:52,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:52,745 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:30:52,746 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:52,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-04 21:30:52,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:52,821 WARN L254 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 303 conjunts are in the unsatisfiable core [2019-08-04 21:30:52,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:54,260 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:30:54,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:54,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:30:54,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:30:54,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:30:54,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:30:54,262 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:30:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:56,372 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:30:56,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:30:56,372 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:30:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:56,373 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:30:56,373 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:30:56,374 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:30:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:30:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:30:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:30:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:30:56,377 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:30:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:56,377 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:30:56,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:30:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:30:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:30:56,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:56,378 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:30:56,378 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:56,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:56,379 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-04 21:30:56,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:56,457 WARN L254 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 309 conjunts are in the unsatisfiable core [2019-08-04 21:30:56,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:58,039 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:30:58,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:58,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:30:58,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:30:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:30:58,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:30:58,041 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:31:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:00,168 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:31:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:31:00,169 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:31:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:00,170 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:31:00,170 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:31:00,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:31:00,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:31:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:31:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:31:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:31:00,173 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:31:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:00,173 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:31:00,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:31:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:31:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:31:00,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:00,173 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:31:00,174 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-04 21:31:00,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:00,253 WARN L254 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 315 conjunts are in the unsatisfiable core [2019-08-04 21:31:00,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:02,023 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:31:02,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:02,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:31:02,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:31:02,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:31:02,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:31:02,025 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:31:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:04,267 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:31:04,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:31:04,267 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:31:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:04,268 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:31:04,268 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:31:04,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:31:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:31:04,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:31:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:31:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:31:04,271 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:31:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:04,272 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:31:04,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:31:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:31:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:31:04,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:04,272 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:31:04,273 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:04,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:04,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-04 21:31:04,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:04,330 WARN L254 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 321 conjunts are in the unsatisfiable core [2019-08-04 21:31:04,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:06,181 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:31:06,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:06,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:31:06,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:31:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:31:06,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:31:06,182 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:31:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:08,493 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:31:08,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:31:08,494 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:31:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:08,495 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:31:08,495 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:31:08,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:31:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:31:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:31:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:31:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:31:08,499 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:31:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:08,499 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:31:08,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:31:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:31:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:31:08,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:08,500 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:31:08,500 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-04 21:31:08,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:08,584 WARN L254 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 327 conjunts are in the unsatisfiable core [2019-08-04 21:31:08,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:10,296 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:31:10,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:10,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:31:10,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:31:10,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:31:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:31:10,297 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:31:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:12,790 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:31:12,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:31:12,791 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:31:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:12,792 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:31:12,792 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:31:12,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:31:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:31:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:31:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:31:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:31:12,794 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:31:12,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:12,795 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:31:12,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:31:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:31:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:31:12,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:12,795 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:31:12,795 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-04 21:31:12,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:12,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 333 conjunts are in the unsatisfiable core [2019-08-04 21:31:12,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:14,585 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:31:14,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:14,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:31:14,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:31:14,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:31:14,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:31:14,586 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:31:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:17,174 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:31:17,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:31:17,174 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:31:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:17,175 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:31:17,175 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:31:17,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:31:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:31:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:31:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:31:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:31:17,178 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:31:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:17,178 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:31:17,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:31:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:31:17,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:31:17,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:17,178 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:31:17,179 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:17,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-04 21:31:17,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:17,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 339 conjunts are in the unsatisfiable core [2019-08-04 21:31:17,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:18,990 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:31:18,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:18,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:31:18,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:31:18,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:31:18,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:31:18,991 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:31:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:21,661 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:31:21,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:31:21,662 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:31:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:21,663 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:31:21,663 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:31:21,664 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:31:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:31:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:31:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:31:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:31:21,666 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:31:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:21,667 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:31:21,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:31:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:31:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:31:21,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:21,668 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:31:21,668 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-04 21:31:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:21,743 WARN L254 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 345 conjunts are in the unsatisfiable core [2019-08-04 21:31:21,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:23,535 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:31:23,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:23,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:31:23,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:31:23,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:31:23,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:31:23,536 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:31:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:26,267 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:31:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:31:26,268 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:31:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:26,269 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:31:26,269 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:31:26,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:31:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:31:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:31:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:31:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:31:26,272 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:31:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:26,273 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:31:26,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:31:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:31:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:31:26,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:26,273 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:31:26,274 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:26,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-04 21:31:26,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:26,352 WARN L254 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 351 conjunts are in the unsatisfiable core [2019-08-04 21:31:26,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:28,222 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:31:28,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:28,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:31:28,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:31:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:31:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:31:28,223 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:31:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:30,964 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:31:30,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:31:30,964 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:31:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:30,965 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:31:30,965 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:31:30,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:31:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:31:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:31:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:31:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:31:30,968 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:31:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:30,969 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:31:30,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:31:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:31:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:31:30,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:30,969 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:31:30,970 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-04 21:31:30,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:31,046 WARN L254 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 357 conjunts are in the unsatisfiable core [2019-08-04 21:31:31,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:33,259 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:31:33,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:33,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:31:33,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:31:33,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:31:33,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:31:33,260 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:31:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:36,072 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:31:36,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:31:36,072 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:31:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:36,073 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:31:36,073 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:31:36,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:31:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:31:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:31:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:31:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:31:36,076 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:31:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:36,076 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:31:36,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:31:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:31:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:31:36,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:36,077 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:31:36,077 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-04 21:31:36,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:36,154 WARN L254 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 363 conjunts are in the unsatisfiable core [2019-08-04 21:31:36,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:38,359 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:31:38,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:38,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:31:38,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:31:38,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:31:38,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:31:38,360 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:31:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:41,297 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:31:41,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:31:41,298 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:31:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:41,298 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:31:41,299 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:31:41,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:31:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:31:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:31:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:31:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:31:41,301 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:31:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:41,302 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:31:41,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:31:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:31:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:31:41,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:41,302 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:31:41,303 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-04 21:31:41,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:41,386 WARN L254 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 369 conjunts are in the unsatisfiable core [2019-08-04 21:31:41,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:43,694 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:31:43,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:43,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:31:43,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:31:43,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:31:43,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:31:43,696 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:31:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:46,871 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:31:46,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:31:46,871 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:31:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:46,871 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:31:46,871 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:31:46,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:31:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:31:46,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:31:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:31:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:31:46,873 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:31:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:46,873 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:31:46,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:31:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:31:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:31:46,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:46,874 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:31:46,875 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:46,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-04 21:31:46,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:46,951 WARN L254 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 375 conjunts are in the unsatisfiable core [2019-08-04 21:31:46,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:49,088 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:31:49,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:49,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:31:49,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:31:49,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:31:49,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:31:49,089 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:31:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:52,357 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:31:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:31:52,358 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:31:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:52,359 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:31:52,359 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:31:52,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:31:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:31:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:31:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:31:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:31:52,362 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:31:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:52,362 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:31:52,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:31:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:31:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:31:52,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:52,364 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:31:52,364 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:52,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:52,364 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-04 21:31:52,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:52,456 WARN L254 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 381 conjunts are in the unsatisfiable core [2019-08-04 21:31:52,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:54,605 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:31:54,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:54,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:31:54,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:31:54,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:31:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:31:54,607 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:31:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:57,941 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:31:57,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:31:57,941 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:31:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:57,942 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:31:57,942 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:31:57,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:31:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:31:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:31:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:31:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:31:57,945 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:31:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:57,948 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:31:57,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:31:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:31:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:31:57,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:57,949 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:31:57,949 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:57,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-04 21:31:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:58,042 WARN L254 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 387 conjunts are in the unsatisfiable core [2019-08-04 21:31:58,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:00,236 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:32:00,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:00,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:32:00,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:32:00,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:32:00,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:32:00,237 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:32:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:03,680 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:32:03,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:32:03,680 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:32:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:03,681 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:32:03,681 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:32:03,682 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:32:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:32:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:32:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:32:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:32:03,684 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:32:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:03,684 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:32:03,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:32:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:32:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:32:03,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:03,685 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:32:03,685 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:03,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-04 21:32:03,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:03,800 WARN L254 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 393 conjunts are in the unsatisfiable core [2019-08-04 21:32:03,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:07,688 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:32:07,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:07,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:32:07,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:32:07,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:32:07,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:32:07,689 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:32:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:11,104 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:32:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:32:11,105 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:32:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:11,106 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:32:11,106 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:32:11,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:32:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:32:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:32:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:32:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:32:11,109 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:32:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:11,109 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:32:11,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:32:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:32:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:32:11,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:11,110 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:32:11,110 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:11,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:11,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-04 21:32:11,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:11,208 WARN L254 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 399 conjunts are in the unsatisfiable core [2019-08-04 21:32:11,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:13,897 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:32:13,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:13,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:32:13,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:32:13,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:32:13,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:32:13,899 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:32:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:17,462 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:32:17,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:32:17,462 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:32:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:17,462 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:32:17,462 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:32:17,463 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:32:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:32:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:32:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:32:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:32:17,464 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:32:17,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:17,464 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:32:17,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:32:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:32:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:32:17,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:17,465 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:32:17,465 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-04 21:32:17,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:17,561 WARN L254 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 405 conjunts are in the unsatisfiable core [2019-08-04 21:32:17,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:20,584 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:32:20,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:20,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:32:20,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:32:20,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:32:20,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:32:20,585 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:32:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:24,307 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:32:24,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:32:24,308 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:32:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:24,308 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:32:24,308 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:32:24,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:32:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:32:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:32:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:32:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:32:24,313 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:32:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:24,313 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:32:24,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:32:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:32:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:32:24,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:24,313 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:32:24,314 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:24,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-04 21:32:24,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:24,420 WARN L254 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 411 conjunts are in the unsatisfiable core [2019-08-04 21:32:24,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:26,917 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:32:26,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:26,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:32:26,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:32:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:32:26,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:32:26,919 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:32:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:30,821 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:32:30,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:32:30,822 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:32:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:30,822 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:32:30,823 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:32:30,823 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:32:30,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:32:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:32:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:32:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:32:30,826 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:32:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:30,826 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:32:30,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:32:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:32:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:32:30,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:30,827 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:32:30,827 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:30,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-04 21:32:30,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:30,935 WARN L254 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 417 conjunts are in the unsatisfiable core [2019-08-04 21:32:30,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:33,772 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:32:33,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:33,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:32:33,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:32:33,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:32:33,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:32:33,773 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:32:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:37,602 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:32:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:32:37,603 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:32:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:37,604 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:32:37,604 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:32:37,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:32:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:32:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:32:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:32:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:32:37,607 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:32:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:37,607 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:32:37,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:32:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:32:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:32:37,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:37,608 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:32:37,609 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:37,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:37,609 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-04 21:32:37,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:37,728 WARN L254 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 423 conjunts are in the unsatisfiable core [2019-08-04 21:32:37,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:40,402 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:32:40,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:40,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:32:40,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:32:40,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:32:40,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:32:40,404 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:32:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:44,472 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:32:44,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:32:44,473 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:32:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:44,474 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:32:44,474 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:32:44,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:32:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:32:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:32:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:32:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:32:44,477 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:32:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:44,477 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:32:44,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:32:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:32:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:32:44,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:44,478 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:32:44,478 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:44,479 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-04 21:32:44,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:44,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 429 conjunts are in the unsatisfiable core [2019-08-04 21:32:44,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:47,414 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:32:47,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:47,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:32:47,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:32:47,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:32:47,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:32:47,416 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:32:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:51,615 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:32:51,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:32:51,616 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:32:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:51,617 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:32:51,617 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:32:51,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:32:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:32:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:32:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:32:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:32:51,620 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:32:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:51,621 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:32:51,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:32:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:32:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:32:51,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:51,622 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:32:51,622 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:51,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-04 21:32:51,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:51,827 WARN L254 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 435 conjunts are in the unsatisfiable core [2019-08-04 21:32:51,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:55,103 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:32:55,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:55,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:32:55,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:32:55,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:32:55,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:32:55,105 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:32:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:59,484 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:32:59,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:32:59,485 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:32:59,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:59,486 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:32:59,486 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:32:59,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:32:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:32:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:32:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:32:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:32:59,489 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:32:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:59,490 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:32:59,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:32:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:32:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:32:59,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:59,491 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:32:59,491 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:59,491 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-04 21:32:59,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:59,645 WARN L254 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 441 conjunts are in the unsatisfiable core [2019-08-04 21:32:59,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:02,607 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:33:02,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:02,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:33:02,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:33:02,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:33:02,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:33:02,608 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:33:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:07,076 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:33:07,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:33:07,077 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:33:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:07,078 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:33:07,078 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:33:07,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:33:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:33:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:33:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:33:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:33:07,081 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:33:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:07,081 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:33:07,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:33:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:33:07,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:33:07,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:07,082 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:33:07,082 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:07,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-04 21:33:07,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:07,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 447 conjunts are in the unsatisfiable core [2019-08-04 21:33:07,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:10,349 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:33:10,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:10,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:33:10,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:33:10,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:33:10,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:33:10,351 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:33:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:14,883 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:33:14,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:33:14,884 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:33:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:14,885 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:33:14,885 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:33:14,885 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:33:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:33:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:33:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:33:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:33:14,888 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:33:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:14,888 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:33:14,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:33:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:33:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:33:14,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:14,889 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:33:14,889 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:14,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:14,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-04 21:33:14,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:15,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 453 conjunts are in the unsatisfiable core [2019-08-04 21:33:15,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:20,088 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:33:20,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:20,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:33:20,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:33:20,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:33:20,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:33:20,089 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:33:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:24,700 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:33:24,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:33:24,700 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:33:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:24,701 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:33:24,701 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:33:24,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:33:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:33:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:33:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:33:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:33:24,704 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:33:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:24,704 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:33:24,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:33:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:33:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:33:24,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:24,705 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:33:24,705 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-04 21:33:24,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:24,846 WARN L254 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 459 conjunts are in the unsatisfiable core [2019-08-04 21:33:24,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:27,881 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:33:27,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:27,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:33:27,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:33:27,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:33:27,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:33:27,882 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:33:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:32,630 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:33:32,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:33:32,631 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:33:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:32,632 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:33:32,632 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:33:32,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:33:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:33:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:33:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:33:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:33:32,634 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:33:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:32,634 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:33:32,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:33:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:33:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:33:32,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:32,635 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:33:32,635 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:32,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:32,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-04 21:33:32,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:32,804 WARN L254 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 465 conjunts are in the unsatisfiable core [2019-08-04 21:33:32,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:33,777 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-04 21:33:36,187 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:33:36,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:36,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:33:36,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:33:36,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:33:36,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:33:36,188 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-04 21:33:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:33:41,018 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:33:41,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:33:41,018 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:33:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:33:41,019 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:33:41,019 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:33:41,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:33:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:33:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:33:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:33:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:33:41,022 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-04 21:33:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:33:41,023 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:33:41,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:33:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:33:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:33:41,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:33:41,023 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:33:41,023 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:33:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:33:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-04 21:33:41,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:33:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:33:41,155 WARN L254 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 471 conjunts are in the unsatisfiable core [2019-08-04 21:33:41,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:33:44,323 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:33:44,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:33:44,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:33:44,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:33:44,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:33:44,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:33:44,324 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. Received shutdown request... [2019-08-04 21:33:47,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:33:47,650 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:33:47,657 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:33:47,658 INFO L202 PluginConnector]: Adding new model cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:33:47 BoogieIcfgContainer [2019-08-04 21:33:47,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:33:47,660 INFO L168 Benchmark]: Toolchain (without parser) took 250959.84 ms. Allocated memory was 135.3 MB in the beginning and 401.1 MB in the end (delta: 265.8 MB). Free memory was 112.8 MB in the beginning and 122.5 MB in the end (delta: -9.6 MB). Peak memory consumption was 256.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:33:47,661 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 114.1 MB in the beginning and 113.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:33:47,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.22 ms. Allocated memory is still 135.3 MB. Free memory was 112.6 MB in the beginning and 111.0 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:33:47,662 INFO L168 Benchmark]: Boogie Preprocessor took 20.68 ms. Allocated memory is still 135.3 MB. Free memory was 111.0 MB in the beginning and 109.9 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:33:47,662 INFO L168 Benchmark]: RCFGBuilder took 257.82 ms. Allocated memory is still 135.3 MB. Free memory was 109.9 MB in the beginning and 100.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:33:47,663 INFO L168 Benchmark]: TraceAbstraction took 250636.08 ms. Allocated memory was 135.3 MB in the beginning and 401.1 MB in the end (delta: 265.8 MB). Free memory was 100.7 MB in the beginning and 122.5 MB in the end (delta: -21.7 MB). Peak memory consumption was 244.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:33:47,666 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 114.1 MB in the beginning and 113.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.22 ms. Allocated memory is still 135.3 MB. Free memory was 112.6 MB in the beginning and 111.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.68 ms. Allocated memory is still 135.3 MB. Free memory was 111.0 MB in the beginning and 109.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 257.82 ms. Allocated memory is still 135.3 MB. Free memory was 109.9 MB in the beginning and 100.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250636.08 ms. Allocated memory was 135.3 MB in the beginning and 401.1 MB in the end (delta: 265.8 MB). Free memory was 100.7 MB in the beginning and 122.5 MB in the end (delta: -21.7 MB). Peak memory consumption was 244.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 43). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and FLOYD_HOARE automaton (currently 50 states, 80 states before enhancement),while ReachableStatesComputation was computing reachable states (48 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 250.5s OverallTime, 78 OverallIterations, 77 TraceHistogramMax, 135.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 0 SDslu, 3003 SDs, 0 SdLazy, 164904 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3159 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3081 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 107.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=77, 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.1s AutomataMinimizationTime, 77 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 109.9s InterpolantComputationTime, 3237 NumberOfCodeBlocks, 3237 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 3159 ConstructedInterpolants, 77 QuantifiedInterpolants, 1835920 SizeOfPredicates, 385 NumberOfNonLiveVariables, 22581 ConjunctsInSsa, 18713 ConjunctsInUnsatCore, 78 InterpolantComputations, 1 PerfectInterpolantSequences, 0/79079 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown