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/const1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:14:45,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:14:45,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:14:45,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:14:45,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:14:45,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:14:45,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:14:45,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:14:45,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:14:45,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:14:45,466 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:14:45,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:14:45,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:14:45,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:14:45,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:14:45,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:14:45,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:14:45,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:14:45,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:14:45,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:14:45,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:14:45,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:14:45,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:14:45,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:14:45,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:14:45,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:14:45,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:14:45,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:14:45,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:14:45,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:14:45,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:14:45,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:14:45,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:14:45,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:14:45,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:14:45,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:14:45,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:14:45,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:14:45,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:14:45,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:14:45,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:14:45,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:14:45,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:14:45,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:14:45,539 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:14:45,540 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:14:45,541 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl [2019-08-05 10:14:45,541 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl' [2019-08-05 10:14:45,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:14:45,586 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:14:45,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:14:45,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:14:45,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:14:45,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/1) ... [2019-08-05 10:14:45,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/1) ... [2019-08-05 10:14:45,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:14:45,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:14:45,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:14:45,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:14:45,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/1) ... [2019-08-05 10:14:45,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/1) ... [2019-08-05 10:14:45,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/1) ... [2019-08-05 10:14:45,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/1) ... [2019-08-05 10:14:45,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/1) ... [2019-08-05 10:14:45,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/1) ... [2019-08-05 10:14:45,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/1) ... [2019-08-05 10:14:45,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:14:45,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:14:45,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:14:45,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:14:45,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:14:45,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:14:45,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:14:45,938 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:14:45,939 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:14:45,940 INFO L202 PluginConnector]: Adding new model const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:14:45 BoogieIcfgContainer [2019-08-05 10:14:45,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:14:45,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:14:45,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:14:45,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:14:45,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:45" (1/2) ... [2019-08-05 10:14:45,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455d8bf6 and model type const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:14:45, skipping insertion in model container [2019-08-05 10:14:45,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:14:45" (2/2) ... [2019-08-05 10:14:45,952 INFO L109 eAbstractionObserver]: Analyzing ICFG const1.i_3.bpl [2019-08-05 10:14:45,964 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:14:45,972 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:14:45,989 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:14:46,023 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:14:46,024 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:14:46,024 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:14:46,024 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:14:46,025 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:14:46,025 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:14:46,025 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:14:46,025 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:14:46,025 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:14:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:14:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:14:46,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:46,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:14:46,066 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:46,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:46,077 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:14:46,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:46,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:14:46,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:46,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:46,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:14:46,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:14:46,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:14:46,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:46,253 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:14:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:46,286 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:14:46,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:14:46,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:14:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:46,299 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:14:46,300 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:14:46,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:14:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:14:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:14:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:14:46,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:14:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:46,335 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:14:46,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:14:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:14:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:14:46,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:46,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:14:46,336 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:46,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:46,337 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:14:46,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:46,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:14:46,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:46,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:46,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:14:46,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:14:46,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:14:46,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:14:46,469 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:14:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:46,519 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:14:46,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:14:46,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:14:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:46,521 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:14:46,521 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:14:46,522 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-05 10:14:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:14:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:14:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:14:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:14:46,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:14:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:46,525 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:14:46,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:14:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:14:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:14:46,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:46,526 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:14:46,527 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:46,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:46,527 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:14:46,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:46,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:14:46,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:46,627 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-05 10:14:46,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:46,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:14:46,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:14:46,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:14:46,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:14:46,629 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:14:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:46,687 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:14:46,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:14:46,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:14:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:46,689 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:14:46,689 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:14:46,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:14:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:14:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:14:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:14:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:14:46,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:14:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:46,693 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:14:46,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:14:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:14:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:14:46,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:46,694 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:14:46,694 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:46,695 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:14:46,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:46,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:46,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:46,807 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-05 10:14:46,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:46,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:14:46,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:14:46,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:14:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:14:46,809 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:14:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:46,899 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:14:46,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:14:46,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:14:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:46,901 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:14:46,913 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:14:46,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:14:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:14:46,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:14:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:14:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:14:46,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:14:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:46,919 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:14:46,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:14:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:14:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:14:46,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:46,920 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:14:46,920 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:46,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:46,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:14:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:46,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:14:46,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:47,089 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-05 10:14:47,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:47,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:14:47,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:14:47,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:14:47,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:14:47,091 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:14:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:47,256 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:14:47,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:14:47,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:14:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:47,258 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:14:47,258 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:14:47,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:14:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:14:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:14:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:14:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:14:47,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:14:47,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:47,261 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:14:47,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:14:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:14:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:47,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:47,262 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:14:47,262 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:47,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:47,263 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:14:47,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:47,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:14:47,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:47,429 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-05 10:14:47,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:47,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:14:47,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:47,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:47,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:47,431 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:14:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:47,552 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:14:47,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:14:47,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:47,553 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:14:47,554 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:14:47,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:14:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:14:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:14:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:14:47,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:14:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:47,557 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:14:47,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:14:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:14:47,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:47,558 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:14:47,559 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:47,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:14:47,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:47,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:14:47,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:47,761 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-05 10:14:47,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:47,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:47,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:14:47,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:14:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:14:47,763 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:14:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:47,900 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:14:47,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:14:47,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:14:47,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:47,902 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:14:47,902 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:14:47,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:14:47,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:14:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:14:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:14:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:14:47,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:14:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:47,905 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:14:47,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:14:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:14:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:14:47,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:47,906 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:14:47,906 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:14:47,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:47,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:14:47,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:48,382 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-05 10:14:48,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:48,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:14:48,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:48,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:48,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:48,384 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:14:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:48,487 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:14:48,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:14:48,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:14:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:48,488 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:14:48,489 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:14:48,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:14:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:14:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:14:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:14:48,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:14:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:48,493 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:14:48,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:14:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:14:48,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:48,494 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:14:48,494 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:48,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:14:48,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:48,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:14:48,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:48,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:48,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:14:48,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:14:48,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:14:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:14:48,670 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:14:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:48,803 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:14:48,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:14:48,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:14:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:48,805 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:14:48,805 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:14:48,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:14:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:14:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:14:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:14:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:14:48,809 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:14:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:48,809 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:14:48,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:14:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:14:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:14:48,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:48,810 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:14:48,811 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:48,811 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:14:48,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:48,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:14:48,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:49,005 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-05 10:14:49,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:49,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:14:49,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:14:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:14:49,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:14:49,007 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:14:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:49,190 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:14:49,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:14:49,191 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:14:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:49,192 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:14:49,192 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:14:49,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:14:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:14:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:14:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:14:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:14:49,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:14:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:49,196 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:14:49,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:14:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:14:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:14:49,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:49,197 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:14:49,197 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:49,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:14:49,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:49,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:14:49,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:49,482 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-05 10:14:49,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:49,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:14:49,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:14:49,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:14:49,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:14:49,485 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:14:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:49,629 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:14:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:14:49,629 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:14:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:49,631 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:14:49,631 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:14:49,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:14:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:14:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:14:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:14:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:14:49,636 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:14:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:49,636 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:14:49,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:14:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:14:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:14:49,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:49,637 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:14:49,637 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:14:49,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:49,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:14:49,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:49,927 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-05 10:14:49,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:49,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:14:49,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:14:49,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:14:49,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:14:49,929 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:14:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:50,074 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:14:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:14:50,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:14:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:50,076 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:14:50,076 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:14:50,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:14:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:14:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:14:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:14:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:14:50,081 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:14:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:50,081 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:14:50,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:14:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:14:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:14:50,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:50,082 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:14:50,082 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:14:50,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:50,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:14:50,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:50,388 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-05 10:14:50,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:50,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:14:50,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:14:50,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:14:50,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:14:50,390 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:14:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:50,590 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:14:50,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:14:50,594 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:14:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:50,595 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:14:50,595 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:14:50,596 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-05 10:14:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:14:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:14:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:14:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:14:50,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:14:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:50,601 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:14:50,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:14:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:14:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:50,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:50,603 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:14:50,603 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:50,604 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:14:50,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:50,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:14:50,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:50,869 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-05 10:14:50,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:50,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:14:50,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:14:50,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:14:50,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:14:50,872 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:14:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:51,058 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:14:51,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:14:51,059 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:14:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:51,060 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:14:51,060 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:14:51,061 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-05 10:14:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:14:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:14:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:14:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:14:51,064 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:14:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:51,064 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:14:51,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:14:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:14:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:14:51,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:51,065 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:14:51,065 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:14:51,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:51,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:14:51,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:51,325 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-05 10:14:51,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:51,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:14:51,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:14:51,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:14:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:14:51,328 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:14:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:51,551 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:14:51,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:14:51,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:14:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:51,552 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:14:51,552 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:14:51,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:14:51,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:14:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:14:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:14:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:14:51,556 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:14:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:51,557 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:14:51,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:14:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:14:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:14:51,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:51,558 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:14:51,558 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:14:51,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:51,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:14:51,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:52,194 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-05 10:14:52,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:52,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:14:52,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:14:52,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:14:52,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:14:52,196 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:14:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:52,533 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:14:52,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:14:52,533 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:14:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:52,534 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:14:52,535 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:14:52,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:14:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:14:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:14:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:14:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:14:52,539 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:14:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:52,539 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:14:52,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:14:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:14:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:14:52,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:52,540 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:14:52,541 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:52,541 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:14:52,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:52,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:14:52,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:53,087 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-05 10:14:53,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:53,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:14:53,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:14:53,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:14:53,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:14:53,089 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:14:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:53,384 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:14:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:14:53,386 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:14:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:53,387 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:14:53,387 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:14:53,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:14:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:14:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:14:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:14:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:14:53,390 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:14:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:53,390 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:14:53,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:14:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:14:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:14:53,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:53,391 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:14:53,391 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:14:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:53,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:14:53,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:53,656 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-05 10:14:53,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:53,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:14:53,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:14:53,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:14:53,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:14:53,658 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:14:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:54,039 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:14:54,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:14:54,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:14:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:54,040 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:14:54,041 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:14:54,042 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-05 10:14:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:14:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:14:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:14:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:14:54,045 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:14:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:54,045 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:14:54,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:14:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:14:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:14:54,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:54,046 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:14:54,047 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:14:54,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:54,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:14:54,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:54,345 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-05 10:14:54,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:54,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:14:54,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:14:54,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:14:54,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:14:54,347 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:14:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:54,694 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:14:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:14:54,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:14:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:54,695 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:14:54,695 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:14:54,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:14:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:14:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:14:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:14:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:14:54,700 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:14:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:54,701 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:14:54,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:14:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:14:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:14:54,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:54,702 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:14:54,702 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:54,702 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:14:54,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:54,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:14:54,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:55,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:55,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:14:55,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:14:55,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:14:55,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:14:55,013 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:14:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:55,407 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:14:55,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:14:55,408 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:14:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:55,409 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:14:55,409 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:14:55,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:14:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:14:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:14:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:14:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:14:55,413 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:14:55,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:55,414 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:14:55,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:14:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:14:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:14:55,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:55,415 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:14:55,415 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:14:55,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:55,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:14:55,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:55,768 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-05 10:14:55,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:55,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:14:55,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:14:55,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:14:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:14:55,770 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:14:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:56,245 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:14:56,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:14:56,246 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:14:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:56,247 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:14:56,247 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:14:56,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:14:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:14:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:14:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:14:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:14:56,251 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:14:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:56,258 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:14:56,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:14:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:14:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:14:56,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:56,259 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:14:56,259 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:56,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:56,259 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:14:56,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:56,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:14:56,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:56,806 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-05 10:14:56,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:56,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:14:56,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:14:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:14:56,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:14:56,808 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:14:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:57,297 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:14:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:14:57,299 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:14:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:57,300 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:14:57,300 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:14:57,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:14:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:14:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:14:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:14:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:14:57,303 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:14:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:57,303 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:14:57,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:14:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:14:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:14:57,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:57,304 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:14:57,304 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:57,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:57,305 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:14:57,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:57,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:14:57,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:57,862 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-05 10:14:57,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:57,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:14:57,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:14:57,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:14:57,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:14:57,863 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:14:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:58,795 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:14:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:14:58,796 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:14:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:58,797 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:14:58,797 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:14:58,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:14:58,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:14:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:14:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:14:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:14:58,800 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:14:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:58,801 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:14:58,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:14:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:14:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:14:58,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:58,802 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:14:58,802 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:14:58,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:58,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:14:58,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:59,230 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-05 10:14:59,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:59,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:14:59,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:14:59,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:14:59,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:14:59,232 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:15:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:00,011 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:15:00,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:15:00,014 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:15:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:00,015 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:15:00,015 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:15:00,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:15:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:15:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:15:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:15:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:15:00,020 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:15:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:00,020 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:15:00,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:15:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:15:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:15:00,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:00,021 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:15:00,022 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:00,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:15:00,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:00,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:15:00,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:00,810 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-05 10:15:00,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:00,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:15:00,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:15:00,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:15:00,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:15:00,813 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:15:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:01,553 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:15:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:15:01,554 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:15:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:01,555 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:15:01,555 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:15:01,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:15:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:15:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:15:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:15:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:15:01,558 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:15:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:01,559 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:15:01,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:15:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:15:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:15:01,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:01,560 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:15:01,560 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:01,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:01,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:15:01,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:01,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:15:01,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:02,023 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-05 10:15:02,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:02,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:15:02,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:15:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:15:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:15:02,025 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:15:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:02,633 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:15:02,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:15:02,633 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:15:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:02,634 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:15:02,634 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:15:02,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:15:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:15:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:15:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:15:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:15:02,638 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:15:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:02,638 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:15:02,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:15:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:15:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:15:02,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:02,639 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:15:02,639 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:02,640 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:15:02,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:02,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:15:02,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:03,415 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-05 10:15:03,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:03,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:15:03,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:15:03,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:15:03,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:15:03,417 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:15:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:04,073 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:15:04,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:15:04,074 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:15:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:04,075 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:15:04,075 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:15:04,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:15:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:15:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:15:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:15:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:15:04,078 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:15:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:04,079 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:15:04,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:15:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:15:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:15:04,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:04,079 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:15:04,080 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:15:04,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:04,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:15:04,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:05,330 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-05 10:15:05,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:05,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:15:05,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:15:05,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:15:05,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:15:05,332 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:15:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:06,005 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:15:06,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:15:06,006 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:15:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:06,006 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:15:06,007 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:15:06,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:15:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:15:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:15:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:15:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:15:06,011 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:15:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:06,012 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:15:06,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:15:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:15:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:15:06,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:06,013 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:15:06,013 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:15:06,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:06,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:15:06,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:06,599 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-05 10:15:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:15:06,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:15:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:15:06,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:15:06,601 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:15:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:07,328 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:15:07,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:15:07,329 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:15:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:07,329 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:15:07,329 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:15:07,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:15:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:15:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:15:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:15:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:15:07,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:15:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:07,334 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:15:07,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:15:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:15:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:15:07,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:07,335 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:15:07,335 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:15:07,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:07,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:15:07,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:07,986 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-05 10:15:07,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:07,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:15:07,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:15:07,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:15:07,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:15:07,989 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:15:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:08,862 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:15:08,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:15:08,870 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:15:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:08,871 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:15:08,871 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:15:08,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:15:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:15:08,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:15:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:15:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:15:08,874 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:15:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:08,874 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:15:08,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:15:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:15:08,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:15:08,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:08,875 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:15:08,875 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:08,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:15:08,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:08,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:15:08,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:09,542 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-05 10:15:09,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:09,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:15:09,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:15:09,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:15:09,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:15:09,543 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:15:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:10,366 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:15:10,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:15:10,367 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:15:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:10,367 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:15:10,368 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:15:10,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:15:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:15:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:15:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:15:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:15:10,371 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:15:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:10,372 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:15:10,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:15:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:15:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:15:10,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:10,372 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:15:10,372 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:15:10,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:10,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:15:10,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:11,054 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-05 10:15:11,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:11,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:15:11,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:15:11,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:15:11,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:15:11,056 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:15:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:11,947 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:15:11,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:15:11,948 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:15:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:11,948 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:15:11,948 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:15:11,950 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-05 10:15:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:15:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:15:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:15:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:15:11,952 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:15:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:11,952 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:15:11,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:15:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:15:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:15:11,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:11,953 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:15:11,953 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:11,954 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:15:11,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:11,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:15:11,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:12,716 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-05 10:15:12,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:12,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:15:12,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:15:12,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:15:12,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:15:12,718 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:15:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:13,789 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:15:13,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:15:13,789 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:15:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:13,790 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:15:13,790 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:15:13,791 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-05 10:15:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:15:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:15:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:15:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:15:13,794 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:15:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:13,794 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:15:13,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:15:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:15:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:15:13,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:13,795 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:15:13,795 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:13,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:15:13,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:13,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:15:13,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:14,705 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-05 10:15:14,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:14,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:15:14,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:15:14,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:15:14,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:15:14,707 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:15:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:15,696 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:15:15,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:15:15,697 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:15:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:15,697 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:15:15,698 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:15:15,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:15:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:15:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:15:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:15:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:15:15,701 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:15:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:15,701 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:15:15,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:15:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:15:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:15:15,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:15,702 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:15:15,702 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:15,702 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:15:15,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:15,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:15:15,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:16,614 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-05 10:15:16,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:16,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:15:16,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:15:16,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:15:16,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:15:16,616 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:15:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:17,670 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:15:17,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:15:17,670 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:15:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:17,671 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:15:17,671 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:15:17,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:15:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:15:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:15:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:15:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:15:17,675 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:15:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:17,675 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:15:17,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:15:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:15:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:15:17,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:17,676 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:15:17,676 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:17,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:15:17,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:17,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:15:17,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:19,602 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-05 10:15:19,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:19,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:15:19,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:15:19,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:15:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:15:19,604 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:15:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:20,718 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:15:20,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:15:20,719 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:15:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:20,719 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:15:20,719 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:15:20,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:15:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:15:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:15:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:15:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:15:20,723 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:15:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:20,723 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:15:20,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:15:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:15:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:15:20,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:20,724 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:15:20,725 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:20,725 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:15:20,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:20,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:15:20,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:21,594 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-05 10:15:21,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:21,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:15:21,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:15:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:15:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:15:21,596 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:15:22,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:22,759 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:15:22,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:15:22,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:15:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:22,760 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:15:22,760 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:15:22,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:15:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:15:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:15:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:15:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:15:22,763 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:15:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:22,764 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:15:22,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:15:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:15:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:15:22,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,764 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:15:22,765 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:15:22,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:23,996 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-05 10:15:23,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:23,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:15:23,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:15:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:15:23,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:15:23,999 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:15:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:25,222 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:15:25,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:15:25,223 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:15:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:25,224 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:15:25,224 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:15:25,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:15:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:15:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:15:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:15:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:15:25,227 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:15:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:25,228 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:15:25,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:15:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:15:25,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:15:25,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:25,229 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:15:25,229 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:15:25,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:25,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:15:25,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:26,253 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-05 10:15:26,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:26,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:15:26,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:15:26,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:15:26,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:15:26,255 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:15:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:27,538 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:15:27,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:15:27,539 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:15:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:27,540 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:15:27,540 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:15:27,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:15:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:15:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:15:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:15:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:15:27,543 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:15:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:27,544 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:15:27,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:15:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:15:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:15:27,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:27,544 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:15:27,544 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:27,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:27,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:15:27,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:27,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:15:27,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:28,502 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-05 10:15:28,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:28,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:15:28,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:15:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:15:28,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:15:28,504 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:15:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:29,968 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:15:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:15:29,969 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:15:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:29,970 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:15:29,970 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:15:29,971 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-05 10:15:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:15:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:15:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:15:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:15:29,973 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:15:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:29,973 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:15:29,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:15:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:15:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:15:29,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:29,974 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:15:29,974 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:15:29,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:29,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:15:29,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:30,973 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-05 10:15:30,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:30,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:15:30,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:15:30,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:15:30,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:15:30,976 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:15:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:32,415 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:15:32,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:15:32,416 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:15:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:32,417 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:15:32,417 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:15:32,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:15:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:15:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:15:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:15:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:15:32,420 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:15:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:32,421 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:15:32,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:15:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:15:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:15:32,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:32,422 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:15:32,422 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:15:32,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:32,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:15:32,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:33,547 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-05 10:15:33,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:33,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:15:33,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:15:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:15:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:15:33,550 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:15:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:35,150 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:15:35,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:15:35,157 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:15:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:35,157 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:15:35,157 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:15:35,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:15:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:15:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:15:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:15:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:15:35,160 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:15:35,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:35,160 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:15:35,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:15:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:15:35,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:15:35,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:35,161 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:15:35,161 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:35,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:35,161 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:15:35,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:35,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:35,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:36,288 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-05 10:15:36,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:36,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:15:36,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:15:36,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:15:36,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:15:36,290 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:15:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:37,951 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:15:37,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:15:37,952 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:15:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:37,953 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:15:37,953 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:15:37,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:15:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:15:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:15:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:15:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:15:37,957 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:15:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:37,957 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:15:37,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:15:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:15:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:15:37,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:37,958 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:15:37,958 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:37,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:37,958 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:15:37,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:37,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:15:37,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:39,334 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-05 10:15:39,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:39,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:15:39,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:15:39,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:15:39,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:15:39,335 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:15:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:40,958 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:15:40,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:15:40,959 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:15:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:40,959 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:15:40,960 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:15:40,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:15:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:15:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:15:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:15:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:15:40,963 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:15:40,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:40,963 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:15:40,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:15:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:15:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:15:40,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:40,964 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:15:40,964 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:15:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:40,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:15:40,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:42,693 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-05 10:15:42,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:42,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:42,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:15:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:15:42,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:15:42,695 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:15:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:44,496 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:15:44,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:15:44,497 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:15:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:44,498 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:15:44,498 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:15:44,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:15:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:15:44,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:15:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:15:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:15:44,501 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:15:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:44,502 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:15:44,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:15:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:15:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:15:44,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:44,503 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:15:44,503 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:15:44,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:44,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:15:44,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:45,937 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-05 10:15:45,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:45,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:15:45,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:45,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:45,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:45,939 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:15:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:47,730 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:15:47,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:15:47,730 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:15:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:47,731 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:15:47,731 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:15:47,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:15:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:15:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:15:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:15:47,734 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:15:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:47,734 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:15:47,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:15:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:15:47,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:47,735 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:15:47,736 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:47,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:47,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:15:47,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:47,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:15:47,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:50,062 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-05 10:15:50,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:50,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:15:50,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:15:50,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:15:50,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:50,064 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:15:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:51,921 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:15:51,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:15:51,929 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:15:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:51,930 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:15:51,930 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:15:51,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:15:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:15:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:15:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:15:51,932 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:15:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:51,933 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:15:51,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:15:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:15:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:15:51,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:51,933 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:15:51,934 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:15:51,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:51,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:15:51,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:53,339 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-05 10:15:53,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:53,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:15:53,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:15:53,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:15:53,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:15:53,341 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:15:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:55,368 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:15:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:15:55,368 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:15:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:55,369 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:15:55,369 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:15:55,370 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-05 10:15:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:15:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:15:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:15:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:15:55,372 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:15:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:55,373 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:15:55,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:15:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:15:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:15:55,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:55,374 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:15:55,374 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:15:55,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:55,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:15:55,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:56,800 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-05 10:15:56,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:56,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:15:56,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:15:56,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:15:56,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:15:56,801 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:15:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:58,819 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:15:58,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:15:58,820 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:15:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:58,821 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:15:58,821 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:15:58,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:15:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:15:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:15:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:15:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:15:58,824 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:15:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:58,825 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:15:58,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:15:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:15:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:15:58,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:58,825 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:15:58,826 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:58,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:58,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:15:58,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:58,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:15:58,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:00,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:00,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:16:00,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:16:00,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:16:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:16:00,523 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:16:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:02,617 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:16:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:16:02,618 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:16:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:02,619 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:16:02,619 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:16:02,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:16:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:16:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:16:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:16:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:16:02,621 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:16:02,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:02,622 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:16:02,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:16:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:16:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:16:02,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:02,623 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:16:02,623 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:02,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:16:02,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:02,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:16:02,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:04,344 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-05 10:16:04,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:04,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:16:04,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:16:04,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:16:04,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:04,346 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:16:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:06,648 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:16:06,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:16:06,648 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:16:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:06,649 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:16:06,650 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:16:06,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:16:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:16:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:16:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:16:06,653 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:16:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:06,653 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:16:06,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:16:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:16:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:16:06,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:06,654 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:16:06,654 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:06,655 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:16:06,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:06,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:16:06,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:08,562 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-05 10:16:08,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:08,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:16:08,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:16:08,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:16:08,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:16:08,563 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:16:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:11,031 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:16:11,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:16:11,032 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:16:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:11,033 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:16:11,033 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:16:11,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:16:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:16:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:16:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:16:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:16:11,035 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:16:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:11,035 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:16:11,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:16:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:16:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:16:11,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:11,036 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:16:11,036 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:16:11,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:11,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:16:11,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:12,608 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-05 10:16:12,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:12,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:16:12,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:16:12,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:16:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:16:12,609 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:16:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:15,032 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:16:15,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:16:15,032 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:16:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:15,033 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:16:15,033 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:16:15,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:16:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:16:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:16:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:16:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:16:15,037 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:16:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:15,038 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:16:15,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:16:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:16:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:16:15,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:15,038 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:16:15,039 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:16:15,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:15,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:16:15,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:16,795 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-05 10:16:16,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:16,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:16:16,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:16:16,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:16:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:16:16,796 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:16:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:19,216 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:16:19,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:16:19,217 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:16:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:19,218 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:16:19,218 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:16:19,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:16:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:16:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:16:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:16:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:16:19,221 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:16:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:19,221 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:16:19,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:16:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:16:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:16:19,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:19,222 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:16:19,222 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:16:19,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:19,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:16:19,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:21,398 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-05 10:16:21,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:21,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:16:21,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:16:21,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:16:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:16:21,399 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:16:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:23,907 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:16:23,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:16:23,907 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:16:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:23,908 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:16:23,908 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:16:23,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:16:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:16:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:16:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:16:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:16:23,911 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:16:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:23,911 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:16:23,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:16:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:16:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:16:23,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:23,912 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:16:23,912 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:16:23,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:23,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:16:23,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:25,941 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-05 10:16:25,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:25,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:16:25,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:16:25,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:16:25,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:16:25,943 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:16:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:28,574 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:16:28,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:16:28,576 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:16:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:28,577 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:16:28,577 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:16:28,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:16:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:16:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:16:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:16:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:16:28,580 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:16:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:28,580 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:16:28,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:16:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:16:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:16:28,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:28,581 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:16:28,581 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:28,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:16:28,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:28,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:16:28,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:30,702 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-05 10:16:30,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:30,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:16:30,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:16:30,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:16:30,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:16:30,703 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:16:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:33,430 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:16:33,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:16:33,430 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:16:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:33,431 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:16:33,431 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:16:33,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:16:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:16:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:16:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:16:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:16:33,434 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:16:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:33,435 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:16:33,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:16:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:16:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:16:33,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:33,436 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:16:33,436 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:33,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:16:33,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:33,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:16:33,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:35,491 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-05 10:16:35,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:35,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:16:35,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:16:35,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:16:35,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:16:35,493 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:16:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:38,292 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:16:38,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:16:38,292 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:16:38,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:38,293 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:16:38,294 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:16:38,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:16:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:16:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:16:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:16:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:16:38,297 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:16:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:38,297 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:16:38,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:16:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:16:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:16:38,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:38,298 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:16:38,298 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:16:38,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:38,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:16:38,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:40,359 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-05 10:16:40,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:40,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:16:40,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:16:40,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:16:40,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:16:40,360 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:16:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:43,376 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:16:43,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:16:43,377 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:16:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:43,377 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:16:43,378 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:16:43,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:16:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:16:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:16:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:16:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:16:43,380 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:16:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:43,380 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:16:43,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:16:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:16:43,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:16:43,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:43,381 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:16:43,382 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:43,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:43,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:16:43,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:43,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:16:43,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:45,440 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-05 10:16:45,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:45,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:16:45,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:16:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:16:45,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:16:45,441 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:16:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:48,549 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:16:48,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:16:48,550 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:16:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:48,550 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:16:48,550 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:16:48,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:16:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:16:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:16:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:16:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:16:48,553 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:16:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:48,553 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:16:48,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:16:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:16:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:16:48,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:48,554 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:16:48,554 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:16:48,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:48,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:16:48,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:50,965 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-05 10:16:50,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:50,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:16:50,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:16:50,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:16:50,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:16:50,966 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:16:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:54,057 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:16:54,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:16:54,058 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:16:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:54,058 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:16:54,059 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:16:54,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:16:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:16:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:16:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:16:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:16:54,061 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:16:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:54,061 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:16:54,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:16:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:16:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:16:54,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:54,062 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:16:54,062 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:54,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:16:54,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:54,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:16:54,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:56,348 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-05 10:16:56,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:56,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:16:56,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:16:56,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:16:56,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:16:56,350 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:16:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:59,548 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:16:59,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:16:59,549 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:16:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:59,550 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:16:59,550 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:16:59,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:16:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:16:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:16:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:16:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:16:59,553 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:16:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:59,554 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:16:59,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:16:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:16:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:16:59,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:59,555 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:16:59,555 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:59,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:59,555 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:16:59,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:59,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 10:16:59,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:02,312 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-05 10:17:02,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:02,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:17:02,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:17:02,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:17:02,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:17:02,314 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:17:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:05,596 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:17:05,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:17:05,597 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:17:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:05,597 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:17:05,597 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:17:05,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:17:05,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:17:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:17:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:17:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:17:05,601 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:17:05,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:05,602 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:17:05,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:17:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:17:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:17:05,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:05,603 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:17:05,603 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:05,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:05,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:17:05,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:05,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:17:05,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:08,211 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-05 10:17:08,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:08,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:17:08,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:17:08,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:17:08,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:17:08,213 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:17:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:11,690 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:17:11,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:17:11,691 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:17:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:11,692 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:17:11,692 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:17:11,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:17:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:17:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:17:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:17:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:17:11,695 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:17:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:11,695 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:17:11,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:17:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:17:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:17:11,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:11,696 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:17:11,697 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:17:11,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:11,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:17:11,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:14,142 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-05 10:17:14,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:14,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:17:14,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:17:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:17:14,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:17:14,143 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:17:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:17,711 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:17:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:17:17,712 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:17:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:17,712 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:17:17,713 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:17:17,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:17:17,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:17:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:17:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:17:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:17:17,715 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:17:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:17,716 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:17:17,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:17:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:17:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:17:17,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:17,717 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:17:17,717 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:17,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:17,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:17:17,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:17,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:17:17,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:20,113 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-05 10:17:20,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:20,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:17:20,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:17:20,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:17:20,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:17:20,114 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:17:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:23,912 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:17:23,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:17:23,913 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:17:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:23,913 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:17:23,914 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:17:23,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:17:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:17:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:17:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:17:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:17:23,916 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:17:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:23,917 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:17:23,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:17:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:17:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:17:23,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:23,918 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:17:23,918 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:23,918 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:17:23,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:23,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:17:23,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:26,432 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-05 10:17:26,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:26,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:17:26,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:17:26,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:17:26,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:17:26,433 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:17:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:30,843 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:17:30,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:17:30,844 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:17:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:30,845 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:17:30,845 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:17:30,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:17:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:17:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:17:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:17:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:17:30,847 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:17:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:30,848 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:17:30,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:17:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:17:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:17:30,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:30,849 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:17:30,849 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:30,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:17:30,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:30,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:17:30,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:33,580 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-05 10:17:33,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:33,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:17:33,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:17:33,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:17:33,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:17:33,581 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:17:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:37,466 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:17:37,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:17:37,467 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:17:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:37,468 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:17:37,468 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:17:37,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:17:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:17:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:17:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:17:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:17:37,470 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:17:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:37,471 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:17:37,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:17:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:17:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:17:37,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:37,471 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:17:37,471 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:37,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:37,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:17:37,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:37,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 10:17:37,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:40,123 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-05 10:17:40,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:40,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:17:40,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:17:40,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:17:40,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:17:40,125 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:17:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:44,120 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:17:44,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:17:44,120 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:17:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:44,121 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:17:44,121 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:17:44,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:17:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:17:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:17:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:17:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:17:44,124 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:17:44,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:44,124 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:17:44,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:17:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:17:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:17:44,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:44,125 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:17:44,126 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:17:44,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:44,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:17:44,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:46,784 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-05 10:17:46,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:46,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:17:46,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:17:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:17:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:17:46,786 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:17:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:50,939 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:17:50,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:17:50,939 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:17:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:50,940 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:17:50,940 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:17:50,941 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-05 10:17:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:17:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:17:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:17:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:17:50,944 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:17:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:50,944 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:17:50,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:17:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:17:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:17:50,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:50,945 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:17:50,945 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:50,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:50,945 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:17:50,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:50,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:17:50,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:54,141 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-05 10:17:54,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:54,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:17:54,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:17:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:17:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:17:54,143 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:17:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:58,324 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:17:58,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:17:58,324 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:17:58,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:58,325 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:17:58,325 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:17:58,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:17:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:17:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:17:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:17:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:17:58,328 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:17:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:58,328 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:17:58,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:17:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:17:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:17:58,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:58,329 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:17:58,329 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:58,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:58,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:17:58,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:58,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:17:58,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:01,441 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-05 10:18:01,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:01,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:18:01,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:18:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:18:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:18:01,442 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:18:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:05,835 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:18:05,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:18:05,835 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:18:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:05,837 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:18:05,837 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:18:05,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:18:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:18:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:18:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:18:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:18:05,840 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:18:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:05,840 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:18:05,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:18:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:18:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:18:05,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:05,841 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:18:05,841 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:05,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:05,841 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:18:05,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:05,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:18:05,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:09,077 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-05 10:18:09,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:09,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:18:09,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:18:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:18:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:18:09,079 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:18:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:13,624 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:18:13,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:18:13,625 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:18:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:13,625 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:18:13,626 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:18:13,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:18:13,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:18:13,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:18:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:18:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:18:13,628 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:18:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:13,629 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:18:13,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:18:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:18:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:18:13,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:13,629 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:18:13,630 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:13,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:18:13,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:13,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:18:13,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:16,660 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-05 10:18:16,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:16,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:18:16,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:18:16,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:18:16,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:18:16,662 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:18:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:21,154 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:18:21,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:18:21,155 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:18:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:21,156 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:18:21,156 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:18:21,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:18:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:18:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:18:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:18:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:18:21,159 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:18:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:21,159 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:18:21,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:18:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:18:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:18:21,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:21,160 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:18:21,160 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:21,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:21,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:18:21,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:21,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 10:18:21,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:24,412 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-05 10:18:24,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:24,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:18:24,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:18:24,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:18:24,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:18:24,413 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:18:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:29,016 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:18:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:18:29,016 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:18:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:29,017 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:18:29,017 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:18:29,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:18:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:18:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:18:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:18:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:18:29,020 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:18:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:29,020 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:18:29,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:18:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:18:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:18:29,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:29,021 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:18:29,021 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:29,022 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:18:29,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:29,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:18:29,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:34,734 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-05 10:18:34,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:34,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:18:34,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:18:34,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:18:34,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:18:34,735 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:18:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:39,527 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:18:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:18:39,528 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:18:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:39,528 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:18:39,528 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:18:39,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:18:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:18:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:18:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:18:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:18:39,531 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:18:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:39,531 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:18:39,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:18:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:18:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:18:39,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:39,532 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:18:39,532 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:39,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:39,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:18:39,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:39,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:18:39,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:42,737 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-05 10:18:42,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:42,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:18:42,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:18:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:18:42,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:18:42,739 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:18:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:47,623 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:18:47,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:18:47,623 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:18:47,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:47,624 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:18:47,624 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:18:47,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:18:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:18:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:18:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:18:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:18:47,628 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:18:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:47,628 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:18:47,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:18:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:18:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:18:47,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:47,629 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:18:47,629 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:47,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:47,629 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:18:47,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:47,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 10:18:47,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:51,076 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-05 10:18:51,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:51,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:18:51,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:18:51,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:18:51,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:18:51,077 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:18:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:56,265 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:18:56,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:18:56,265 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:18:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:56,266 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:18:56,266 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:18:56,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:18:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:18:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:18:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:18:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:18:56,269 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:18:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:56,270 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:18:56,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:18:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:18:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:18:56,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:56,271 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:18:56,271 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:56,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:18:56,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:56,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:18:56,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:18:57,016 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:18:57,016 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:18:57,020 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:18:57,020 INFO L202 PluginConnector]: Adding new model const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:18:57 BoogieIcfgContainer [2019-08-05 10:18:57,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:18:57,022 INFO L168 Benchmark]: Toolchain (without parser) took 251436.50 ms. Allocated memory was 134.2 MB in the beginning and 182.5 MB in the end (delta: 48.2 MB). Free memory was 110.6 MB in the beginning and 33.7 MB in the end (delta: 76.9 MB). Peak memory consumption was 125.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:57,023 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:18:57,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.06 ms. Allocated memory is still 134.2 MB. Free memory was 110.3 MB in the beginning and 108.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:57,024 INFO L168 Benchmark]: Boogie Preprocessor took 17.34 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:57,025 INFO L168 Benchmark]: RCFGBuilder took 301.65 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 98.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:57,026 INFO L168 Benchmark]: TraceAbstraction took 251075.30 ms. Allocated memory was 134.2 MB in the beginning and 182.5 MB in the end (delta: 48.2 MB). Free memory was 98.2 MB in the beginning and 33.7 MB in the end (delta: 64.5 MB). Peak memory consumption was 112.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:57,028 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.21 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.06 ms. Allocated memory is still 134.2 MB. Free memory was 110.3 MB in the beginning and 108.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 17.34 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 301.65 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 98.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251075.30 ms. Allocated memory was 134.2 MB in the beginning and 182.5 MB in the end (delta: 48.2 MB). Free memory was 98.2 MB in the beginning and 33.7 MB in the end (delta: 64.5 MB). Peak memory consumption was 112.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 78,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 35 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 251.0s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 140.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 0 SDslu, 3081 SDs, 0 SdLazy, 167401 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3159 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3081 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 106.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 107.8s InterpolantComputationTime, 3237 NumberOfCodeBlocks, 3237 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 3159 ConstructedInterpolants, 0 QuantifiedInterpolants, 496119 SizeOfPredicates, 78 NumberOfNonLiveVariables, 16107 ConjunctsInSsa, 6240 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