java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/up_true-unreach-call_true-termination.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:46:10,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:46:10,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:46:10,605 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:46:10,606 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:46:10,607 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:46:10,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:46:10,610 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:46:10,612 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:46:10,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:46:10,613 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:46:10,614 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:46:10,615 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:46:10,616 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:46:10,617 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:46:10,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:46:10,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:46:10,621 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:46:10,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:46:10,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:46:10,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:46:10,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:46:10,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:46:10,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:46:10,630 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:46:10,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:46:10,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:46:10,633 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:46:10,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:46:10,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:46:10,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:46:10,637 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:46:10,637 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:46:10,637 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:46:10,638 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:46:10,639 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:46:10,639 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 12:46:10,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:46:10,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:46:10,650 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:46:10,650 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:46:10,650 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:46:10,651 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:46:10,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:46:10,652 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:46:10,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:46:10,652 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:46:10,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:46:10,652 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:46:10,653 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:46:10,653 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:46:10,654 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:46:10,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:46:10,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:46:10,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:46:10,724 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:46:10,725 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:46:10,726 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/up_true-unreach-call_true-termination.i_4.bpl [2018-10-15 12:46:10,726 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/up_true-unreach-call_true-termination.i_4.bpl' [2018-10-15 12:46:10,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:46:10,797 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:46:10,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:46:10,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:46:10,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:46:10,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:46:10" (1/1) ... [2018-10-15 12:46:10,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:46:10" (1/1) ... [2018-10-15 12:46:10,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:46:10" (1/1) ... [2018-10-15 12:46:10,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:46:10" (1/1) ... [2018-10-15 12:46:10,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:46:10" (1/1) ... [2018-10-15 12:46:10,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:46:10" (1/1) ... [2018-10-15 12:46:10,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:46:10" (1/1) ... [2018-10-15 12:46:10,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:46:10,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:46:10,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:46:10,853 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:46:10,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:46:10" (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 [2018-10-15 12:46:10,930 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:46:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:46:10,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:46:11,307 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:46:11,308 INFO L202 PluginConnector]: Adding new model up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:46:11 BoogieIcfgContainer [2018-10-15 12:46:11,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:46:11,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:46:11,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:46:11,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:46:11,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:46:10" (1/2) ... [2018-10-15 12:46:11,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e07f5a and model type up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:46:11, skipping insertion in model container [2018-10-15 12:46:11,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "up_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:46:11" (2/2) ... [2018-10-15 12:46:11,317 INFO L112 eAbstractionObserver]: Analyzing ICFG up_true-unreach-call_true-termination.i_4.bpl [2018-10-15 12:46:11,327 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:46:11,335 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:46:11,353 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:46:11,381 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:46:11,382 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:46:11,382 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:46:11,382 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:46:11,382 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:46:11,383 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:46:11,383 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:46:11,383 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:46:11,383 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:46:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-10-15 12:46:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 12:46:11,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:11,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:11,412 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:11,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:11,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1082377262, now seen corresponding path program 1 times [2018-10-15 12:46:11,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:11,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:46:11,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 12:46:11,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:46:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:46:11,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:46:11,671 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2018-10-15 12:46:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:11,829 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-10-15 12:46:11,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:46:11,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-15 12:46:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:11,842 INFO L225 Difference]: With dead ends: 34 [2018-10-15 12:46:11,842 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 12:46:11,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:46:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 12:46:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-10-15 12:46:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 12:46:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-10-15 12:46:11,881 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 16 [2018-10-15 12:46:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:11,882 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-10-15 12:46:11,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:46:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-10-15 12:46:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-15 12:46:11,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:11,883 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:11,883 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:11,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash 892506362, now seen corresponding path program 1 times [2018-10-15 12:46:11,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:12,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:46:12,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 12:46:12,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:46:12,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:46:12,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:46:12,093 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2018-10-15 12:46:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:12,461 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-10-15 12:46:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 12:46:12,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-10-15 12:46:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:12,465 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:46:12,465 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 12:46:12,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:46:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 12:46:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2018-10-15 12:46:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 12:46:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-10-15 12:46:12,473 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 23 [2018-10-15 12:46:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:12,473 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-10-15 12:46:12,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:46:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-10-15 12:46:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 12:46:12,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:12,475 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:12,475 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:12,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:12,476 INFO L82 PathProgramCache]: Analyzing trace with hash 463010847, now seen corresponding path program 1 times [2018-10-15 12:46:12,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:12,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:12,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:46:12,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:46:12,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:46:12,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:46:12,720 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 9 states. [2018-10-15 12:46:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:13,278 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-10-15 12:46:13,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:46:13,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-10-15 12:46:13,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:13,280 INFO L225 Difference]: With dead ends: 57 [2018-10-15 12:46:13,280 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 12:46:13,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:46:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 12:46:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-10-15 12:46:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 12:46:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-10-15 12:46:13,287 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 34 [2018-10-15 12:46:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:13,288 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-10-15 12:46:13,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:46:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-10-15 12:46:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-15 12:46:13,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:13,293 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:13,293 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:13,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:13,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2065475769, now seen corresponding path program 2 times [2018-10-15 12:46:13,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:13,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:13,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:46:13,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:46:13,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:46:13,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:46:13,656 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 12 states. [2018-10-15 12:46:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:14,207 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-10-15 12:46:14,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:46:14,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-10-15 12:46:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:14,209 INFO L225 Difference]: With dead ends: 66 [2018-10-15 12:46:14,209 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 12:46:14,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:46:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 12:46:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2018-10-15 12:46:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 12:46:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-10-15 12:46:14,218 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 41 [2018-10-15 12:46:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:14,218 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-10-15 12:46:14,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:46:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-10-15 12:46:14,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 12:46:14,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:14,221 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:14,221 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:14,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash -734055502, now seen corresponding path program 3 times [2018-10-15 12:46:14,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:14,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:14,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:46:14,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:46:14,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:46:14,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:46:14,478 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 13 states. [2018-10-15 12:46:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:15,416 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2018-10-15 12:46:15,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:46:15,416 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-10-15 12:46:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:15,417 INFO L225 Difference]: With dead ends: 86 [2018-10-15 12:46:15,417 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 12:46:15,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:46:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 12:46:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-10-15 12:46:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 12:46:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-15 12:46:15,424 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 52 [2018-10-15 12:46:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:15,425 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-15 12:46:15,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:46:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-15 12:46:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 12:46:15,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:15,427 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:15,427 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:15,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:15,428 INFO L82 PathProgramCache]: Analyzing trace with hash -228059942, now seen corresponding path program 4 times [2018-10-15 12:46:15,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:15,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:15,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:46:15,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:46:15,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:46:15,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:46:15,745 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 15 states. [2018-10-15 12:46:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:16,194 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-10-15 12:46:16,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:46:16,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-10-15 12:46:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:16,196 INFO L225 Difference]: With dead ends: 84 [2018-10-15 12:46:16,197 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 12:46:16,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:46:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 12:46:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2018-10-15 12:46:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 12:46:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-15 12:46:16,204 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 59 [2018-10-15 12:46:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:16,205 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-15 12:46:16,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:46:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-15 12:46:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 12:46:16,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:16,206 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:16,207 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:16,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:16,207 INFO L82 PathProgramCache]: Analyzing trace with hash 508841023, now seen corresponding path program 5 times [2018-10-15 12:46:16,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:16,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:16,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:46:16,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:46:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:46:16,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:46:16,454 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 17 states. [2018-10-15 12:46:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:16,969 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-10-15 12:46:16,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:46:16,970 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-10-15 12:46:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:16,971 INFO L225 Difference]: With dead ends: 115 [2018-10-15 12:46:16,972 INFO L226 Difference]: Without dead ends: 80 [2018-10-15 12:46:16,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:46:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-15 12:46:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-10-15 12:46:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-15 12:46:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-15 12:46:16,980 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 70 [2018-10-15 12:46:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:16,980 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-15 12:46:16,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:46:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-15 12:46:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-15 12:46:16,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:16,983 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:16,983 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:16,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:16,983 INFO L82 PathProgramCache]: Analyzing trace with hash -452578457, now seen corresponding path program 6 times [2018-10-15 12:46:16,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 46 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:17,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:17,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:46:17,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:46:17,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:46:17,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:46:17,398 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 18 states. [2018-10-15 12:46:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:18,081 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-10-15 12:46:18,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:46:18,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-10-15 12:46:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:18,083 INFO L225 Difference]: With dead ends: 102 [2018-10-15 12:46:18,083 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 12:46:18,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:46:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 12:46:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2018-10-15 12:46:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-15 12:46:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-10-15 12:46:18,091 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 77 [2018-10-15 12:46:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:18,091 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-10-15 12:46:18,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:46:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-10-15 12:46:18,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 12:46:18,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:18,093 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:18,093 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:18,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:18,096 INFO L82 PathProgramCache]: Analyzing trace with hash 187663250, now seen corresponding path program 7 times [2018-10-15 12:46:18,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 86 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:18,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:18,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:46:18,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:46:18,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:46:18,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:46:18,552 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 21 states. [2018-10-15 12:46:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:19,186 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2018-10-15 12:46:19,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:46:19,186 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2018-10-15 12:46:19,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:19,187 INFO L225 Difference]: With dead ends: 144 [2018-10-15 12:46:19,188 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 12:46:19,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=349, Invalid=1457, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:46:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 12:46:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-10-15 12:46:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-15 12:46:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-10-15 12:46:19,205 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 88 [2018-10-15 12:46:19,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:19,205 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-10-15 12:46:19,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:46:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-10-15 12:46:19,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-15 12:46:19,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:19,208 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:19,208 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:19,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash -931860294, now seen corresponding path program 8 times [2018-10-15 12:46:19,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 75 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:19,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:19,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:46:19,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:46:19,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:46:19,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:46:19,510 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 21 states. [2018-10-15 12:46:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:20,057 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-10-15 12:46:20,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:46:20,058 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2018-10-15 12:46:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:20,059 INFO L225 Difference]: With dead ends: 120 [2018-10-15 12:46:20,060 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 12:46:20,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=504, Invalid=1946, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:46:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 12:46:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 107. [2018-10-15 12:46:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 12:46:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-10-15 12:46:20,067 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 95 [2018-10-15 12:46:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:20,068 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-10-15 12:46:20,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:46:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-10-15 12:46:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 12:46:20,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:20,070 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:20,071 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:20,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash -55491489, now seen corresponding path program 9 times [2018-10-15 12:46:20,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 135 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:20,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:20,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:46:20,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:46:20,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:46:20,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:46:20,385 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 25 states. [2018-10-15 12:46:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:21,174 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-10-15 12:46:21,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:46:21,174 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2018-10-15 12:46:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:21,176 INFO L225 Difference]: With dead ends: 173 [2018-10-15 12:46:21,176 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 12:46:21,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=492, Invalid=2160, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:46:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 12:46:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-10-15 12:46:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-15 12:46:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-10-15 12:46:21,181 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 106 [2018-10-15 12:46:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:21,182 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-10-15 12:46:21,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:46:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-10-15 12:46:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-15 12:46:21,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:21,183 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:21,184 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:21,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2131445881, now seen corresponding path program 10 times [2018-10-15 12:46:21,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 111 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:21,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:21,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 12:46:21,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 12:46:21,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 12:46:21,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:46:21,902 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 24 states. [2018-10-15 12:46:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:22,729 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2018-10-15 12:46:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:46:22,729 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 113 [2018-10-15 12:46:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:22,731 INFO L225 Difference]: With dead ends: 138 [2018-10-15 12:46:22,731 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 12:46:22,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=687, Invalid=2735, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:46:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 12:46:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2018-10-15 12:46:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 12:46:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-10-15 12:46:22,737 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 113 [2018-10-15 12:46:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:22,737 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-10-15 12:46:22,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 12:46:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-10-15 12:46:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 12:46:22,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:22,739 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:22,740 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:22,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash -570741902, now seen corresponding path program 11 times [2018-10-15 12:46:22,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 195 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:23,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:23,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:46:23,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:46:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:46:23,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:46:23,223 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 29 states. [2018-10-15 12:46:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:24,241 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-10-15 12:46:24,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:46:24,241 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-10-15 12:46:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:24,243 INFO L225 Difference]: With dead ends: 202 [2018-10-15 12:46:24,243 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 12:46:24,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=659, Invalid=3001, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:46:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 12:46:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-10-15 12:46:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-15 12:46:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-10-15 12:46:24,249 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 124 [2018-10-15 12:46:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:24,249 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-10-15 12:46:24,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:46:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-10-15 12:46:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-15 12:46:24,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:24,251 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:24,251 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:24,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1543035750, now seen corresponding path program 12 times [2018-10-15 12:46:24,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 154 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:25,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:25,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:46:25,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:46:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:46:25,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:46:25,030 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 27 states. [2018-10-15 12:46:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:26,315 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-10-15 12:46:26,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:46:26,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 131 [2018-10-15 12:46:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:26,317 INFO L225 Difference]: With dead ends: 156 [2018-10-15 12:46:26,317 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 12:46:26,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=898, Invalid=3658, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:46:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 12:46:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2018-10-15 12:46:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 12:46:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-10-15 12:46:26,323 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 131 [2018-10-15 12:46:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:26,323 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-10-15 12:46:26,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:46:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-10-15 12:46:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:46:26,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:26,325 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:26,325 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:26,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1321081729, now seen corresponding path program 13 times [2018-10-15 12:46:26,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 266 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:27,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:27,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:27,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:27,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:27,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:27,432 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 33 states. [2018-10-15 12:46:27,980 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-15 12:46:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:29,204 INFO L93 Difference]: Finished difference Result 231 states and 232 transitions. [2018-10-15 12:46:29,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:46:29,204 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 142 [2018-10-15 12:46:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:29,206 INFO L225 Difference]: With dead ends: 231 [2018-10-15 12:46:29,206 INFO L226 Difference]: Without dead ends: 152 [2018-10-15 12:46:29,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=850, Invalid=3980, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 12:46:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-15 12:46:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-10-15 12:46:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 12:46:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-10-15 12:46:29,227 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 142 [2018-10-15 12:46:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:29,227 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-10-15 12:46:29,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:46:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-10-15 12:46:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:46:29,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:29,229 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:29,229 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:29,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash 104915879, now seen corresponding path program 14 times [2018-10-15 12:46:29,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 204 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:29,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:29,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 12:46:29,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 12:46:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 12:46:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:46:29,689 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 30 states. [2018-10-15 12:46:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:30,784 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-10-15 12:46:30,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:46:30,784 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 149 [2018-10-15 12:46:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:30,786 INFO L225 Difference]: With dead ends: 174 [2018-10-15 12:46:30,786 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 12:46:30,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1137, Invalid=4715, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:46:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 12:46:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2018-10-15 12:46:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 12:46:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-10-15 12:46:30,791 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 149 [2018-10-15 12:46:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:30,792 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-10-15 12:46:30,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 12:46:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-10-15 12:46:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:46:30,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:30,793 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:30,793 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:30,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash -808441006, now seen corresponding path program 15 times [2018-10-15 12:46:30,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 348 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:31,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:31,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:46:31,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:46:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:46:31,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:46:31,489 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 37 states. [2018-10-15 12:46:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:32,604 INFO L93 Difference]: Finished difference Result 260 states and 261 transitions. [2018-10-15 12:46:32,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:46:32,605 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 160 [2018-10-15 12:46:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:32,607 INFO L225 Difference]: With dead ends: 260 [2018-10-15 12:46:32,607 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 12:46:32,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:46:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 12:46:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-15 12:46:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-15 12:46:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-10-15 12:46:32,614 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 160 [2018-10-15 12:46:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:32,614 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-10-15 12:46:32,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:46:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-10-15 12:46:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-15 12:46:32,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:32,615 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:32,616 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:32,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash -78860166, now seen corresponding path program 16 times [2018-10-15 12:46:32,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 261 proven. 348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:33,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:33,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:46:33,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:46:33,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:46:33,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:46:33,146 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 33 states. [2018-10-15 12:46:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:34,673 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-10-15 12:46:34,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:46:34,679 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 167 [2018-10-15 12:46:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:34,680 INFO L225 Difference]: With dead ends: 192 [2018-10-15 12:46:34,680 INFO L226 Difference]: Without dead ends: 192 [2018-10-15 12:46:34,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1404, Invalid=5906, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 12:46:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-15 12:46:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2018-10-15 12:46:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 12:46:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-10-15 12:46:34,686 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 167 [2018-10-15 12:46:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:34,687 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-10-15 12:46:34,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:46:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-10-15 12:46:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:46:34,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:34,688 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:34,688 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:34,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:34,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1122489185, now seen corresponding path program 17 times [2018-10-15 12:46:34,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 441 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:35,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:35,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:46:35,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:46:35,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:46:35,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:46:35,279 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 41 states. [2018-10-15 12:46:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:36,742 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-10-15 12:46:36,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:46:36,742 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 178 [2018-10-15 12:46:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:36,744 INFO L225 Difference]: With dead ends: 289 [2018-10-15 12:46:36,744 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 12:46:36,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1304, Invalid=6352, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:46:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 12:46:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-10-15 12:46:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-15 12:46:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-10-15 12:46:36,750 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 178 [2018-10-15 12:46:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:36,751 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-10-15 12:46:36,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:46:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-10-15 12:46:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-15 12:46:36,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:36,752 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:36,752 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:36,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:36,753 INFO L82 PathProgramCache]: Analyzing trace with hash 687650759, now seen corresponding path program 18 times [2018-10-15 12:46:36,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 325 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:37,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:37,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 12:46:37,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 12:46:37,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 12:46:37,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:46:37,560 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 36 states. [2018-10-15 12:46:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:41,423 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2018-10-15 12:46:41,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:46:41,424 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 185 [2018-10-15 12:46:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:41,425 INFO L225 Difference]: With dead ends: 210 [2018-10-15 12:46:41,426 INFO L226 Difference]: Without dead ends: 210 [2018-10-15 12:46:41,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2733 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1699, Invalid=7231, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:46:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-15 12:46:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 197. [2018-10-15 12:46:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-15 12:46:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-10-15 12:46:41,430 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 185 [2018-10-15 12:46:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:41,430 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-10-15 12:46:41,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 12:46:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-10-15 12:46:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:46:41,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:41,432 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:41,432 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:41,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1297908530, now seen corresponding path program 19 times [2018-10-15 12:46:41,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 545 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:42,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:42,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:46:42,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:46:42,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:46:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:46:42,191 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 45 states. [2018-10-15 12:46:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:43,844 INFO L93 Difference]: Finished difference Result 318 states and 319 transitions. [2018-10-15 12:46:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:46:43,845 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 196 [2018-10-15 12:46:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:43,846 INFO L225 Difference]: With dead ends: 318 [2018-10-15 12:46:43,847 INFO L226 Difference]: Without dead ends: 206 [2018-10-15 12:46:43,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1567, Invalid=7745, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:46:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-15 12:46:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-10-15 12:46:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-15 12:46:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-10-15 12:46:43,852 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 196 [2018-10-15 12:46:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:43,852 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-10-15 12:46:43,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:46:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-10-15 12:46:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-15 12:46:43,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:43,853 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:43,854 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:43,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:43,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1376545702, now seen corresponding path program 20 times [2018-10-15 12:46:43,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 396 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:44,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:44,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:46:44,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:46:44,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:46:44,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:46:44,863 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 39 states. [2018-10-15 12:46:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:46,467 INFO L93 Difference]: Finished difference Result 228 states and 229 transitions. [2018-10-15 12:46:46,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 12:46:46,470 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 203 [2018-10-15 12:46:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:46,472 INFO L225 Difference]: With dead ends: 228 [2018-10-15 12:46:46,472 INFO L226 Difference]: Without dead ends: 228 [2018-10-15 12:46:46,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2022, Invalid=8690, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 12:46:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-15 12:46:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 215. [2018-10-15 12:46:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-15 12:46:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-10-15 12:46:46,479 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 203 [2018-10-15 12:46:46,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:46,480 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-10-15 12:46:46,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:46:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-10-15 12:46:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-15 12:46:46,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:46,481 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:46,481 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:46,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:46,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1204165823, now seen corresponding path program 21 times [2018-10-15 12:46:46,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 660 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:48,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:48,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:46:48,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:46:48,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:46:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2015, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:46:48,430 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 49 states. [2018-10-15 12:46:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:50,582 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-10-15 12:46:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:46:50,582 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 214 [2018-10-15 12:46:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:50,583 INFO L225 Difference]: With dead ends: 347 [2018-10-15 12:46:50,583 INFO L226 Difference]: Without dead ends: 224 [2018-10-15 12:46:50,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1854, Invalid=9276, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 12:46:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-15 12:46:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-10-15 12:46:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-15 12:46:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-10-15 12:46:50,589 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 214 [2018-10-15 12:46:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:50,590 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-10-15 12:46:50,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:46:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-10-15 12:46:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-15 12:46:50,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:50,591 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:50,591 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:50,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1011207193, now seen corresponding path program 22 times [2018-10-15 12:46:50,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 474 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:51,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:51,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 12:46:51,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 12:46:51,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 12:46:51,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:46:51,965 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 42 states. [2018-10-15 12:46:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:53,746 INFO L93 Difference]: Finished difference Result 246 states and 247 transitions. [2018-10-15 12:46:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:46:53,746 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 221 [2018-10-15 12:46:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:53,749 INFO L225 Difference]: With dead ends: 246 [2018-10-15 12:46:53,749 INFO L226 Difference]: Without dead ends: 246 [2018-10-15 12:46:53,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2373, Invalid=10283, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:46:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-15 12:46:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 233. [2018-10-15 12:46:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-15 12:46:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-10-15 12:46:53,755 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 221 [2018-10-15 12:46:53,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:53,755 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-10-15 12:46:53,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 12:46:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-10-15 12:46:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-15 12:46:53,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:53,757 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:53,757 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:53,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:53,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1932643566, now seen corresponding path program 23 times [2018-10-15 12:46:53,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 786 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:54,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:54,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:46:54,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:46:54,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:46:54,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=2365, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:46:54,953 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 53 states. [2018-10-15 12:46:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:57,106 INFO L93 Difference]: Finished difference Result 376 states and 377 transitions. [2018-10-15 12:46:57,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 12:46:57,106 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 232 [2018-10-15 12:46:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:57,108 INFO L225 Difference]: With dead ends: 376 [2018-10-15 12:46:57,108 INFO L226 Difference]: Without dead ends: 242 [2018-10-15 12:46:57,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3353 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2165, Invalid=10945, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:46:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-15 12:46:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-15 12:46:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 12:46:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-10-15 12:46:57,113 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 232 [2018-10-15 12:46:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:57,114 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-10-15 12:46:57,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:46:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-10-15 12:46:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 12:46:57,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:57,115 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:57,115 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:57,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash -450244550, now seen corresponding path program 24 times [2018-10-15 12:46:57,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 559 proven. 786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:58,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:58,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:46:58,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:46:58,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:46:58,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:46:58,233 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 45 states. [2018-10-15 12:47:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:00,560 INFO L93 Difference]: Finished difference Result 264 states and 265 transitions. [2018-10-15 12:47:00,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 12:47:00,564 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 239 [2018-10-15 12:47:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:00,565 INFO L225 Difference]: With dead ends: 264 [2018-10-15 12:47:00,565 INFO L226 Difference]: Without dead ends: 264 [2018-10-15 12:47:00,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4647 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2752, Invalid=12010, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 12:47:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-15 12:47:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 251. [2018-10-15 12:47:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-15 12:47:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-10-15 12:47:00,571 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 239 [2018-10-15 12:47:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:00,571 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-10-15 12:47:00,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:47:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-10-15 12:47:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 12:47:00,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:00,573 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:00,573 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:00,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1063105759, now seen corresponding path program 25 times [2018-10-15 12:47:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 923 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:02,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:02,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:47:02,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:47:02,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:47:02,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2743, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:47:02,010 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 57 states. [2018-10-15 12:47:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:04,459 INFO L93 Difference]: Finished difference Result 405 states and 406 transitions. [2018-10-15 12:47:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 12:47:04,459 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 250 [2018-10-15 12:47:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:04,460 INFO L225 Difference]: With dead ends: 405 [2018-10-15 12:47:04,460 INFO L226 Difference]: Without dead ends: 260 [2018-10-15 12:47:04,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3938 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2500, Invalid=12752, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 12:47:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-15 12:47:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-10-15 12:47:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-15 12:47:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2018-10-15 12:47:04,465 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 259 transitions. Word has length 250 [2018-10-15 12:47:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:04,465 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 259 transitions. [2018-10-15 12:47:04,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:47:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 259 transitions. [2018-10-15 12:47:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-15 12:47:04,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:04,467 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:04,467 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:04,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:04,468 INFO L82 PathProgramCache]: Analyzing trace with hash -141862905, now seen corresponding path program 26 times [2018-10-15 12:47:04,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 651 proven. 923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:05,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:05,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:47:05,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:47:05,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:47:05,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1859, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:47:05,979 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. Second operand 48 states. [2018-10-15 12:47:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:08,282 INFO L93 Difference]: Finished difference Result 282 states and 283 transitions. [2018-10-15 12:47:08,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 12:47:08,283 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 257 [2018-10-15 12:47:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:08,285 INFO L225 Difference]: With dead ends: 282 [2018-10-15 12:47:08,285 INFO L226 Difference]: Without dead ends: 282 [2018-10-15 12:47:08,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5397 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3159, Invalid=13871, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:47:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-15 12:47:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 269. [2018-10-15 12:47:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-15 12:47:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-10-15 12:47:08,290 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 257 [2018-10-15 12:47:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:08,291 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-10-15 12:47:08,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:47:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-10-15 12:47:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-15 12:47:08,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:08,293 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:08,293 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:08,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1842559730, now seen corresponding path program 27 times [2018-10-15 12:47:08,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 1071 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:09,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:09,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:47:09,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:47:09,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:47:09,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=3149, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:47:09,489 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 61 states. [2018-10-15 12:47:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:11,856 INFO L93 Difference]: Finished difference Result 434 states and 435 transitions. [2018-10-15 12:47:11,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 12:47:11,856 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 268 [2018-10-15 12:47:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:11,858 INFO L225 Difference]: With dead ends: 434 [2018-10-15 12:47:11,858 INFO L226 Difference]: Without dead ends: 278 [2018-10-15 12:47:11,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4570 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2859, Invalid=14697, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:47:11,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-15 12:47:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-10-15 12:47:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-15 12:47:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 277 transitions. [2018-10-15 12:47:11,864 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 277 transitions. Word has length 268 [2018-10-15 12:47:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:11,864 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 277 transitions. [2018-10-15 12:47:11,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:47:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 277 transitions. [2018-10-15 12:47:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-15 12:47:11,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:11,866 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:11,866 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:11,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:11,866 INFO L82 PathProgramCache]: Analyzing trace with hash -207789030, now seen corresponding path program 28 times [2018-10-15 12:47:11,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 750 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:12,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:12,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:47:12,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:47:12,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:47:12,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:47:12,787 INFO L87 Difference]: Start difference. First operand 276 states and 277 transitions. Second operand 51 states. [2018-10-15 12:47:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:15,496 INFO L93 Difference]: Finished difference Result 300 states and 301 transitions. [2018-10-15 12:47:15,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:47:15,497 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 275 [2018-10-15 12:47:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:15,498 INFO L225 Difference]: With dead ends: 300 [2018-10-15 12:47:15,499 INFO L226 Difference]: Without dead ends: 300 [2018-10-15 12:47:15,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6203 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3594, Invalid=15866, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 12:47:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-15 12:47:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 287. [2018-10-15 12:47:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-15 12:47:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-10-15 12:47:15,504 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 275 [2018-10-15 12:47:15,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:15,504 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-10-15 12:47:15,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:47:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-10-15 12:47:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-15 12:47:15,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:15,506 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:15,506 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:15,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:15,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2020668671, now seen corresponding path program 29 times [2018-10-15 12:47:15,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 1230 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:16,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:16,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:47:16,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:47:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:47:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=3583, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:47:16,841 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 65 states. [2018-10-15 12:47:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:19,865 INFO L93 Difference]: Finished difference Result 463 states and 464 transitions. [2018-10-15 12:47:19,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 12:47:19,865 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 286 [2018-10-15 12:47:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:19,866 INFO L225 Difference]: With dead ends: 463 [2018-10-15 12:47:19,867 INFO L226 Difference]: Without dead ends: 296 [2018-10-15 12:47:19,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5249 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3242, Invalid=16780, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 12:47:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-15 12:47:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2018-10-15 12:47:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-15 12:47:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2018-10-15 12:47:19,871 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 286 [2018-10-15 12:47:19,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:19,871 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2018-10-15 12:47:19,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:47:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2018-10-15 12:47:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-15 12:47:19,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:19,872 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:19,873 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:19,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1275208743, now seen corresponding path program 30 times [2018-10-15 12:47:19,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2086 backedges. 856 proven. 1230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:21,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:21,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 12:47:21,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 12:47:21,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 12:47:21,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 12:47:21,138 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand 54 states. [2018-10-15 12:47:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:24,016 INFO L93 Difference]: Finished difference Result 318 states and 319 transitions. [2018-10-15 12:47:24,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 12:47:24,017 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 293 [2018-10-15 12:47:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:24,019 INFO L225 Difference]: With dead ends: 318 [2018-10-15 12:47:24,019 INFO L226 Difference]: Without dead ends: 318 [2018-10-15 12:47:24,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7065 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4057, Invalid=17995, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 12:47:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-15 12:47:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 305. [2018-10-15 12:47:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-15 12:47:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-10-15 12:47:24,026 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 293 [2018-10-15 12:47:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:24,026 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-10-15 12:47:24,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 12:47:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-10-15 12:47:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-15 12:47:24,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:24,028 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:24,029 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:24,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:24,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1503238866, now seen corresponding path program 31 times [2018-10-15 12:47:24,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 1400 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:25,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:25,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:47:25,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:47:25,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:47:25,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=4045, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:47:25,799 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 69 states. [2018-10-15 12:47:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:29,199 INFO L93 Difference]: Finished difference Result 492 states and 493 transitions. [2018-10-15 12:47:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 12:47:29,199 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 304 [2018-10-15 12:47:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:29,201 INFO L225 Difference]: With dead ends: 492 [2018-10-15 12:47:29,201 INFO L226 Difference]: Without dead ends: 314 [2018-10-15 12:47:29,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5975 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3649, Invalid=19001, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:47:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-15 12:47:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-10-15 12:47:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-15 12:47:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2018-10-15 12:47:29,206 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 304 [2018-10-15 12:47:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:29,207 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2018-10-15 12:47:29,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:47:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2018-10-15 12:47:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-15 12:47:29,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:29,209 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:29,209 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:29,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:29,209 INFO L82 PathProgramCache]: Analyzing trace with hash 897339386, now seen corresponding path program 32 times [2018-10-15 12:47:29,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2369 backedges. 969 proven. 1400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:30,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:30,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:47:30,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:47:30,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:47:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:47:30,394 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 57 states. [2018-10-15 12:47:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:33,613 INFO L93 Difference]: Finished difference Result 336 states and 337 transitions. [2018-10-15 12:47:33,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 12:47:33,613 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 311 [2018-10-15 12:47:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:33,616 INFO L225 Difference]: With dead ends: 336 [2018-10-15 12:47:33,616 INFO L226 Difference]: Without dead ends: 336 [2018-10-15 12:47:33,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7983 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4548, Invalid=20258, Unknown=0, NotChecked=0, Total=24806 [2018-10-15 12:47:33,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-15 12:47:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 323. [2018-10-15 12:47:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-15 12:47:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-10-15 12:47:33,621 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 311 [2018-10-15 12:47:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:33,622 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-10-15 12:47:33,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:47:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-10-15 12:47:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-15 12:47:33,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:33,624 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:33,624 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:33,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:33,624 INFO L82 PathProgramCache]: Analyzing trace with hash -837690081, now seen corresponding path program 33 times [2018-10-15 12:47:33,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1581 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:35,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:35,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:47:35,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:47:35,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:47:35,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=721, Invalid=4535, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:47:35,420 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 73 states. [2018-10-15 12:47:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:39,357 INFO L93 Difference]: Finished difference Result 521 states and 522 transitions. [2018-10-15 12:47:39,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 12:47:39,357 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 322 [2018-10-15 12:47:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:39,358 INFO L225 Difference]: With dead ends: 521 [2018-10-15 12:47:39,359 INFO L226 Difference]: Without dead ends: 332 [2018-10-15 12:47:39,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6748 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4080, Invalid=21360, Unknown=0, NotChecked=0, Total=25440 [2018-10-15 12:47:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-15 12:47:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-10-15 12:47:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-15 12:47:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2018-10-15 12:47:39,363 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 322 [2018-10-15 12:47:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:39,363 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2018-10-15 12:47:39,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:47:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2018-10-15 12:47:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-15 12:47:39,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:39,365 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:39,365 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:39,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:39,366 INFO L82 PathProgramCache]: Analyzing trace with hash -818898873, now seen corresponding path program 34 times [2018-10-15 12:47:39,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 1089 proven. 1581 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:40,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:40,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 12:47:40,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 12:47:40,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 12:47:40,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:47:40,528 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 60 states. [2018-10-15 12:47:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:43,740 INFO L93 Difference]: Finished difference Result 354 states and 355 transitions. [2018-10-15 12:47:43,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:47:43,740 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 329 [2018-10-15 12:47:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:43,742 INFO L225 Difference]: With dead ends: 354 [2018-10-15 12:47:43,743 INFO L226 Difference]: Without dead ends: 354 [2018-10-15 12:47:43,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8957 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5067, Invalid=22655, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:47:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-15 12:47:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 341. [2018-10-15 12:47:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-15 12:47:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 342 transitions. [2018-10-15 12:47:43,749 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 342 transitions. Word has length 329 [2018-10-15 12:47:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:43,750 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 342 transitions. [2018-10-15 12:47:43,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 12:47:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 342 transitions. [2018-10-15 12:47:43,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-15 12:47:43,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:43,752 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:43,752 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:43,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash 584012466, now seen corresponding path program 35 times [2018-10-15 12:47:43,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 1773 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:45,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:45,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:47:45,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:47:45,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:47:45,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=5053, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:47:45,642 INFO L87 Difference]: Start difference. First operand 341 states and 342 transitions. Second operand 77 states. [2018-10-15 12:47:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:50,022 INFO L93 Difference]: Finished difference Result 550 states and 551 transitions. [2018-10-15 12:47:50,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 12:47:50,023 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 340 [2018-10-15 12:47:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:50,024 INFO L225 Difference]: With dead ends: 550 [2018-10-15 12:47:50,024 INFO L226 Difference]: Without dead ends: 350 [2018-10-15 12:47:50,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7568 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4535, Invalid=23857, Unknown=0, NotChecked=0, Total=28392 [2018-10-15 12:47:50,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-15 12:47:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2018-10-15 12:47:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-15 12:47:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 349 transitions. [2018-10-15 12:47:50,029 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 349 transitions. Word has length 340 [2018-10-15 12:47:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:50,029 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 349 transitions. [2018-10-15 12:47:50,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:47:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 349 transitions. [2018-10-15 12:47:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 12:47:50,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:50,032 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:50,032 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:50,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:50,032 INFO L82 PathProgramCache]: Analyzing trace with hash -260795430, now seen corresponding path program 36 times [2018-10-15 12:47:50,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2989 backedges. 1216 proven. 1773 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:51,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:51,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:47:51,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:47:51,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:47:51,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=3229, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:47:51,582 INFO L87 Difference]: Start difference. First operand 348 states and 349 transitions. Second operand 63 states. [2018-10-15 12:47:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:55,247 INFO L93 Difference]: Finished difference Result 372 states and 373 transitions. [2018-10-15 12:47:55,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 12:47:55,248 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 347 [2018-10-15 12:47:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:55,250 INFO L225 Difference]: With dead ends: 372 [2018-10-15 12:47:55,250 INFO L226 Difference]: Without dead ends: 372 [2018-10-15 12:47:55,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9987 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5614, Invalid=25186, Unknown=0, NotChecked=0, Total=30800 [2018-10-15 12:47:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-10-15 12:47:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 359. [2018-10-15 12:47:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-15 12:47:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-10-15 12:47:55,255 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 347 [2018-10-15 12:47:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:55,255 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-10-15 12:47:55,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:47:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-10-15 12:47:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-15 12:47:55,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:55,258 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:55,258 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:55,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1104309567, now seen corresponding path program 37 times [2018-10-15 12:47:55,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 1976 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:58,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:58,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:47:58,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:47:58,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:47:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=5599, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:47:58,021 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 81 states. [2018-10-15 12:48:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:02,796 INFO L93 Difference]: Finished difference Result 579 states and 580 transitions. [2018-10-15 12:48:02,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 12:48:02,796 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 358 [2018-10-15 12:48:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:02,797 INFO L225 Difference]: With dead ends: 579 [2018-10-15 12:48:02,797 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 12:48:02,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8435 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5014, Invalid=26492, Unknown=0, NotChecked=0, Total=31506 [2018-10-15 12:48:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 12:48:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 366. [2018-10-15 12:48:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-15 12:48:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 367 transitions. [2018-10-15 12:48:02,803 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 367 transitions. Word has length 358 [2018-10-15 12:48:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:02,803 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 367 transitions. [2018-10-15 12:48:02,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:48:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 367 transitions. [2018-10-15 12:48:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-15 12:48:02,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:02,805 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:02,806 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:02,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash 900248679, now seen corresponding path program 38 times [2018-10-15 12:48:02,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3326 backedges. 1350 proven. 1976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:04,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:04,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 12:48:04,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 12:48:04,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 12:48:04,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=3548, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 12:48:04,352 INFO L87 Difference]: Start difference. First operand 366 states and 367 transitions. Second operand 66 states. [2018-10-15 12:48:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:08,740 INFO L93 Difference]: Finished difference Result 390 states and 391 transitions. [2018-10-15 12:48:08,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 12:48:08,745 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 365 [2018-10-15 12:48:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:08,747 INFO L225 Difference]: With dead ends: 390 [2018-10-15 12:48:08,747 INFO L226 Difference]: Without dead ends: 390 [2018-10-15 12:48:08,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11073 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6189, Invalid=27851, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 12:48:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-15 12:48:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2018-10-15 12:48:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-15 12:48:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-10-15 12:48:08,753 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 365 [2018-10-15 12:48:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:08,753 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-10-15 12:48:08,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 12:48:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-10-15 12:48:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-15 12:48:08,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:08,756 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:08,756 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:08,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash -442342766, now seen corresponding path program 39 times [2018-10-15 12:48:08,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 2190 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:10,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:10,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:48:10,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:48:10,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:48:10,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=967, Invalid=6173, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:48:10,933 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 85 states. [2018-10-15 12:48:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:16,094 INFO L93 Difference]: Finished difference Result 608 states and 609 transitions. [2018-10-15 12:48:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 12:48:16,095 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 376 [2018-10-15 12:48:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:16,096 INFO L225 Difference]: With dead ends: 608 [2018-10-15 12:48:16,096 INFO L226 Difference]: Without dead ends: 386 [2018-10-15 12:48:16,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9349 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5517, Invalid=29265, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:48:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-15 12:48:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2018-10-15 12:48:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-15 12:48:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2018-10-15 12:48:16,100 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 376 [2018-10-15 12:48:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:16,101 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2018-10-15 12:48:16,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:48:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2018-10-15 12:48:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-15 12:48:16,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:16,103 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:16,103 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:16,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:16,104 INFO L82 PathProgramCache]: Analyzing trace with hash 867446714, now seen corresponding path program 40 times [2018-10-15 12:48:16,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3681 backedges. 1491 proven. 2190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:17,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:17,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:48:17,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:48:17,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:48:17,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=3882, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:48:17,821 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 69 states. [2018-10-15 12:48:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:22,378 INFO L93 Difference]: Finished difference Result 408 states and 409 transitions. [2018-10-15 12:48:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:48:22,378 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 383 [2018-10-15 12:48:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:22,380 INFO L225 Difference]: With dead ends: 408 [2018-10-15 12:48:22,380 INFO L226 Difference]: Without dead ends: 408 [2018-10-15 12:48:22,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12215 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6792, Invalid=30650, Unknown=0, NotChecked=0, Total=37442 [2018-10-15 12:48:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-15 12:48:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 395. [2018-10-15 12:48:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-15 12:48:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-10-15 12:48:22,387 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 383 [2018-10-15 12:48:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:22,387 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-10-15 12:48:22,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:48:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-10-15 12:48:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-15 12:48:22,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:22,390 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:22,390 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:22,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:22,391 INFO L82 PathProgramCache]: Analyzing trace with hash 465872223, now seen corresponding path program 41 times [2018-10-15 12:48:22,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 2415 proven. 1491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:24,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:24,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:48:24,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:48:24,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:48:24,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=6775, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:48:24,679 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 89 states. [2018-10-15 12:48:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:29,716 INFO L93 Difference]: Finished difference Result 637 states and 638 transitions. [2018-10-15 12:48:29,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 12:48:29,716 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 394 [2018-10-15 12:48:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:29,718 INFO L225 Difference]: With dead ends: 637 [2018-10-15 12:48:29,718 INFO L226 Difference]: Without dead ends: 404 [2018-10-15 12:48:29,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10310 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6044, Invalid=32176, Unknown=0, NotChecked=0, Total=38220 [2018-10-15 12:48:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-15 12:48:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2018-10-15 12:48:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-15 12:48:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 403 transitions. [2018-10-15 12:48:29,723 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 403 transitions. Word has length 394 [2018-10-15 12:48:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:29,723 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 403 transitions. [2018-10-15 12:48:29,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:48:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 403 transitions. [2018-10-15 12:48:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-15 12:48:29,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:29,725 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:29,725 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:29,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:29,725 INFO L82 PathProgramCache]: Analyzing trace with hash -92505977, now seen corresponding path program 42 times [2018-10-15 12:48:29,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 1639 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:31,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:31,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 12:48:31,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 12:48:31,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 12:48:31,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=4231, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 12:48:31,430 INFO L87 Difference]: Start difference. First operand 402 states and 403 transitions. Second operand 72 states. [2018-10-15 12:48:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:36,186 INFO L93 Difference]: Finished difference Result 426 states and 427 transitions. [2018-10-15 12:48:36,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 12:48:36,187 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 401 [2018-10-15 12:48:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:36,189 INFO L225 Difference]: With dead ends: 426 [2018-10-15 12:48:36,189 INFO L226 Difference]: Without dead ends: 426 [2018-10-15 12:48:36,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13413 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7423, Invalid=33583, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:48:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-15 12:48:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 413. [2018-10-15 12:48:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-10-15 12:48:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2018-10-15 12:48:36,196 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 401 [2018-10-15 12:48:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:36,197 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2018-10-15 12:48:36,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 12:48:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2018-10-15 12:48:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-15 12:48:36,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:36,199 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:36,199 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:36,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:36,200 INFO L82 PathProgramCache]: Analyzing trace with hash -406795662, now seen corresponding path program 43 times [2018-10-15 12:48:36,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 2651 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:38,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:38,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:48:38,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:48:38,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:48:38,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1151, Invalid=7405, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:48:38,998 INFO L87 Difference]: Start difference. First operand 413 states and 414 transitions. Second operand 93 states. [2018-10-15 12:48:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:45,393 INFO L93 Difference]: Finished difference Result 666 states and 667 transitions. [2018-10-15 12:48:45,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 12:48:45,393 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 412 [2018-10-15 12:48:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:45,395 INFO L225 Difference]: With dead ends: 666 [2018-10-15 12:48:45,395 INFO L226 Difference]: Without dead ends: 422 [2018-10-15 12:48:45,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11318 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=6595, Invalid=35225, Unknown=0, NotChecked=0, Total=41820 [2018-10-15 12:48:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-10-15 12:48:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2018-10-15 12:48:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-15 12:48:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 421 transitions. [2018-10-15 12:48:45,400 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 421 transitions. Word has length 412 [2018-10-15 12:48:45,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:45,400 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 421 transitions. [2018-10-15 12:48:45,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:48:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 421 transitions. [2018-10-15 12:48:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 12:48:45,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:45,403 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:45,403 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:45,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:45,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1209457766, now seen corresponding path program 44 times [2018-10-15 12:48:45,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4445 backedges. 1794 proven. 2651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:47,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:47,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:48:47,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:48:47,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:48:47,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4595, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:48:47,175 INFO L87 Difference]: Start difference. First operand 420 states and 421 transitions. Second operand 75 states. [2018-10-15 12:48:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:51,767 INFO L93 Difference]: Finished difference Result 444 states and 445 transitions. [2018-10-15 12:48:51,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 12:48:51,768 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 419 [2018-10-15 12:48:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:51,770 INFO L225 Difference]: With dead ends: 444 [2018-10-15 12:48:51,770 INFO L226 Difference]: Without dead ends: 444 [2018-10-15 12:48:51,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14667 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8082, Invalid=36650, Unknown=0, NotChecked=0, Total=44732 [2018-10-15 12:48:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-15 12:48:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 431. [2018-10-15 12:48:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-15 12:48:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-10-15 12:48:51,775 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 419 [2018-10-15 12:48:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:51,775 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-10-15 12:48:51,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:48:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-10-15 12:48:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-15 12:48:51,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:51,777 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:51,777 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:51,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:51,777 INFO L82 PathProgramCache]: Analyzing trace with hash 175801727, now seen corresponding path program 45 times [2018-10-15 12:48:51,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 2898 proven. 1794 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:54,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:54,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:48:54,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:48:54,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:48:54,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1249, Invalid=8063, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:48:54,793 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 97 states. [2018-10-15 12:49:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:01,505 INFO L93 Difference]: Finished difference Result 695 states and 696 transitions. [2018-10-15 12:49:01,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 12:49:01,505 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 430 [2018-10-15 12:49:01,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:01,506 INFO L225 Difference]: With dead ends: 695 [2018-10-15 12:49:01,506 INFO L226 Difference]: Without dead ends: 440 [2018-10-15 12:49:01,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12373 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7170, Invalid=38412, Unknown=0, NotChecked=0, Total=45582 [2018-10-15 12:49:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-15 12:49:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2018-10-15 12:49:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-15 12:49:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 439 transitions. [2018-10-15 12:49:01,513 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 439 transitions. Word has length 430 [2018-10-15 12:49:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:01,513 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 439 transitions. [2018-10-15 12:49:01,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:49:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 439 transitions. [2018-10-15 12:49:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-15 12:49:01,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:01,516 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:01,516 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:01,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:01,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2134762663, now seen corresponding path program 46 times [2018-10-15 12:49:01,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4854 backedges. 1956 proven. 2898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:03,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:03,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 12:49:03,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 12:49:03,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 12:49:03,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1032, Invalid=4974, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:49:03,612 INFO L87 Difference]: Start difference. First operand 438 states and 439 transitions. Second operand 78 states. [2018-10-15 12:49:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:08,534 INFO L93 Difference]: Finished difference Result 462 states and 463 transitions. [2018-10-15 12:49:08,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:49:08,535 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 437 [2018-10-15 12:49:08,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:08,537 INFO L225 Difference]: With dead ends: 462 [2018-10-15 12:49:08,538 INFO L226 Difference]: Without dead ends: 462 [2018-10-15 12:49:08,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15977 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8769, Invalid=39851, Unknown=0, NotChecked=0, Total=48620 [2018-10-15 12:49:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-10-15 12:49:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2018-10-15 12:49:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-10-15 12:49:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 450 transitions. [2018-10-15 12:49:08,545 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 450 transitions. Word has length 437 [2018-10-15 12:49:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:08,545 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 450 transitions. [2018-10-15 12:49:08,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 12:49:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 450 transitions. [2018-10-15 12:49:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-10-15 12:49:08,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:08,547 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:08,547 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:08,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2019068498, now seen corresponding path program 47 times [2018-10-15 12:49:08,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 3156 proven. 1956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:11,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:11,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:49:11,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:49:11,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:49:11,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1351, Invalid=8749, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:49:11,512 INFO L87 Difference]: Start difference. First operand 449 states and 450 transitions. Second operand 101 states. [2018-10-15 12:49:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:18,906 INFO L93 Difference]: Finished difference Result 724 states and 725 transitions. [2018-10-15 12:49:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 12:49:18,906 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 448 [2018-10-15 12:49:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:18,907 INFO L225 Difference]: With dead ends: 724 [2018-10-15 12:49:18,907 INFO L226 Difference]: Without dead ends: 458 [2018-10-15 12:49:18,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13475 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=7769, Invalid=41737, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:49:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-15 12:49:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2018-10-15 12:49:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-10-15 12:49:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 457 transitions. [2018-10-15 12:49:18,912 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 457 transitions. Word has length 448 [2018-10-15 12:49:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:18,913 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 457 transitions. [2018-10-15 12:49:18,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:49:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 457 transitions. [2018-10-15 12:49:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-10-15 12:49:18,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:18,915 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:18,915 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:18,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:18,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1086230662, now seen corresponding path program 48 times [2018-10-15 12:49:18,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5281 backedges. 2125 proven. 3156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:20,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:20,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:49:20,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:49:20,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:49:20,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=5368, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:49:20,895 INFO L87 Difference]: Start difference. First operand 456 states and 457 transitions. Second operand 81 states. [2018-10-15 12:49:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:26,977 INFO L93 Difference]: Finished difference Result 480 states and 481 transitions. [2018-10-15 12:49:26,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-15 12:49:26,977 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 455 [2018-10-15 12:49:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:26,980 INFO L225 Difference]: With dead ends: 480 [2018-10-15 12:49:26,980 INFO L226 Difference]: Without dead ends: 480 [2018-10-15 12:49:26,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17343 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9484, Invalid=43186, Unknown=0, NotChecked=0, Total=52670 [2018-10-15 12:49:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-10-15 12:49:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 467. [2018-10-15 12:49:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-15 12:49:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 468 transitions. [2018-10-15 12:49:26,989 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 468 transitions. Word has length 455 [2018-10-15 12:49:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:26,989 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 468 transitions. [2018-10-15 12:49:26,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:49:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 468 transitions. [2018-10-15 12:49:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-15 12:49:26,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:26,992 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:26,992 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:26,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1124470175, now seen corresponding path program 49 times [2018-10-15 12:49:26,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 3425 proven. 2125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:30,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:30,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:49:30,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:49:30,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:49:30,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1457, Invalid=9463, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:49:30,326 INFO L87 Difference]: Start difference. First operand 467 states and 468 transitions. Second operand 105 states. [2018-10-15 12:49:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:38,199 INFO L93 Difference]: Finished difference Result 753 states and 754 transitions. [2018-10-15 12:49:38,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 12:49:38,199 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 466 [2018-10-15 12:49:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:38,201 INFO L225 Difference]: With dead ends: 753 [2018-10-15 12:49:38,201 INFO L226 Difference]: Without dead ends: 476 [2018-10-15 12:49:38,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14624 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=8392, Invalid=45200, Unknown=0, NotChecked=0, Total=53592 [2018-10-15 12:49:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-10-15 12:49:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 474. [2018-10-15 12:49:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-10-15 12:49:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 475 transitions. [2018-10-15 12:49:38,206 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 475 transitions. Word has length 466 [2018-10-15 12:49:38,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:38,206 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 475 transitions. [2018-10-15 12:49:38,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:49:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 475 transitions. [2018-10-15 12:49:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-10-15 12:49:38,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:38,209 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:38,209 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:38,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash 738130119, now seen corresponding path program 50 times [2018-10-15 12:49:38,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5726 backedges. 2301 proven. 3425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:40,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:40,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 12:49:40,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 12:49:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 12:49:40,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=5777, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:49:40,509 INFO L87 Difference]: Start difference. First operand 474 states and 475 transitions. Second operand 84 states. [2018-10-15 12:49:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:47,031 INFO L93 Difference]: Finished difference Result 498 states and 499 transitions. [2018-10-15 12:49:47,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 12:49:47,032 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 473 [2018-10-15 12:49:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:47,035 INFO L225 Difference]: With dead ends: 498 [2018-10-15 12:49:47,035 INFO L226 Difference]: Without dead ends: 498 [2018-10-15 12:49:47,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18765 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10227, Invalid=46655, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 12:49:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-10-15 12:49:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 485. [2018-10-15 12:49:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-15 12:49:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 486 transitions. [2018-10-15 12:49:47,040 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 486 transitions. Word has length 473 [2018-10-15 12:49:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:47,040 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 486 transitions. [2018-10-15 12:49:47,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 12:49:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 486 transitions. [2018-10-15 12:49:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-10-15 12:49:47,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:47,042 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:47,043 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:47,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:47,043 INFO L82 PathProgramCache]: Analyzing trace with hash -803757518, now seen corresponding path program 51 times [2018-10-15 12:49:47,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 3705 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:50,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:50,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:49:50,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:49:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:49:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1567, Invalid=10205, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:49:50,487 INFO L87 Difference]: Start difference. First operand 485 states and 486 transitions. Second operand 109 states. [2018-10-15 12:49:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:58,052 INFO L93 Difference]: Finished difference Result 782 states and 783 transitions. [2018-10-15 12:49:58,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 12:49:58,052 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 484 [2018-10-15 12:49:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:58,054 INFO L225 Difference]: With dead ends: 782 [2018-10-15 12:49:58,054 INFO L226 Difference]: Without dead ends: 494 [2018-10-15 12:49:58,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15820 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=9039, Invalid=48801, Unknown=0, NotChecked=0, Total=57840 [2018-10-15 12:49:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-10-15 12:49:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2018-10-15 12:49:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-15 12:49:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 493 transitions. [2018-10-15 12:49:58,059 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 493 transitions. Word has length 484 [2018-10-15 12:49:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:58,059 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 493 transitions. [2018-10-15 12:49:58,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:49:58,059 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 493 transitions. [2018-10-15 12:49:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-10-15 12:49:58,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:58,061 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:58,061 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:58,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:58,061 INFO L82 PathProgramCache]: Analyzing trace with hash -177532070, now seen corresponding path program 52 times [2018-10-15 12:49:58,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6189 backedges. 2484 proven. 3705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:00,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:00,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:50:00,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:50:00,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:50:00,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=6201, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:50:00,699 INFO L87 Difference]: Start difference. First operand 492 states and 493 transitions. Second operand 87 states. [2018-10-15 12:50:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:07,698 INFO L93 Difference]: Finished difference Result 516 states and 517 transitions. [2018-10-15 12:50:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 12:50:07,699 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 491 [2018-10-15 12:50:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:07,702 INFO L225 Difference]: With dead ends: 516 [2018-10-15 12:50:07,702 INFO L226 Difference]: Without dead ends: 516 [2018-10-15 12:50:07,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20243 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10998, Invalid=50258, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 12:50:07,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-10-15 12:50:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 503. [2018-10-15 12:50:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-10-15 12:50:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2018-10-15 12:50:07,708 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 491 [2018-10-15 12:50:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:07,708 INFO L481 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2018-10-15 12:50:07,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:50:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2018-10-15 12:50:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-10-15 12:50:07,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:07,710 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:07,710 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:07,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:07,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1594278465, now seen corresponding path program 53 times [2018-10-15 12:50:07,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 3996 proven. 2484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:11,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:11,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:50:11,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:50:11,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:50:11,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1681, Invalid=10975, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:50:11,424 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 113 states. [2018-10-15 12:50:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:19,914 INFO L93 Difference]: Finished difference Result 811 states and 812 transitions. [2018-10-15 12:50:19,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 12:50:19,914 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 502 [2018-10-15 12:50:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:19,916 INFO L225 Difference]: With dead ends: 811 [2018-10-15 12:50:19,916 INFO L226 Difference]: Without dead ends: 512 [2018-10-15 12:50:19,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17063 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=9710, Invalid=52540, Unknown=0, NotChecked=0, Total=62250 [2018-10-15 12:50:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-10-15 12:50:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2018-10-15 12:50:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-10-15 12:50:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 511 transitions. [2018-10-15 12:50:19,922 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 511 transitions. Word has length 502 [2018-10-15 12:50:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:19,922 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 511 transitions. [2018-10-15 12:50:19,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:50:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 511 transitions. [2018-10-15 12:50:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-15 12:50:19,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:19,925 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:19,925 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:19,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1890470681, now seen corresponding path program 54 times [2018-10-15 12:50:19,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 2674 proven. 3996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:22,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:22,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 12:50:22,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 12:50:22,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 12:50:22,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=6640, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:50:22,384 INFO L87 Difference]: Start difference. First operand 510 states and 511 transitions. Second operand 90 states. [2018-10-15 12:50:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:29,885 INFO L93 Difference]: Finished difference Result 534 states and 535 transitions. [2018-10-15 12:50:29,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 12:50:29,886 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 509 [2018-10-15 12:50:29,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:29,889 INFO L225 Difference]: With dead ends: 534 [2018-10-15 12:50:29,889 INFO L226 Difference]: Without dead ends: 534 [2018-10-15 12:50:29,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21777 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11797, Invalid=53995, Unknown=0, NotChecked=0, Total=65792 [2018-10-15 12:50:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-10-15 12:50:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 521. [2018-10-15 12:50:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-10-15 12:50:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 522 transitions. [2018-10-15 12:50:29,894 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 522 transitions. Word has length 509 [2018-10-15 12:50:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:29,894 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 522 transitions. [2018-10-15 12:50:29,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 12:50:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 522 transitions. [2018-10-15 12:50:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-10-15 12:50:29,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:29,897 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:29,897 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:29,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash -248770030, now seen corresponding path program 55 times [2018-10-15 12:50:29,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 4298 proven. 2674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:33,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:33,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:50:33,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:50:33,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:50:33,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1799, Invalid=11773, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:50:33,597 INFO L87 Difference]: Start difference. First operand 521 states and 522 transitions. Second operand 117 states. [2018-10-15 12:50:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:43,397 INFO L93 Difference]: Finished difference Result 840 states and 841 transitions. [2018-10-15 12:50:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 12:50:43,397 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 520 [2018-10-15 12:50:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:43,399 INFO L225 Difference]: With dead ends: 840 [2018-10-15 12:50:43,399 INFO L226 Difference]: Without dead ends: 530 [2018-10-15 12:50:43,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18353 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=10405, Invalid=56417, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 12:50:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-15 12:50:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2018-10-15 12:50:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-15 12:50:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2018-10-15 12:50:43,404 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 520 [2018-10-15 12:50:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:43,404 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2018-10-15 12:50:43,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:50:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2018-10-15 12:50:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-15 12:50:43,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:43,407 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:43,407 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:43,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1335103290, now seen corresponding path program 56 times [2018-10-15 12:50:43,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7169 backedges. 2871 proven. 4298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:46,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:46,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:50:46,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:50:46,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:50:46,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1462, Invalid=7094, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:50:46,148 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 93 states. [2018-10-15 12:50:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:53,960 INFO L93 Difference]: Finished difference Result 552 states and 553 transitions. [2018-10-15 12:50:53,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 12:50:53,961 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 527 [2018-10-15 12:50:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:53,963 INFO L225 Difference]: With dead ends: 552 [2018-10-15 12:50:53,963 INFO L226 Difference]: Without dead ends: 552 [2018-10-15 12:50:53,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12624, Invalid=57866, Unknown=0, NotChecked=0, Total=70490 [2018-10-15 12:50:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-15 12:50:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 539. [2018-10-15 12:50:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-15 12:50:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 540 transitions. [2018-10-15 12:50:53,969 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 540 transitions. Word has length 527 [2018-10-15 12:50:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:53,969 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 540 transitions. [2018-10-15 12:50:53,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:50:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 540 transitions. [2018-10-15 12:50:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-15 12:50:53,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:53,971 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:53,972 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:53,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash -966388257, now seen corresponding path program 57 times [2018-10-15 12:50:53,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 4611 proven. 2871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:58,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:58,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 12:50:58,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 12:50:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 12:50:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1921, Invalid=12599, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:50:58,072 INFO L87 Difference]: Start difference. First operand 539 states and 540 transitions. Second operand 121 states. [2018-10-15 12:51:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:08,595 INFO L93 Difference]: Finished difference Result 869 states and 870 transitions. [2018-10-15 12:51:08,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 12:51:08,595 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 538 [2018-10-15 12:51:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:08,597 INFO L225 Difference]: With dead ends: 869 [2018-10-15 12:51:08,597 INFO L226 Difference]: Without dead ends: 548 [2018-10-15 12:51:08,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19690 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=11124, Invalid=60432, Unknown=0, NotChecked=0, Total=71556 [2018-10-15 12:51:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-10-15 12:51:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2018-10-15 12:51:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-10-15 12:51:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 547 transitions. [2018-10-15 12:51:08,602 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 547 transitions. Word has length 538 [2018-10-15 12:51:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:08,602 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 547 transitions. [2018-10-15 12:51:08,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 12:51:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 547 transitions. [2018-10-15 12:51:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-10-15 12:51:08,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:08,605 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:08,605 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:08,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2118654215, now seen corresponding path program 58 times [2018-10-15 12:51:08,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7686 backedges. 3075 proven. 4611 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:11,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:11,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 12:51:11,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 12:51:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 12:51:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=7563, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 12:51:11,404 INFO L87 Difference]: Start difference. First operand 546 states and 547 transitions. Second operand 96 states. [2018-10-15 12:51:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:19,666 INFO L93 Difference]: Finished difference Result 570 states and 571 transitions. [2018-10-15 12:51:19,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 12:51:19,666 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 545 [2018-10-15 12:51:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:19,668 INFO L225 Difference]: With dead ends: 570 [2018-10-15 12:51:19,668 INFO L226 Difference]: Without dead ends: 570 [2018-10-15 12:51:19,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25013 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13479, Invalid=61871, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 12:51:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-10-15 12:51:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 557. [2018-10-15 12:51:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-15 12:51:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 558 transitions. [2018-10-15 12:51:19,675 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 558 transitions. Word has length 545 [2018-10-15 12:51:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:19,675 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 558 transitions. [2018-10-15 12:51:19,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 12:51:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 558 transitions. [2018-10-15 12:51:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-10-15 12:51:19,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:19,678 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:19,678 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:19,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2025596430, now seen corresponding path program 59 times [2018-10-15 12:51:19,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 4935 proven. 3075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:24,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:24,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 12:51:24,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 12:51:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 12:51:24,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=13453, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 12:51:24,080 INFO L87 Difference]: Start difference. First operand 557 states and 558 transitions. Second operand 125 states. [2018-10-15 12:51:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:35,398 INFO L93 Difference]: Finished difference Result 898 states and 899 transitions. [2018-10-15 12:51:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 12:51:35,398 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 556 [2018-10-15 12:51:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:35,400 INFO L225 Difference]: With dead ends: 898 [2018-10-15 12:51:35,400 INFO L226 Difference]: Without dead ends: 566 [2018-10-15 12:51:35,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21074 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=11867, Invalid=64585, Unknown=0, NotChecked=0, Total=76452 [2018-10-15 12:51:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-10-15 12:51:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 564. [2018-10-15 12:51:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-10-15 12:51:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 565 transitions. [2018-10-15 12:51:35,406 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 565 transitions. Word has length 556 [2018-10-15 12:51:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:35,406 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 565 transitions. [2018-10-15 12:51:35,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 12:51:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 565 transitions. [2018-10-15 12:51:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-10-15 12:51:35,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:35,409 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:35,409 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:35,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash -328572134, now seen corresponding path program 60 times [2018-10-15 12:51:35,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8221 backedges. 3286 proven. 4935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:38,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:38,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:51:38,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:51:38,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:51:38,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=8047, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:51:38,436 INFO L87 Difference]: Start difference. First operand 564 states and 565 transitions. Second operand 99 states. [2018-10-15 12:51:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:47,295 INFO L93 Difference]: Finished difference Result 588 states and 589 transitions. [2018-10-15 12:51:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 12:51:47,296 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 563 [2018-10-15 12:51:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:47,298 INFO L225 Difference]: With dead ends: 588 [2018-10-15 12:51:47,298 INFO L226 Difference]: Without dead ends: 588 [2018-10-15 12:51:47,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26715 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14362, Invalid=66010, Unknown=0, NotChecked=0, Total=80372 [2018-10-15 12:51:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-10-15 12:51:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 575. [2018-10-15 12:51:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-10-15 12:51:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2018-10-15 12:51:47,305 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 563 [2018-10-15 12:51:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:47,305 INFO L481 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2018-10-15 12:51:47,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:51:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2018-10-15 12:51:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-10-15 12:51:47,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:47,308 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:47,308 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:47,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:47,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1004443135, now seen corresponding path program 61 times [2018-10-15 12:51:47,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 5270 proven. 3286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:51,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:51,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 12:51:51,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 12:51:51,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 12:51:51,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2177, Invalid=14335, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 12:51:51,797 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 129 states. [2018-10-15 12:52:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:03,386 INFO L93 Difference]: Finished difference Result 927 states and 928 transitions. [2018-10-15 12:52:03,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 12:52:03,386 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 574 [2018-10-15 12:52:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:03,388 INFO L225 Difference]: With dead ends: 927 [2018-10-15 12:52:03,388 INFO L226 Difference]: Without dead ends: 584 [2018-10-15 12:52:03,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22505 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=12634, Invalid=68876, Unknown=0, NotChecked=0, Total=81510 [2018-10-15 12:52:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-10-15 12:52:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2018-10-15 12:52:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-10-15 12:52:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 583 transitions. [2018-10-15 12:52:03,394 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 583 transitions. Word has length 574 [2018-10-15 12:52:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:03,394 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 583 transitions. [2018-10-15 12:52:03,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 12:52:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 583 transitions. [2018-10-15 12:52:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2018-10-15 12:52:03,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:03,397 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:03,397 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:03,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:03,398 INFO L82 PathProgramCache]: Analyzing trace with hash 880026919, now seen corresponding path program 62 times [2018-10-15 12:52:03,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8774 backedges. 3504 proven. 5270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:06,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:06,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 12:52:06,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 12:52:06,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 12:52:06,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1756, Invalid=8546, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 12:52:06,355 INFO L87 Difference]: Start difference. First operand 582 states and 583 transitions. Second operand 102 states. [2018-10-15 12:52:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:15,247 INFO L93 Difference]: Finished difference Result 606 states and 607 transitions. [2018-10-15 12:52:15,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-10-15 12:52:15,248 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 581 [2018-10-15 12:52:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:15,251 INFO L225 Difference]: With dead ends: 606 [2018-10-15 12:52:15,251 INFO L226 Difference]: Without dead ends: 606 [2018-10-15 12:52:15,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28473 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15273, Invalid=70283, Unknown=0, NotChecked=0, Total=85556 [2018-10-15 12:52:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-10-15 12:52:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 593. [2018-10-15 12:52:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-10-15 12:52:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 594 transitions. [2018-10-15 12:52:15,258 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 594 transitions. Word has length 581 [2018-10-15 12:52:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:15,258 INFO L481 AbstractCegarLoop]: Abstraction has 593 states and 594 transitions. [2018-10-15 12:52:15,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 12:52:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 594 transitions. [2018-10-15 12:52:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-10-15 12:52:15,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:15,261 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:15,261 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:15,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash -947062318, now seen corresponding path program 63 times [2018-10-15 12:52:15,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 5616 proven. 3504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:19,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:19,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 12:52:19,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 12:52:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 12:52:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2311, Invalid=15245, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:52:19,953 INFO L87 Difference]: Start difference. First operand 593 states and 594 transitions. Second operand 133 states. [2018-10-15 12:52:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:32,191 INFO L93 Difference]: Finished difference Result 956 states and 957 transitions. [2018-10-15 12:52:32,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 12:52:32,191 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 592 [2018-10-15 12:52:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:32,193 INFO L225 Difference]: With dead ends: 956 [2018-10-15 12:52:32,193 INFO L226 Difference]: Without dead ends: 602 [2018-10-15 12:52:32,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23983 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=13425, Invalid=73305, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 12:52:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-10-15 12:52:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-10-15 12:52:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-15 12:52:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 601 transitions. [2018-10-15 12:52:32,198 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 601 transitions. Word has length 592 [2018-10-15 12:52:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:32,199 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 601 transitions. [2018-10-15 12:52:32,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 12:52:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 601 transitions. [2018-10-15 12:52:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 12:52:32,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:32,202 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:32,202 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:32,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:32,202 INFO L82 PathProgramCache]: Analyzing trace with hash -199487750, now seen corresponding path program 64 times [2018-10-15 12:52:32,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9345 backedges. 3729 proven. 5616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:35,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:35,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:52:35,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:52:35,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:52:35,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1860, Invalid=9060, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:52:35,300 INFO L87 Difference]: Start difference. First operand 600 states and 601 transitions. Second operand 105 states. [2018-10-15 12:52:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:44,646 INFO L93 Difference]: Finished difference Result 624 states and 625 transitions. [2018-10-15 12:52:44,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-10-15 12:52:44,646 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 599 [2018-10-15 12:52:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:44,649 INFO L225 Difference]: With dead ends: 624 [2018-10-15 12:52:44,649 INFO L226 Difference]: Without dead ends: 624 [2018-10-15 12:52:44,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30287 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=16212, Invalid=74690, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 12:52:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-15 12:52:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 611. [2018-10-15 12:52:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-10-15 12:52:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 612 transitions. [2018-10-15 12:52:44,656 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 612 transitions. Word has length 599 [2018-10-15 12:52:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:44,656 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 612 transitions. [2018-10-15 12:52:44,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:52:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 612 transitions. [2018-10-15 12:52:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2018-10-15 12:52:44,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:44,659 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:44,659 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:44,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:44,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1871397345, now seen corresponding path program 65 times [2018-10-15 12:52:44,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:52:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 5973 proven. 3729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:52:49,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:52:49,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 12:52:49,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 12:52:49,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 12:52:49,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=16183, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 12:52:49,607 INFO L87 Difference]: Start difference. First operand 611 states and 612 transitions. Second operand 137 states. [2018-10-15 12:53:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:53:02,351 INFO L93 Difference]: Finished difference Result 985 states and 986 transitions. [2018-10-15 12:53:02,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 12:53:02,351 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 610 [2018-10-15 12:53:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:53:02,353 INFO L225 Difference]: With dead ends: 985 [2018-10-15 12:53:02,353 INFO L226 Difference]: Without dead ends: 620 [2018-10-15 12:53:02,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25508 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14240, Invalid=77872, Unknown=0, NotChecked=0, Total=92112 [2018-10-15 12:53:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-10-15 12:53:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 618. [2018-10-15 12:53:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-15 12:53:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 619 transitions. [2018-10-15 12:53:02,359 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 619 transitions. Word has length 610 [2018-10-15 12:53:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:53:02,359 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 619 transitions. [2018-10-15 12:53:02,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 12:53:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 619 transitions. [2018-10-15 12:53:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2018-10-15 12:53:02,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:53:02,362 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:53:02,362 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:53:02,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:53:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1944574279, now seen corresponding path program 66 times [2018-10-15 12:53:02,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:53:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:53:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9934 backedges. 3961 proven. 5973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:53:05,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:53:05,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 12:53:05,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 12:53:05,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 12:53:05,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1967, Invalid=9589, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:53:05,567 INFO L87 Difference]: Start difference. First operand 618 states and 619 transitions. Second operand 108 states. [2018-10-15 12:53:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:53:14,678 INFO L93 Difference]: Finished difference Result 642 states and 643 transitions. [2018-10-15 12:53:14,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-15 12:53:14,678 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 617 [2018-10-15 12:53:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:53:14,681 INFO L225 Difference]: With dead ends: 642 [2018-10-15 12:53:14,681 INFO L226 Difference]: Without dead ends: 642 [2018-10-15 12:53:14,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32157 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=17179, Invalid=79231, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 12:53:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-10-15 12:53:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 629. [2018-10-15 12:53:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-10-15 12:53:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 630 transitions. [2018-10-15 12:53:14,688 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 630 transitions. Word has length 617 [2018-10-15 12:53:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:53:14,688 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 630 transitions. [2018-10-15 12:53:14,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 12:53:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 630 transitions. [2018-10-15 12:53:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-10-15 12:53:14,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:53:14,692 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:53:14,692 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:53:14,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:53:14,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1354068402, now seen corresponding path program 67 times [2018-10-15 12:53:14,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:53:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:53:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 6341 proven. 3961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:53:19,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:53:19,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 12:53:19,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 12:53:19,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 12:53:19,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2591, Invalid=17149, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 12:53:19,801 INFO L87 Difference]: Start difference. First operand 629 states and 630 transitions. Second operand 141 states. [2018-10-15 12:53:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:53:33,276 INFO L93 Difference]: Finished difference Result 1014 states and 1015 transitions. [2018-10-15 12:53:33,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 12:53:33,277 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 628 [2018-10-15 12:53:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:53:33,279 INFO L225 Difference]: With dead ends: 1014 [2018-10-15 12:53:33,279 INFO L226 Difference]: Without dead ends: 638 [2018-10-15 12:53:33,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27080 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=15079, Invalid=82577, Unknown=0, NotChecked=0, Total=97656 [2018-10-15 12:53:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-10-15 12:53:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2018-10-15 12:53:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-10-15 12:53:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 637 transitions. [2018-10-15 12:53:33,285 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 637 transitions. Word has length 628 [2018-10-15 12:53:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:53:33,285 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 637 transitions. [2018-10-15 12:53:33,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 12:53:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 637 transitions. [2018-10-15 12:53:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-10-15 12:53:33,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:53:33,288 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:53:33,288 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:53:33,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:53:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2018972378, now seen corresponding path program 68 times [2018-10-15 12:53:33,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:53:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:53:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10541 backedges. 4200 proven. 6341 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:53:36,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:53:36,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:53:36,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:53:36,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:53:36,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=10133, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:53:36,695 INFO L87 Difference]: Start difference. First operand 636 states and 637 transitions. Second operand 111 states. [2018-10-15 12:53:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:53:45,687 INFO L93 Difference]: Finished difference Result 660 states and 661 transitions. [2018-10-15 12:53:45,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2018-10-15 12:53:45,688 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 635 [2018-10-15 12:53:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:53:45,691 INFO L225 Difference]: With dead ends: 660 [2018-10-15 12:53:45,691 INFO L226 Difference]: Without dead ends: 660 [2018-10-15 12:53:45,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34083 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=18174, Invalid=83906, Unknown=0, NotChecked=0, Total=102080 [2018-10-15 12:53:45,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-10-15 12:53:45,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 647. [2018-10-15 12:53:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-10-15 12:53:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 648 transitions. [2018-10-15 12:53:45,698 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 648 transitions. Word has length 635 [2018-10-15 12:53:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:53:45,699 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 648 transitions. [2018-10-15 12:53:45,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:53:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 648 transitions. [2018-10-15 12:53:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-15 12:53:45,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:53:45,702 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:53:45,702 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:53:45,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:53:45,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2042269247, now seen corresponding path program 69 times [2018-10-15 12:53:45,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:53:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:53:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 6720 proven. 4200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:53:51,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:53:51,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 12:53:51,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 12:53:51,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 12:53:51,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2737, Invalid=18143, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 12:53:51,233 INFO L87 Difference]: Start difference. First operand 647 states and 648 transitions. Second operand 145 states. [2018-10-15 12:54:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:54:01,479 INFO L93 Difference]: Finished difference Result 1043 states and 1044 transitions. [2018-10-15 12:54:01,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 12:54:01,479 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 646 [2018-10-15 12:54:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:54:01,481 INFO L225 Difference]: With dead ends: 1043 [2018-10-15 12:54:01,481 INFO L226 Difference]: Without dead ends: 656 [2018-10-15 12:54:01,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28699 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=15942, Invalid=87420, Unknown=0, NotChecked=0, Total=103362 [2018-10-15 12:54:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-10-15 12:54:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 654. [2018-10-15 12:54:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-15 12:54:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 655 transitions. [2018-10-15 12:54:01,488 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 655 transitions. Word has length 646 [2018-10-15 12:54:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:54:01,488 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 655 transitions. [2018-10-15 12:54:01,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 12:54:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 655 transitions. [2018-10-15 12:54:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2018-10-15 12:54:01,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:54:01,491 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:54:01,492 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:54:01,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:54:01,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1523239577, now seen corresponding path program 70 times [2018-10-15 12:54:01,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:54:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:54:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 11166 backedges. 4446 proven. 6720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:54:05,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:54:05,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-10-15 12:54:05,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-15 12:54:05,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-15 12:54:05,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2190, Invalid=10692, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 12:54:05,038 INFO L87 Difference]: Start difference. First operand 654 states and 655 transitions. Second operand 114 states. [2018-10-15 12:54:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:54:15,116 INFO L93 Difference]: Finished difference Result 678 states and 679 transitions. [2018-10-15 12:54:15,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2018-10-15 12:54:15,117 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 653 [2018-10-15 12:54:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:54:15,120 INFO L225 Difference]: With dead ends: 678 [2018-10-15 12:54:15,120 INFO L226 Difference]: Without dead ends: 678 [2018-10-15 12:54:15,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36065 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=19197, Invalid=88715, Unknown=0, NotChecked=0, Total=107912 [2018-10-15 12:54:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-10-15 12:54:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 665. [2018-10-15 12:54:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-10-15 12:54:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 666 transitions. [2018-10-15 12:54:15,128 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 666 transitions. Word has length 653 [2018-10-15 12:54:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:54:15,128 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 666 transitions. [2018-10-15 12:54:15,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-15 12:54:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 666 transitions. [2018-10-15 12:54:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2018-10-15 12:54:15,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:54:15,131 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:54:15,132 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:54:15,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:54:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 183189906, now seen corresponding path program 71 times [2018-10-15 12:54:15,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:54:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:54:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 7110 proven. 4446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:54:20,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:54:20,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 12:54:20,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 12:54:20,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 12:54:20,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2887, Invalid=19165, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 12:54:20,905 INFO L87 Difference]: Start difference. First operand 665 states and 666 transitions. Second operand 149 states. [2018-10-15 12:54:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:54:30,777 INFO L93 Difference]: Finished difference Result 1072 states and 1073 transitions. [2018-10-15 12:54:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-15 12:54:30,777 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 664 [2018-10-15 12:54:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:54:30,779 INFO L225 Difference]: With dead ends: 1072 [2018-10-15 12:54:30,779 INFO L226 Difference]: Without dead ends: 674 [2018-10-15 12:54:30,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30365 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=16829, Invalid=92401, Unknown=0, NotChecked=0, Total=109230 [2018-10-15 12:54:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-10-15 12:54:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 672. [2018-10-15 12:54:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-10-15 12:54:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 673 transitions. [2018-10-15 12:54:30,786 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 673 transitions. Word has length 664 [2018-10-15 12:54:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:54:30,786 INFO L481 AbstractCegarLoop]: Abstraction has 672 states and 673 transitions. [2018-10-15 12:54:30,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 12:54:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 673 transitions. [2018-10-15 12:54:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2018-10-15 12:54:30,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:54:30,789 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:54:30,789 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:54:30,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:54:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1414098618, now seen corresponding path program 72 times [2018-10-15 12:54:30,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:54:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:54:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11809 backedges. 4699 proven. 7110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:54:34,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:54:34,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:54:34,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:54:34,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:54:34,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2306, Invalid=11266, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:54:34,529 INFO L87 Difference]: Start difference. First operand 672 states and 673 transitions. Second operand 117 states.