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/20181015-LoopsPathprograms/diamond_false-unreach-call1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:26:38,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:26:38,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:26:38,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:26:38,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:26:38,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:26:38,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:26:38,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:26:38,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:26:38,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:26:38,459 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:26:38,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:26:38,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:26:38,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:26:38,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:26:38,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:26:38,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:26:38,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:26:38,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:26:38,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:26:38,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:26:38,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:26:38,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:26:38,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:26:38,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:26:38,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:26:38,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:26:38,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:26:38,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:26:38,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:26:38,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:26:38,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:26:38,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:26:38,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:26:38,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:26:38,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:26:38,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:26:38,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:26:38,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:26:38,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:26:38,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:26:38,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:26:38,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:26:38,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:26:38,538 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:26:38,539 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:26:38,540 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_false-unreach-call1.i_3.bpl [2019-08-05 10:26:38,541 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_false-unreach-call1.i_3.bpl' [2019-08-05 10:26:38,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:26:38,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:26:38,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:38,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:26:38,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:26:38,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (1/1) ... [2019-08-05 10:26:38,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (1/1) ... [2019-08-05 10:26:38,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:38,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:26:38,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:26:38,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:26:38,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (1/1) ... [2019-08-05 10:26:38,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (1/1) ... [2019-08-05 10:26:38,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (1/1) ... [2019-08-05 10:26:38,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (1/1) ... [2019-08-05 10:26:38,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (1/1) ... [2019-08-05 10:26:38,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (1/1) ... [2019-08-05 10:26:38,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (1/1) ... [2019-08-05 10:26:38,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:26:38,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:26:38,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:26:38,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:26:38,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (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:26:38,763 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:26:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:26:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:26:38,974 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:26:38,974 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:26:38,975 INFO L202 PluginConnector]: Adding new model diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:38 BoogieIcfgContainer [2019-08-05 10:26:38,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:26:38,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:26:38,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:26:38,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:26:38,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:38" (1/2) ... [2019-08-05 10:26:38,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6faf8b and model type diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:26:38, skipping insertion in model container [2019-08-05 10:26:38,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:38" (2/2) ... [2019-08-05 10:26:38,984 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call1.i_3.bpl [2019-08-05 10:26:38,998 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:26:39,005 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:26:39,020 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:26:39,046 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:26:39,047 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:26:39,047 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:26:39,047 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:26:39,047 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:26:39,047 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:26:39,048 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:26:39,048 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:26:39,048 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:26:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:26:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:26:39,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:39,071 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:26:39,073 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:26:39,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:39,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:26:39,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:39,231 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:26:39,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:26:39,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:26:39,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:26:39,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:26:39,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:26:39,254 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:26:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:39,288 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:26:39,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:26:39,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:26:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:39,301 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:26:39,301 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:26:39,303 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:26:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:26:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:26:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:26:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:26:39,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:26:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:39,334 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:26:39,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:26:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:26:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:26:39,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:39,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:26:39,336 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:39,336 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:26:39,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:39,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:26:39,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:39,522 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:26:39,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:39,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:26:39,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:26:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:26:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:39,526 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:26:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:39,638 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:26:39,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:26:39,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:26:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:39,640 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:26:39,640 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:26:39,641 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:26:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:26:39,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:26:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:26:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:26:39,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:26:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:39,644 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:26:39,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:26:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:26:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:26:39,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:39,645 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:26:39,645 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:26:39,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:39,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:26:39,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:39,828 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:26:39,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:39,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:26:39,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:26:39,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:26:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:39,830 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:26:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:39,909 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:26:39,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:26:39,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:26:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:39,911 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:26:39,911 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:26:39,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:26:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:26:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:26:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:26:39,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:26:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:39,914 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:26:39,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:26:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:26:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:26:39,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:39,915 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:26:39,916 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:39,916 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:26:39,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:39,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:26:39,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:40,044 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:26:40,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:40,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:26:40,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:26:40,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:26:40,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:40,046 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:26:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:40,161 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:26:40,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:26:40,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:26:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:40,162 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:26:40,163 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:26:40,164 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:26:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:26:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:26:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:26:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:26:40,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:26:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:40,167 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:26:40,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:26:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:26:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:26:40,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:40,168 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:26:40,168 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:40,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:26:40,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:40,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:26:40,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:40,371 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:26:40,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:40,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:26:40,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:26:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:26:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:40,374 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:26:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:40,547 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:26:40,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:26:40,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:26:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:40,550 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:26:40,551 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:26:40,551 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:26:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:26:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:26:40,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:26:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:26:40,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:26:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:40,553 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:26:40,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:26:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:26:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:26:40,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:40,555 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:26:40,555 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:26:40,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:40,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:26:40,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:40,839 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:26:40,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:40,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:26:40,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:26:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:26:40,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:40,841 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:26:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:41,012 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:26:41,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:26:41,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:26:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:41,013 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:26:41,014 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:26:41,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:26:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:26:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:26:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:26:41,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:26:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:41,019 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:26:41,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:26:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:26:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:26:41,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:41,019 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:26:41,020 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:41,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:26:41,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:41,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:26:41,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:41,142 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:26:41,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:41,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:26:41,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:26:41,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:26:41,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:41,144 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:26:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:41,245 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:26:41,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:26:41,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:26:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:41,247 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:26:41,247 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:26:41,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:26:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:26:41,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:26:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:26:41,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:26:41,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:41,250 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:26:41,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:26:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:26:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:26:41,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:41,251 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:26:41,251 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:41,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:41,252 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:26:41,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:41,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:26:41,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:41,868 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:26:41,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:41,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:26:41,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:26:41,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:26:41,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:41,870 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:26:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:42,084 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:26:42,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:26:42,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:26:42,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:42,085 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:26:42,085 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:26:42,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:26:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:26:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:26:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:26:42,088 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:26:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:42,089 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:26:42,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:26:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:26:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:26:42,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:42,090 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:26:42,090 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:26:42,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:42,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:26:42,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:42,289 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:26:42,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:42,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:26:42,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:26:42,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:26:42,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:42,291 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:26:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:42,420 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:26:42,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:26:42,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:26:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:42,422 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:26:42,422 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:26:42,423 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:26:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:26:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:26:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:26:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:26:42,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:26:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:42,426 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:26:42,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:26:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:26:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:26:42,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:42,427 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:26:42,427 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:26:42,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:42,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:26:42,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:42,750 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:26:42,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:42,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:26:42,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:26:42,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:26:42,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:42,752 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:26:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:42,902 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:26:42,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:26:42,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:26:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:42,904 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:26:42,904 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:26:42,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:26:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:26:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:26:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:26:42,907 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:26:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:42,907 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:26:42,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:26:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:26:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:26:42,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:42,908 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:26:42,908 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:42,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:26:42,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:42,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:26:42,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:43,290 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:26:43,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:43,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:26:43,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:26:43,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:26:43,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:26:43,292 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:26:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:43,481 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:26:43,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:26:43,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:26:43,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:43,483 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:26:43,483 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:26:43,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:26:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:26:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:26:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:26:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:26:43,487 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:26:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:43,487 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:26:43,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:26:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:26:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:26:43,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:43,488 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:26:43,489 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:26:43,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:43,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:26:43,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:43,892 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:26:43,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:43,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:26:43,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:26:43,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:26:43,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:26:43,894 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:26:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:44,067 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:26:44,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:26:44,072 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:26:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:44,073 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:26:44,074 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:26:44,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:26:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:26:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:26:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:26:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:26:44,077 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:26:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:44,077 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:26:44,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:26:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:26:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:26:44,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:44,078 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:26:44,079 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:44,079 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:26:44,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:44,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:26:44,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:44,303 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:26:44,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:44,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:26:44,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:26:44,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:26:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:26:44,305 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:26:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:44,587 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:26:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:26:44,593 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:26:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:44,594 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:26:44,594 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:26:44,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:26:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:26:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:26:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:26:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:26:44,598 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:26:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:44,598 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:26:44,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:26:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:26:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:26:44,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:44,599 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:26:44,600 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:26:44,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:44,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:26:44,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:44,875 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:26:44,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:44,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:26:44,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:26:44,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:26:44,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:26:44,876 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:26:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:45,094 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:26:45,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:26:45,095 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:26:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:45,095 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:26:45,096 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:26:45,096 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:26:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:26:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:26:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:26:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:26:45,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:26:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:45,100 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:26:45,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:26:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:26:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:26:45,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:45,101 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:26:45,101 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:45,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:45,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:26:45,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:45,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:26:45,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:45,291 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:26:45,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:45,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:26:45,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:26:45,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:26:45,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:26:45,293 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:26:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:45,524 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:26:45,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:26:45,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:26:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:45,525 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:26:45,526 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:26:45,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:26:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:26:45,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:26:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:26:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:26:45,530 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:26:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:45,530 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:26:45,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:26:45,530 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:26:45,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:26:45,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:45,531 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:26:45,531 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:26:45,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:45,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:26:45,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:45,983 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:26:45,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:45,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:26:45,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:26:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:26:45,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:45,985 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:26:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:46,564 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:26:46,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:26:46,565 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:26:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:46,566 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:26:46,566 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:26:46,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:26:46,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:26:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:26:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:26:46,572 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:26:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:46,572 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:26:46,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:26:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:26:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:26:46,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:46,573 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:26:46,573 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:46,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:46,574 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:26:46,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:46,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:26:46,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:47,203 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:26:47,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:47,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:26:47,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:26:47,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:26:47,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:26:47,205 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:26:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:47,490 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:26:47,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:26:47,491 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:26:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:47,492 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:26:47,492 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:26:47,493 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:26:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:26:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:26:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:26:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:26:47,496 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:26:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:47,496 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:26:47,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:26:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:26:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:26:47,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:47,497 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:26:47,497 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:47,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:47,498 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:26:47,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:47,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:26:47,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:47,721 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:26:47,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:47,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:26:47,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:26:47,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:26:47,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:26:47,723 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:26:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:48,136 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:26:48,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:26:48,137 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:26:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:48,138 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:26:48,138 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:26:48,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:26:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:26:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:26:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:26:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:26:48,142 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:26:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:48,142 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:26:48,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:26:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:26:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:26:48,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:48,143 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:26:48,143 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:48,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:26:48,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:48,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:26:48,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:48,417 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:26:48,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:48,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:26:48,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:26:48,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:26:48,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:26:48,419 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:26:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:48,791 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:26:48,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:26:48,791 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:26:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:48,792 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:26:48,792 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:26:48,793 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:26:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:26:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:26:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:26:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:26:48,798 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:26:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:48,798 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:26:48,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:26:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:26:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:26:48,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:48,799 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:26:48,799 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:48,800 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:26:48,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:48,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:26:48,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:49,530 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:26:49,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:49,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:26:49,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:26:49,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:26:49,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:26:49,532 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:26:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:50,013 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:26:50,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:26:50,013 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:26:50,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:50,014 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:26:50,014 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:26:50,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:26:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:26:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:26:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:26:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:26:50,018 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:26:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:50,019 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:26:50,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:26:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:26:50,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:26:50,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:50,020 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:26:50,020 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:50,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:50,020 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:26:50,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:50,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:26:50,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:50,286 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:26:50,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:50,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:26:50,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:26:50,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:26:50,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:26:50,288 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:26:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:50,733 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:26:50,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:26:50,733 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:26:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:50,734 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:26:50,735 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:26:50,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:26:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:26:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:26:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:26:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:26:50,738 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:26:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:50,738 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:26:50,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:26:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:26:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:26:50,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:50,739 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:26:50,740 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:50,740 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:26:50,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:50,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:26:50,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:51,026 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:26:51,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:51,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:26:51,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:26:51,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:26:51,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:26:51,028 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:26:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:51,562 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:26:51,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:26:51,564 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:26:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:51,565 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:26:51,565 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:26:51,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:26:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:26:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:26:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:26:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:26:51,568 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:26:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:51,568 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:26:51,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:26:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:26:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:26:51,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:51,569 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:26:51,569 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:26:51,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:51,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:26:51,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:52,141 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:26:52,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:52,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:26:52,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:26:52,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:26:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:26:52,143 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:26:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:53,052 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:26:53,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:26:53,054 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:26:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:53,055 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:26:53,056 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:26:53,056 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:26:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:26:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:26:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:26:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:26:53,059 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:26:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:53,060 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:26:53,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:26:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:26:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:26:53,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:53,061 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:26:53,061 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:26:53,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:53,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:26:53,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:53,392 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:26:53,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:53,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:26:53,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:26:53,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:26:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:26:53,394 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:26:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:54,101 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:26:54,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:26:54,102 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:26:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:54,103 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:26:54,103 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:26:54,104 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:26:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:26:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:26:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:26:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:26:54,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:26:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:54,107 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:26:54,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:26:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:26:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:26:54,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:54,109 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:26:54,109 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:54,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:54,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:26:54,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:54,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:26:54,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:55,367 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:26:55,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:55,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:26:55,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:26:55,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:26:55,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:26:55,369 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:26:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:56,015 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:26:56,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:26:56,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:26:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:56,016 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:26:56,017 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:26:56,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:26:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:26:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:26:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:26:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:26:56,020 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:26:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:56,021 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:26:56,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:26:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:26:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:26:56,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:56,022 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:26:56,022 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:56,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:26:56,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:56,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:26:56,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:56,354 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:26:56,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:56,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:26:56,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:26:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:26:56,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:26:56,356 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:26:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:56,973 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:26:56,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:26:56,973 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:26:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:56,974 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:26:56,974 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:26:56,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:26:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:26:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:26:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:26:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:26:56,978 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:26:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:56,978 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:26:56,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:26:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:26:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:26:56,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:56,979 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:26:56,979 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:26:56,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:56,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:26:56,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:58,243 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:26:58,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:58,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:26:58,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:26:58,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:26:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:26:58,245 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:26:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:58,909 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:26:58,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:26:58,910 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:26:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:58,910 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:26:58,911 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:26:58,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:26:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:26:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:26:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:26:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:26:58,914 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:26:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:58,915 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:26:58,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:26:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:26:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:26:58,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:58,916 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:26:58,916 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:26:58,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:58,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:26:58,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:59,348 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:26:59,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:59,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:26:59,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:26:59,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:26:59,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:26:59,349 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:27:00,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:00,115 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:27:00,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:27:00,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:27:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:00,116 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:27:00,116 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:27:00,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:27:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:27:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:27:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:27:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:27:00,120 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:27:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:00,121 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:27:00,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:27:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:27:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:27:00,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:00,122 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:27:00,122 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:27:00,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:00,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:27:00,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:00,736 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:27:00,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:00,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:27:00,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:27:00,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:27:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:27:00,738 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:27:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:01,503 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:27:01,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:27:01,503 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:27:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:01,504 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:27:01,504 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:27:01,505 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:27:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:27:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:27:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:27:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:27:01,508 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:27:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:01,508 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:27:01,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:27:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:27:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:27:01,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:01,510 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:27:01,510 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:27:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:01,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:27:01,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:01,966 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:27:01,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:01,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:27:01,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:27:01,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:27:01,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:27:01,968 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:27:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:02,794 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:27:02,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:27:02,794 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:27:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:02,795 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:27:02,795 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:27:02,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:27:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:27:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:27:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:27:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:27:02,799 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:27:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:02,799 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:27:02,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:27:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:27:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:27:02,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:02,800 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:27:02,801 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:02,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:27:02,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:02,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:27:02,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:03,293 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:27:03,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:03,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:27:03,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:27:03,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:27:03,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:27:03,294 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:27:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:04,132 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:27:04,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:27:04,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:27:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:04,133 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:27:04,134 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:27:04,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:27:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:27:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:27:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:27:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:27:04,136 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:27:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:04,136 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:27:04,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:27:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:27:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:27:04,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:04,137 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:27:04,137 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:04,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:04,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:27:04,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:04,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:27:04,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:04,667 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:27:04,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:04,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:27:04,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:27:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:27:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:27:04,669 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:27:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:05,659 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:27:05,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:27:05,660 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:27:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:05,660 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:27:05,660 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:27:05,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:27:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:27:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:27:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:27:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:27:05,665 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:27:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:05,665 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:27:05,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:27:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:27:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:27:05,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:05,666 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:27:05,666 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:27:05,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:05,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:27:05,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:06,216 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:27:06,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:06,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:27:06,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:27:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:27:06,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:27:06,218 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:27:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:07,174 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:27:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:27:07,175 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:27:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:07,176 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:27:07,176 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:27:07,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:27:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:27:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:27:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:27:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:27:07,180 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:27:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:07,180 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:27:07,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:27:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:27:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:27:07,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:07,181 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:27:07,181 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:27:07,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:07,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:27:07,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:07,995 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:27:07,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:07,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:27:07,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:27:07,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:27:07,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:27:07,996 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:27:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:09,048 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:27:09,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:27:09,048 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:27:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:09,049 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:27:09,049 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:27:09,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:27:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:27:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:27:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:27:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:27:09,052 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:27:09,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:09,052 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:27:09,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:27:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:27:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:27:09,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:09,053 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:27:09,053 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:09,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:27:09,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:09,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:27:09,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:09,690 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:27:09,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:09,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:27:09,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:27:09,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:27:09,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:27:09,691 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:27:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:10,846 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:27:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:27:10,846 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:27:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:10,847 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:27:10,847 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:27:10,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:27:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:27:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:27:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:27:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:27:10,850 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:27:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:10,850 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:27:10,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:27:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:27:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:27:10,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:10,851 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:27:10,851 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:27:10,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:10,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:27:10,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:12,061 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:27:12,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:12,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:27:12,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:27:12,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:27:12,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:27:12,063 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:27:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:13,195 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:27:13,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:27:13,196 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:27:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:13,196 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:27:13,196 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:27:13,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:27:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:27:13,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:27:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:27:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:27:13,200 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:27:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:13,200 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:27:13,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:27:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:27:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:27:13,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:13,201 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:27:13,201 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:27:13,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:13,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:27:13,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:13,829 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:27:13,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:13,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:27:13,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:27:13,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:27:13,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:27:13,831 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:27:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:15,068 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:27:15,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:27:15,069 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:27:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:15,070 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:27:15,070 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:27:15,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:27:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:27:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:27:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:27:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:27:15,073 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:27:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:15,073 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:27:15,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:27:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:27:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:27:15,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:15,074 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:27:15,074 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:15,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:27:15,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:15,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:27:15,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:16,043 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:27:16,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:16,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:27:16,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:27:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:27:16,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:27:16,045 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:27:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:17,615 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:27:17,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:27:17,616 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:27:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:17,617 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:27:17,617 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:27:17,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:27:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:27:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:27:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:27:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:27:17,619 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:27:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:17,619 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:27:17,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:27:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:27:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:27:17,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:17,620 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:27:17,620 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:17,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:27:17,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:17,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:27:17,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:19,020 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:27:19,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:19,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:27:19,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:27:19,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:27:19,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:27:19,022 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:27:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:20,333 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:27:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:27:20,334 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:27:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:20,335 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:27:20,335 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:27:20,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:27:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:27:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:27:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:27:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:27:20,338 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:27:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:20,339 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:27:20,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:27:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:27:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:27:20,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:20,339 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:27:20,340 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:20,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:20,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:27:20,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:20,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:27:20,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:21,521 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:27:21,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:21,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:27:21,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:27:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:27:21,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:27:21,522 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:27:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:22,935 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:27:22,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:27:22,935 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:27:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:22,936 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:27:22,936 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:27:22,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:27:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:27:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:27:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:27:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:27:22,939 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:27:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:22,939 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:27:22,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:27:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:27:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:27:22,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:22,940 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:27:22,940 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:22,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:27:22,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:22,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:27:22,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:23,748 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:27:23,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:23,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:27:23,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:27:23,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:27:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:27:23,749 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:27:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:25,234 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:27:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:27:25,234 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:27:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:25,235 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:27:25,235 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:27:25,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:27:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:27:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:27:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:27:25,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:27:25,238 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:27:25,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:25,238 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:27:25,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:27:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:27:25,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:27:25,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:25,239 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:27:25,239 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:27:25,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:25,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:27:25,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:26,286 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:27:26,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:26,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:27:26,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:27:26,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:27:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:27:26,288 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:27:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:27,790 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:27:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:27:27,790 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:27:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:27,791 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:27:27,791 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:27:27,791 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:27:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:27:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:27:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:27:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:27:27,793 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:27:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:27,793 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:27:27,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:27:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:27:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:27:27,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:27,794 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:27:27,794 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:27,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:27,795 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:27:27,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:27,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:27:27,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:28,630 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:27:28,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:28,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:27:28,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:27:28,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:27:28,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:27:28,632 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:27:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:30,288 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:27:30,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:27:30,289 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:27:30,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:30,289 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:27:30,289 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:27:30,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:27:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:27:30,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:27:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:27:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:27:30,293 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:27:30,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:30,293 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:27:30,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:27:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:27:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:27:30,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:30,293 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:27:30,294 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:27:30,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:30,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:27:30,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:31,351 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:27:31,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:31,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:27:31,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:27:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:27:31,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:27:31,353 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:27:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:33,017 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:27:33,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:27:33,017 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:27:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:33,018 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:27:33,018 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:27:33,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:27:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:27:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:27:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:27:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:27:33,021 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:27:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:33,022 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:27:33,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:27:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:27:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:27:33,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:33,023 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:27:33,023 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:33,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:27:33,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:33,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:27:33,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:34,048 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:27:34,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:34,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:27:34,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:27:34,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:27:34,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:27:34,049 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:27:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:35,835 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:27:35,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:27:35,835 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:27:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:35,836 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:27:35,836 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:27:35,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:27:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:27:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:27:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:27:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:27:35,840 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:27:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:35,840 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:27:35,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:27:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:27:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:27:35,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:35,841 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:27:35,841 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:27:35,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:35,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:27:35,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:36,868 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:27:36,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:36,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:27:36,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:27:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:27:36,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:27:36,869 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:27:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:38,761 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:27:38,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:27:38,761 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:27:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:38,762 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:27:38,762 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:27:38,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:27:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:27:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:27:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:27:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:27:38,764 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:27:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:38,765 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:27:38,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:27:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:27:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:27:38,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:38,766 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:27:38,766 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:38,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:27:38,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:38,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:27:38,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:39,679 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:27:39,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:39,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:27:39,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:27:39,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:27:39,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:27:39,680 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:27:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:41,709 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:27:41,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:27:41,710 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:27:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:41,711 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:27:41,711 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:27:41,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:27:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:27:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:27:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:27:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:27:41,714 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:27:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:41,714 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:27:41,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:27:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:27:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:27:41,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:41,715 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:27:41,715 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:27:41,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:41,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:27:41,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:43,012 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:27:43,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:43,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:27:43,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:27:43,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:27:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:27:43,013 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:27:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:44,962 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:27:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:27:44,963 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:27:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:44,963 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:27:44,964 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:27:44,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:27:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:27:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:27:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:27:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:27:44,967 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:27:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:44,967 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:27:44,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:27:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:27:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:27:44,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:44,969 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:27:44,969 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:44,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:44,969 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:27:44,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:44,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:27:44,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:46,247 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:27:46,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:46,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:27:46,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:27:46,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:27:46,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:27:46,248 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:27:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:48,371 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:27:48,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:27:48,372 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:27:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:48,373 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:27:48,373 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:27:48,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:27:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:27:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:27:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:27:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:27:48,376 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:27:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:48,377 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:27:48,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:27:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:27:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:27:48,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:48,377 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:27:48,378 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:27:48,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:48,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:27:48,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:49,353 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:27:49,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:49,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:27:49,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:27:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:27:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:27:49,354 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:27:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:51,643 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:27:51,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:27:51,643 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:27:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:51,644 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:27:51,644 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:27:51,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:27:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:27:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:27:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:27:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:27:51,648 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:27:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:51,648 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:27:51,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:27:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:27:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:27:51,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:51,649 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:27:51,649 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:27:51,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:27:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:27:51,837 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:27:51,873 INFO L202 PluginConnector]: Adding new model diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:27:51 BoogieIcfgContainer [2019-08-05 10:27:51,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:27:51,876 INFO L168 Benchmark]: Toolchain (without parser) took 73270.23 ms. Allocated memory was 137.9 MB in the beginning and 454.6 MB in the end (delta: 316.7 MB). Free memory was 109.4 MB in the beginning and 302.6 MB in the end (delta: -193.2 MB). Peak memory consumption was 123.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:27:51,877 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 110.9 MB in the beginning and 110.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:27:51,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.47 ms. Allocated memory is still 137.9 MB. Free memory was 109.2 MB in the beginning and 107.6 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:27:51,884 INFO L168 Benchmark]: Boogie Preprocessor took 40.65 ms. Allocated memory is still 137.9 MB. Free memory was 107.6 MB in the beginning and 106.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:27:51,884 INFO L168 Benchmark]: RCFGBuilder took 286.28 ms. Allocated memory is still 137.9 MB. Free memory was 106.3 MB in the beginning and 96.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:27:51,885 INFO L168 Benchmark]: TraceAbstraction took 72896.70 ms. Allocated memory was 137.9 MB in the beginning and 454.6 MB in the end (delta: 316.7 MB). Free memory was 96.0 MB in the beginning and 302.6 MB in the end (delta: -206.6 MB). Peak memory consumption was 110.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:27:51,893 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 110.9 MB in the beginning and 110.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.47 ms. Allocated memory is still 137.9 MB. Free memory was 109.2 MB in the beginning and 107.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.65 ms. Allocated memory is still 137.9 MB. Free memory was 107.6 MB in the beginning and 106.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 286.28 ms. Allocated memory is still 137.9 MB. Free memory was 106.3 MB in the beginning and 96.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72896.70 ms. Allocated memory was 137.9 MB in the beginning and 454.6 MB in the end (delta: 316.7 MB). Free memory was 96.0 MB in the beginning and 302.6 MB in the end (delta: -206.6 MB). Peak memory consumption was 110.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: assertion can be violated assertion can be violated We found a FailurePath: [L13] havoc main_#res; [L14] havoc main_#t~nondet0, main_~y~0, main_#t~post1, main_~x~0; [L15] main_~x~0 := 0; [L16] main_~y~0 := main_#t~nondet0; [L17] havoc main_#t~nondet0; VAL [main_~x~0=0, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=2, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=4, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=6, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=8, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=10, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=12, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=14, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=16, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=18, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=20, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=22, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=24, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=26, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=28, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=30, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=32, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=34, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=36, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=38, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=40, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=42, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=44, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=46, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=48, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=50, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=52, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=54, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=56, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=58, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=60, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=62, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=64, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=66, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=68, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=70, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=72, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=74, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=76, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=78, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=80, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=82, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=84, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=86, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=88, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=90, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=92, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=94, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=96, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=98, main_~y~0=1] [L32] assume main_~x~0 % 4294967296 < 99; [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=100, main_~y~0=1] [L24] assume !(main_~x~0 % 4294967296 < 99); [L25] assume ((0 == main_~x~0 % 2 || !(main_~x~0 % 4294967296 < 0)) && ((!((main_~y~0 % 2 + 4294967294) % 4294967296 == main_~x~0 % 2) && ((!(main_~y~0 % 2 == main_~x~0 % 2) && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)) || (main_~y~0 % 2 == main_~x~0 % 2 && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)))) || ((main_~y~0 % 2 + 4294967294) % 4294967296 == main_~x~0 % 2 && ((!(main_~y~0 % 2 == main_~x~0 % 2) && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)) || (main_~y~0 % 2 == main_~x~0 % 2 && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)))))) || (((((((main_~x~0 % 2 + 4294967294) % 4294967296 == main_~y~0 % 2 && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)) || ((((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2) && !((main_~x~0 % 2 + 4294967294) % 4294967296 == main_~y~0 % 2))) && (main_~x~0 % 2 + 4294967294) % 4294967296 == (main_~y~0 % 2 + 4294967294) % 4294967296) || ((((main_~x~0 % 2 + 4294967294) % 4294967296 == main_~y~0 % 2 && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)) || ((((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2) && !((main_~x~0 % 2 + 4294967294) % 4294967296 == main_~y~0 % 2))) && !((main_~x~0 % 2 + 4294967294) % 4294967296 == (main_~y~0 % 2 + 4294967294) % 4294967296))) && main_~x~0 % 4294967296 < 0) && !(0 == main_~x~0 % 2)); [L26] __VERIFIER_assert_#in~cond := (if (if !(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0 then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296 == (if main_~x~0 % 4294967296 < 0 && !(0 == main_~x~0 % 2) then main_~x~0 % 2 + -2 else main_~x~0 % 2) % 4294967296 then 1 else 0); [L27] havoc __VERIFIER_assert_~cond; [L28] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L29] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=100, main_~y~0=1] [L37] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=100, main_~y~0=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 72.8s OverallTime, 51 OverallIterations, 50 TraceHistogramMax, 41.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 0 SDslu, 1275 SDs, 0 SdLazy, 45475 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1325 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 50 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 29.6s InterpolantComputationTime, 1428 NumberOfCodeBlocks, 1428 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1325 ConstructedInterpolants, 0 QuantifiedInterpolants, 133925 SizeOfPredicates, 150 NumberOfNonLiveVariables, 5650 ConjunctsInSsa, 2650 ConjunctsInUnsatCore, 50 InterpolantComputations, 1 PerfectInterpolantSequences, 0/20825 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...