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/count_by_nondet_true-unreach-call_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:26:37,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:26:37,617 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:26:37,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:26:37,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:26:37,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:26:37,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:26:37,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:26:37,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:26:37,636 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:26:37,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:26:37,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:26:37,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:26:37,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:26:37,640 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:26:37,641 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:26:37,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:26:37,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:26:37,646 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:26:37,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:26:37,648 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:26:37,649 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:26:37,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:26:37,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:26:37,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:26:37,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:26:37,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:26:37,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:26:37,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:26:37,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:26:37,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:26:37,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:26:37,658 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:26:37,659 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:26:37,660 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:26:37,661 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:26:37,661 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:26:37,670 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:26:37,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:26:37,672 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:26:37,672 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:26:37,672 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:26:37,672 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:26:37,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:26:37,673 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:26:37,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:26:37,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:26:37,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:26:37,674 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:26:37,674 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:26:37,675 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:26:37,675 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:26:37,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:26:37,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:26:37,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:26:37,749 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:26:37,750 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:26:37,751 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/count_by_nondet_true-unreach-call_true-termination.i_3.bpl [2018-10-15 12:26:37,751 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/count_by_nondet_true-unreach-call_true-termination.i_3.bpl' [2018-10-15 12:26:37,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:26:37,814 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:26:37,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:26:37,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:26:37,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:26:37,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:37" (1/1) ... [2018-10-15 12:26:37,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:37" (1/1) ... [2018-10-15 12:26:37,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:37" (1/1) ... [2018-10-15 12:26:37,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:37" (1/1) ... [2018-10-15 12:26:37,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:37" (1/1) ... [2018-10-15 12:26:37,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:37" (1/1) ... [2018-10-15 12:26:37,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:37" (1/1) ... [2018-10-15 12:26:37,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:26:37,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:26:37,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:26:37,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:26:37,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:37" (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:26:37,945 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:26:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:26:37,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:26:38,296 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:26:38,297 INFO L202 PluginConnector]: Adding new model count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:26:38 BoogieIcfgContainer [2018-10-15 12:26:38,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:26:38,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:26:38,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:26:38,302 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:26:38,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:37" (1/2) ... [2018-10-15 12:26:38,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe31a72 and model type count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:26:38, skipping insertion in model container [2018-10-15 12:26:38,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:26:38" (2/2) ... [2018-10-15 12:26:38,305 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_nondet_true-unreach-call_true-termination.i_3.bpl [2018-10-15 12:26:38,316 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:26:38,325 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:26:38,344 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:26:38,375 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:26:38,376 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:26:38,377 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:26:38,377 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:26:38,377 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:26:38,377 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:26:38,378 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:26:38,378 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:26:38,378 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:26:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-15 12:26:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 12:26:38,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:38,407 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:38,408 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:38,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1513587631, now seen corresponding path program 1 times [2018-10-15 12:26:38,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:38,661 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:26:38,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:26:38,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:26:38,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:26:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:26:38,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:26:38,685 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-15 12:26:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:38,780 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-15 12:26:38,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:26:38,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 12:26:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:38,795 INFO L225 Difference]: With dead ends: 25 [2018-10-15 12:26:38,796 INFO L226 Difference]: Without dead ends: 25 [2018-10-15 12:26:38,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:26:38,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-15 12:26:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-10-15 12:26:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-15 12:26:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-15 12:26:38,847 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2018-10-15 12:26:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:38,847 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-15 12:26:38,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:26:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-15 12:26:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 12:26:38,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:38,850 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:38,850 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:38,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash -779826883, now seen corresponding path program 1 times [2018-10-15 12:26:38,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:38,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:38,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:26:38,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:26:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:26:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:26:38,995 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 5 states. [2018-10-15 12:26:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:39,131 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 12:26:39,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:26:39,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-15 12:26:39,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:39,134 INFO L225 Difference]: With dead ends: 29 [2018-10-15 12:26:39,135 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 12:26:39,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:26:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 12:26:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-15 12:26:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 12:26:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 12:26:39,145 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2018-10-15 12:26:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:39,146 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 12:26:39,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:26:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 12:26:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 12:26:39,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:39,149 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:39,149 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:39,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:39,150 INFO L82 PathProgramCache]: Analyzing trace with hash 445793745, now seen corresponding path program 2 times [2018-10-15 12:26:39,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:39,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:39,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:26:39,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:26:39,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:26:39,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:26:39,368 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 9 states. [2018-10-15 12:26:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:39,983 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 12:26:39,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:26:39,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-15 12:26:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:39,986 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:26:39,986 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 12:26:39,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:26:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 12:26:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-10-15 12:26:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 12:26:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 12:26:39,993 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2018-10-15 12:26:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:39,994 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 12:26:39,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:26:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 12:26:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 12:26:39,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:39,996 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:39,998 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:39,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:39,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2103816125, now seen corresponding path program 3 times [2018-10-15 12:26:40,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:40,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:40,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:26:40,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:26:40,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:26:40,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:26:40,211 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 11 states. [2018-10-15 12:26:40,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:40,798 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 12:26:40,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 12:26:40,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-15 12:26:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:40,802 INFO L225 Difference]: With dead ends: 58 [2018-10-15 12:26:40,803 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:26:40,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:26:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:26:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-10-15 12:26:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 12:26:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 12:26:40,811 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 37 [2018-10-15 12:26:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:40,812 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 12:26:40,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:26:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 12:26:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 12:26:40,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:40,814 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:40,814 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:40,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:40,815 INFO L82 PathProgramCache]: Analyzing trace with hash -351490223, now seen corresponding path program 4 times [2018-10-15 12:26:40,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:41,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:41,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:26:41,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:26:41,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:26:41,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:26:41,034 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 13 states. [2018-10-15 12:26:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:41,628 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-15 12:26:41,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:26:41,629 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-10-15 12:26:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:41,630 INFO L225 Difference]: With dead ends: 67 [2018-10-15 12:26:41,630 INFO L226 Difference]: Without dead ends: 63 [2018-10-15 12:26:41,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:26:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-15 12:26:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-10-15 12:26:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 12:26:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 12:26:41,638 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 46 [2018-10-15 12:26:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:41,639 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 12:26:41,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:26:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 12:26:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 12:26:41,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:41,641 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:41,641 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:41,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:41,642 INFO L82 PathProgramCache]: Analyzing trace with hash -632687043, now seen corresponding path program 5 times [2018-10-15 12:26:41,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:41,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:41,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:26:41,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:26:41,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:26:41,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:26:41,994 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 15 states. [2018-10-15 12:26:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:42,252 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 12:26:42,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:26:42,252 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-10-15 12:26:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:42,255 INFO L225 Difference]: With dead ends: 76 [2018-10-15 12:26:42,255 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 12:26:42,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:26:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 12:26:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2018-10-15 12:26:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 12:26:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 12:26:42,262 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 55 [2018-10-15 12:26:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:42,263 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 12:26:42,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:26:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 12:26:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 12:26:42,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:42,265 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:42,265 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:42,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash 139442385, now seen corresponding path program 6 times [2018-10-15 12:26:42,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:42,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:42,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:26:42,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:26:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:26:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:26:42,529 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 17 states. [2018-10-15 12:26:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:42,863 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-15 12:26:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:26:42,863 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-10-15 12:26:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:42,864 INFO L225 Difference]: With dead ends: 85 [2018-10-15 12:26:42,864 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 12:26:42,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:26:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 12:26:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-10-15 12:26:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 12:26:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-15 12:26:42,872 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 64 [2018-10-15 12:26:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:42,873 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-15 12:26:42,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:26:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-15 12:26:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 12:26:42,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:42,875 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:42,875 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:42,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:42,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1306944323, now seen corresponding path program 7 times [2018-10-15 12:26:42,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:43,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:43,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:26:43,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:26:43,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:26:43,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:26:43,127 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 19 states. [2018-10-15 12:26:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:43,704 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 12:26:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 12:26:43,705 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-10-15 12:26:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:43,706 INFO L225 Difference]: With dead ends: 94 [2018-10-15 12:26:43,707 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:26:43,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=858, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:26:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:26:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-10-15 12:26:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 12:26:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 12:26:43,722 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 73 [2018-10-15 12:26:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:43,724 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 12:26:43,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:26:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 12:26:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:26:43,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:43,726 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:43,726 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:43,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:43,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1299407441, now seen corresponding path program 8 times [2018-10-15 12:26:43,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:44,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:44,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:26:44,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:26:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:26:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:26:44,170 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 21 states. [2018-10-15 12:26:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:44,728 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-15 12:26:44,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:26:44,729 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-10-15 12:26:44,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:44,730 INFO L225 Difference]: With dead ends: 103 [2018-10-15 12:26:44,730 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 12:26:44,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:26:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 12:26:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2018-10-15 12:26:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 12:26:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-15 12:26:44,740 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 82 [2018-10-15 12:26:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:44,741 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-15 12:26:44,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:26:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-15 12:26:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 12:26:44,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:44,743 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:44,743 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:44,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:44,744 INFO L82 PathProgramCache]: Analyzing trace with hash 616342333, now seen corresponding path program 9 times [2018-10-15 12:26:44,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:45,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:45,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:26:45,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:26:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:26:45,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:26:45,069 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 23 states. [2018-10-15 12:26:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:45,462 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-15 12:26:45,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 12:26:45,463 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-10-15 12:26:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:45,464 INFO L225 Difference]: With dead ends: 112 [2018-10-15 12:26:45,465 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:26:45,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:26:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:26:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-10-15 12:26:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 12:26:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 12:26:45,473 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 91 [2018-10-15 12:26:45,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:45,473 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 12:26:45,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:26:45,473 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 12:26:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:26:45,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:45,478 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:45,478 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:45,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:45,479 INFO L82 PathProgramCache]: Analyzing trace with hash -7361583, now seen corresponding path program 10 times [2018-10-15 12:26:45,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:45,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:45,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:26:45,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:26:45,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:26:45,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:26:45,817 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 25 states. [2018-10-15 12:26:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:46,282 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-15 12:26:46,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:26:46,283 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-10-15 12:26:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:46,283 INFO L225 Difference]: With dead ends: 121 [2018-10-15 12:26:46,284 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 12:26:46,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=617, Invalid=1545, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:26:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 12:26:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2018-10-15 12:26:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 12:26:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 12:26:46,289 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 100 [2018-10-15 12:26:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:46,290 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 12:26:46,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:26:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 12:26:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:26:46,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:46,292 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:46,292 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:46,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:46,292 INFO L82 PathProgramCache]: Analyzing trace with hash 672860605, now seen corresponding path program 11 times [2018-10-15 12:26:46,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:46,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:46,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:26:46,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:26:46,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:26:46,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:26:46,676 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 27 states. [2018-10-15 12:26:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:47,353 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-15 12:26:47,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:26:47,354 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 109 [2018-10-15 12:26:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:47,355 INFO L225 Difference]: With dead ends: 130 [2018-10-15 12:26:47,355 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 12:26:47,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=732, Invalid=1818, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:26:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 12:26:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-10-15 12:26:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 12:26:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 12:26:47,361 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 109 [2018-10-15 12:26:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:47,362 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 12:26:47,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:26:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 12:26:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:26:47,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:47,363 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:47,363 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:47,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1304204625, now seen corresponding path program 12 times [2018-10-15 12:26:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 606 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:47,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:47,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:26:47,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:26:47,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:26:47,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:26:47,823 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 29 states. [2018-10-15 12:26:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:48,604 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-15 12:26:48,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:26:48,605 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-10-15 12:26:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:48,606 INFO L225 Difference]: With dead ends: 139 [2018-10-15 12:26:48,606 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 12:26:48,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=857, Invalid=2113, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:26:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 12:26:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2018-10-15 12:26:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 12:26:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 12:26:48,614 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 118 [2018-10-15 12:26:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:48,614 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 12:26:48,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:26:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 12:26:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:26:48,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:48,616 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:48,617 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:48,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:48,617 INFO L82 PathProgramCache]: Analyzing trace with hash 136106045, now seen corresponding path program 13 times [2018-10-15 12:26:48,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:49,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:49,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:26:49,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:26:49,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:26:49,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:26:49,368 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 31 states. [2018-10-15 12:26:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:49,976 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 12:26:49,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:26:49,976 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 127 [2018-10-15 12:26:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:49,978 INFO L225 Difference]: With dead ends: 148 [2018-10-15 12:26:49,978 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 12:26:49,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=992, Invalid=2430, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:26:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 12:26:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2018-10-15 12:26:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 12:26:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 12:26:49,984 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 127 [2018-10-15 12:26:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:49,985 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 12:26:49,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:26:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 12:26:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:26:49,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:49,986 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:49,986 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:49,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash -787341615, now seen corresponding path program 14 times [2018-10-15 12:26:49,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:50,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:50,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:26:50,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:26:50,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:26:50,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:26:50,386 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 33 states. [2018-10-15 12:26:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:51,197 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-15 12:26:51,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:26:51,198 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 136 [2018-10-15 12:26:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:51,200 INFO L225 Difference]: With dead ends: 157 [2018-10-15 12:26:51,200 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:26:51,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1137, Invalid=2769, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:26:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:26:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2018-10-15 12:26:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 12:26:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 12:26:51,205 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 136 [2018-10-15 12:26:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:51,206 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 12:26:51,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:26:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 12:26:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:26:51,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:51,207 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:51,208 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:51,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash -425068867, now seen corresponding path program 15 times [2018-10-15 12:26:51,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:51,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:51,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:26:51,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:26:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:26:51,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:26:51,925 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 35 states. [2018-10-15 12:26:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:52,739 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-15 12:26:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:26:52,739 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 145 [2018-10-15 12:26:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:52,741 INFO L225 Difference]: With dead ends: 166 [2018-10-15 12:26:52,741 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 12:26:52,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1292, Invalid=3130, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:26:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 12:26:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2018-10-15 12:26:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:26:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 12:26:52,747 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 145 [2018-10-15 12:26:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:52,748 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 12:26:52,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:26:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 12:26:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:26:52,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:52,749 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:52,749 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:52,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash 212355153, now seen corresponding path program 16 times [2018-10-15 12:26:52,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:53,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:53,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:26:53,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:26:53,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:26:53,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:26:53,665 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 37 states. [2018-10-15 12:26:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:54,465 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-15 12:26:54,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:26:54,465 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 154 [2018-10-15 12:26:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:54,467 INFO L225 Difference]: With dead ends: 175 [2018-10-15 12:26:54,467 INFO L226 Difference]: Without dead ends: 171 [2018-10-15 12:26:54,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1457, Invalid=3513, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:26:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-15 12:26:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-10-15 12:26:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:26:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-15 12:26:54,473 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 154 [2018-10-15 12:26:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:54,474 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-15 12:26:54,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:26:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-15 12:26:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:26:54,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:54,475 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:54,475 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:54,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1001028925, now seen corresponding path program 17 times [2018-10-15 12:26:54,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:55,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:55,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:26:55,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:26:55,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:26:55,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:26:55,974 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 39 states. [2018-10-15 12:26:57,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:57,231 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 12:26:57,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 12:26:57,231 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 163 [2018-10-15 12:26:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:57,233 INFO L225 Difference]: With dead ends: 184 [2018-10-15 12:26:57,233 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 12:26:57,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1632, Invalid=3918, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:26:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 12:26:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2018-10-15 12:26:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 12:26:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 12:26:57,239 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 163 [2018-10-15 12:26:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:57,240 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 12:26:57,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:26:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 12:26:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:26:57,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:57,241 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:57,241 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:57,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash -308866607, now seen corresponding path program 18 times [2018-10-15 12:26:57,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:57,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:57,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:26:57,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:26:57,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:26:57,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:26:57,912 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 41 states. [2018-10-15 12:26:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:58,981 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-15 12:26:58,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:26:58,982 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-10-15 12:26:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:58,984 INFO L225 Difference]: With dead ends: 193 [2018-10-15 12:26:58,984 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 12:26:58,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1817, Invalid=4345, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:26:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 12:26:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2018-10-15 12:26:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:26:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-15 12:26:58,990 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 172 [2018-10-15 12:26:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:58,990 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-15 12:26:58,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:26:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-15 12:26:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:26:58,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:58,992 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:58,992 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:58,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1426482109, now seen corresponding path program 19 times [2018-10-15 12:26:58,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 1558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:59,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:59,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:26:59,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:26:59,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:26:59,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1362, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:26:59,716 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 43 states. [2018-10-15 12:27:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:00,795 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-15 12:27:00,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 12:27:00,796 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 181 [2018-10-15 12:27:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:00,797 INFO L225 Difference]: With dead ends: 202 [2018-10-15 12:27:00,797 INFO L226 Difference]: Without dead ends: 198 [2018-10-15 12:27:00,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2012, Invalid=4794, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:27:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-15 12:27:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-10-15 12:27:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 12:27:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 12:27:00,804 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 181 [2018-10-15 12:27:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:00,804 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 12:27:00,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:27:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 12:27:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:27:00,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:00,806 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:00,806 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:00,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1257667409, now seen corresponding path program 20 times [2018-10-15 12:27:00,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 0 proven. 1730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:02,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:02,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:27:02,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:27:02,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:27:02,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:27:02,430 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 45 states. [2018-10-15 12:27:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:03,629 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-15 12:27:03,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:27:03,629 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 190 [2018-10-15 12:27:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:03,631 INFO L225 Difference]: With dead ends: 211 [2018-10-15 12:27:03,631 INFO L226 Difference]: Without dead ends: 207 [2018-10-15 12:27:03,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2217, Invalid=5265, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:27:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-15 12:27:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2018-10-15 12:27:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:27:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 12:27:03,636 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 190 [2018-10-15 12:27:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:03,637 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 12:27:03,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:27:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 12:27:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:27:03,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:03,638 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:03,639 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:03,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:03,639 INFO L82 PathProgramCache]: Analyzing trace with hash -693786051, now seen corresponding path program 21 times [2018-10-15 12:27:03,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:04,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:04,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:27:04,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:27:04,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:27:04,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:27:04,448 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 47 states. [2018-10-15 12:27:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:05,714 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-15 12:27:05,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 12:27:05,721 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 199 [2018-10-15 12:27:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:05,722 INFO L225 Difference]: With dead ends: 220 [2018-10-15 12:27:05,723 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 12:27:05,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2432, Invalid=5758, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:27:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 12:27:05,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 209. [2018-10-15 12:27:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 12:27:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-15 12:27:05,728 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 199 [2018-10-15 12:27:05,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:05,728 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-15 12:27:05,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:27:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-15 12:27:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 12:27:05,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:05,729 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:05,730 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:05,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:05,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1709081809, now seen corresponding path program 22 times [2018-10-15 12:27:05,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 0 proven. 2101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:27:06,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:27:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:27:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=1773, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:27:06,600 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 49 states. [2018-10-15 12:27:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:08,212 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-15 12:27:08,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:27:08,212 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 208 [2018-10-15 12:27:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:08,215 INFO L225 Difference]: With dead ends: 229 [2018-10-15 12:27:08,215 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 12:27:08,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2657, Invalid=6273, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:27:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 12:27:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 218. [2018-10-15 12:27:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 12:27:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-15 12:27:08,220 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 208 [2018-10-15 12:27:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:08,221 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-15 12:27:08,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:27:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-15 12:27:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-15 12:27:08,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:08,222 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:08,223 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:08,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash 980439229, now seen corresponding path program 23 times [2018-10-15 12:27:08,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 0 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:09,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:09,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:27:09,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:27:09,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:27:09,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:27:09,241 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 51 states. [2018-10-15 12:27:10,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:10,794 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-15 12:27:10,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 12:27:10,795 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 217 [2018-10-15 12:27:10,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:10,797 INFO L225 Difference]: With dead ends: 238 [2018-10-15 12:27:10,797 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 12:27:10,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2892, Invalid=6810, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:27:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 12:27:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 227. [2018-10-15 12:27:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 12:27:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 12:27:10,803 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 217 [2018-10-15 12:27:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:10,804 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 12:27:10,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:27:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 12:27:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:27:10,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:10,805 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:10,805 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:10,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:10,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1768369745, now seen corresponding path program 24 times [2018-10-15 12:27:10,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 0 proven. 2508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:11,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:11,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:27:11,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:27:11,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:27:11,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=2077, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:27:11,810 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 53 states. [2018-10-15 12:27:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:13,568 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-15 12:27:13,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 12:27:13,568 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 226 [2018-10-15 12:27:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:13,570 INFO L225 Difference]: With dead ends: 247 [2018-10-15 12:27:13,571 INFO L226 Difference]: Without dead ends: 243 [2018-10-15 12:27:13,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3137, Invalid=7369, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:27:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-15 12:27:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 236. [2018-10-15 12:27:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 12:27:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 12:27:13,577 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 226 [2018-10-15 12:27:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:13,577 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 12:27:13,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:27:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 12:27:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 12:27:13,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:13,579 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:13,579 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:13,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:13,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1347311421, now seen corresponding path program 25 times [2018-10-15 12:27:13,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 0 proven. 2725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:15,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:15,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:27:15,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:27:15,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:27:15,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2238, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:27:15,728 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 55 states. [2018-10-15 12:27:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:17,879 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-15 12:27:17,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 12:27:17,886 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 235 [2018-10-15 12:27:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:17,887 INFO L225 Difference]: With dead ends: 256 [2018-10-15 12:27:17,887 INFO L226 Difference]: Without dead ends: 252 [2018-10-15 12:27:17,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3392, Invalid=7950, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:27:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-15 12:27:17,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-10-15 12:27:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 12:27:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-15 12:27:17,892 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 235 [2018-10-15 12:27:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:17,893 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-15 12:27:17,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:27:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-15 12:27:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-15 12:27:17,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:17,895 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:17,895 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:17,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:17,895 INFO L82 PathProgramCache]: Analyzing trace with hash -358058031, now seen corresponding path program 26 times [2018-10-15 12:27:17,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 0 proven. 2951 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:19,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:19,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:27:19,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:27:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:27:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=2405, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:27:19,239 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 57 states. [2018-10-15 12:27:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:21,082 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-15 12:27:21,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 12:27:21,083 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 244 [2018-10-15 12:27:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:21,084 INFO L225 Difference]: With dead ends: 265 [2018-10-15 12:27:21,085 INFO L226 Difference]: Without dead ends: 261 [2018-10-15 12:27:21,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3657, Invalid=8553, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:27:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-15 12:27:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2018-10-15 12:27:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 12:27:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-15 12:27:21,090 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 244 [2018-10-15 12:27:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:21,090 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-15 12:27:21,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:27:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-15 12:27:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 12:27:21,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:21,092 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:21,092 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:21,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1104691779, now seen corresponding path program 27 times [2018-10-15 12:27:21,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:22,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:22,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:27:22,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:27:22,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:27:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=2578, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:27:22,697 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 59 states. [2018-10-15 12:27:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:24,514 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-15 12:27:24,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 12:27:24,515 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 253 [2018-10-15 12:27:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:24,517 INFO L225 Difference]: With dead ends: 274 [2018-10-15 12:27:24,517 INFO L226 Difference]: Without dead ends: 270 [2018-10-15 12:27:24,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3932, Invalid=9178, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:27:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-15 12:27:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 263. [2018-10-15 12:27:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 12:27:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 12:27:24,522 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 253 [2018-10-15 12:27:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:24,523 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 12:27:24,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:27:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 12:27:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 12:27:24,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:24,524 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:24,524 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:24,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1757045073, now seen corresponding path program 28 times [2018-10-15 12:27:24,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3430 backedges. 0 proven. 3430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:26,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:26,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:27:26,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:27:26,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:27:26,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=2757, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:27:26,132 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 61 states. [2018-10-15 12:27:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:28,309 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-15 12:27:28,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 12:27:28,309 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 262 [2018-10-15 12:27:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:28,311 INFO L225 Difference]: With dead ends: 283 [2018-10-15 12:27:28,311 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 12:27:28,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4217, Invalid=9825, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:27:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 12:27:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2018-10-15 12:27:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 12:27:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-15 12:27:28,317 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 262 [2018-10-15 12:27:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:28,318 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-15 12:27:28,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:27:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-15 12:27:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-15 12:27:28,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:28,319 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:28,320 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:28,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2145682493, now seen corresponding path program 29 times [2018-10-15 12:27:28,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 0 proven. 3683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:29,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:29,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:27:29,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:27:29,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:27:29,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=2942, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:27:29,784 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 63 states. [2018-10-15 12:27:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:31,816 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-10-15 12:27:31,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 12:27:31,816 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 271 [2018-10-15 12:27:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:31,819 INFO L225 Difference]: With dead ends: 292 [2018-10-15 12:27:31,819 INFO L226 Difference]: Without dead ends: 288 [2018-10-15 12:27:31,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4512, Invalid=10494, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:27:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-15 12:27:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 281. [2018-10-15 12:27:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-15 12:27:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-15 12:27:31,825 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 271 [2018-10-15 12:27:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:31,825 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-15 12:27:31,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:27:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-15 12:27:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-15 12:27:31,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:31,827 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:31,827 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:31,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash -860558639, now seen corresponding path program 30 times [2018-10-15 12:27:31,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3945 backedges. 0 proven. 3945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:33,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:33,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:27:33,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:27:33,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:27:33,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=3133, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:27:33,522 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 65 states. [2018-10-15 12:27:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:37,122 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-15 12:27:37,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 12:27:37,123 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 280 [2018-10-15 12:27:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:37,125 INFO L225 Difference]: With dead ends: 301 [2018-10-15 12:27:37,125 INFO L226 Difference]: Without dead ends: 297 [2018-10-15 12:27:37,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4817, Invalid=11185, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:27:37,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-15 12:27:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 290. [2018-10-15 12:27:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:27:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 12:27:37,129 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 280 [2018-10-15 12:27:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:37,130 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 12:27:37,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:27:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 12:27:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:27:37,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:37,131 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:37,131 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:37,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1735174845, now seen corresponding path program 31 times [2018-10-15 12:27:37,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4216 backedges. 0 proven. 4216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:38,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:38,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:27:38,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:27:38,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:27:38,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1092, Invalid=3330, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:27:38,768 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 67 states. [2018-10-15 12:27:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:41,081 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-10-15 12:27:41,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 12:27:41,082 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 289 [2018-10-15 12:27:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:41,084 INFO L225 Difference]: With dead ends: 310 [2018-10-15 12:27:41,084 INFO L226 Difference]: Without dead ends: 306 [2018-10-15 12:27:41,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5132, Invalid=11898, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:27:41,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-15 12:27:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 299. [2018-10-15 12:27:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-15 12:27:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-15 12:27:41,089 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 289 [2018-10-15 12:27:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:41,089 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-15 12:27:41,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:27:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-15 12:27:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 12:27:41,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:41,091 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:41,092 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:41,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:41,092 INFO L82 PathProgramCache]: Analyzing trace with hash -374336431, now seen corresponding path program 32 times [2018-10-15 12:27:41,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 0 proven. 4496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:42,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:42,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:27:42,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:27:42,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:27:42,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1159, Invalid=3533, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:27:42,658 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 69 states. [2018-10-15 12:27:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:45,392 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-10-15 12:27:45,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 12:27:45,393 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 298 [2018-10-15 12:27:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:45,395 INFO L225 Difference]: With dead ends: 319 [2018-10-15 12:27:45,395 INFO L226 Difference]: Without dead ends: 315 [2018-10-15 12:27:45,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5457, Invalid=12633, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:27:45,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-15 12:27:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 308. [2018-10-15 12:27:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:27:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-10-15 12:27:45,401 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 298 [2018-10-15 12:27:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:45,401 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-10-15 12:27:45,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:27:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-10-15 12:27:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-15 12:27:45,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:45,403 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:45,403 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:45,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:45,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1666698947, now seen corresponding path program 33 times [2018-10-15 12:27:45,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4785 backedges. 0 proven. 4785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:47,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:47,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:27:47,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:27:47,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:27:47,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=3742, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:27:47,644 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 71 states. [2018-10-15 12:27:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:50,473 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-15 12:27:50,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 12:27:50,473 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 307 [2018-10-15 12:27:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:50,475 INFO L225 Difference]: With dead ends: 328 [2018-10-15 12:27:50,475 INFO L226 Difference]: Without dead ends: 324 [2018-10-15 12:27:50,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5792, Invalid=13390, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:27:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-15 12:27:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 317. [2018-10-15 12:27:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-15 12:27:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-15 12:27:50,480 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 307 [2018-10-15 12:27:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:50,480 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-15 12:27:50,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:27:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-15 12:27:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-15 12:27:50,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:50,482 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:50,483 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:50,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash -54272559, now seen corresponding path program 34 times [2018-10-15 12:27:50,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5083 backedges. 0 proven. 5083 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:52,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:52,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:27:52,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:27:52,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:27:52,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=3957, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:27:52,526 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 73 states. [2018-10-15 12:27:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:55,488 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-15 12:27:55,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 12:27:55,489 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 316 [2018-10-15 12:27:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:55,491 INFO L225 Difference]: With dead ends: 337 [2018-10-15 12:27:55,492 INFO L226 Difference]: Without dead ends: 333 [2018-10-15 12:27:55,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6137, Invalid=14169, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:27:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-15 12:27:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 326. [2018-10-15 12:27:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:27:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-15 12:27:55,497 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 316 [2018-10-15 12:27:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:55,498 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-15 12:27:55,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:27:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-15 12:27:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-15 12:27:55,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:55,500 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:55,500 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:55,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash 494868413, now seen corresponding path program 35 times [2018-10-15 12:27:55,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 5390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:57,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:57,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:27:57,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:27:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:27:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1372, Invalid=4178, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:27:57,343 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 75 states. [2018-10-15 12:28:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:00,556 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-15 12:28:00,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 12:28:00,557 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 325 [2018-10-15 12:28:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:00,559 INFO L225 Difference]: With dead ends: 346 [2018-10-15 12:28:00,559 INFO L226 Difference]: Without dead ends: 342 [2018-10-15 12:28:00,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6492, Invalid=14970, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:28:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-15 12:28:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 335. [2018-10-15 12:28:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-15 12:28:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-10-15 12:28:00,565 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 325 [2018-10-15 12:28:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:00,565 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-10-15 12:28:00,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:28:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-10-15 12:28:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-15 12:28:00,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:00,568 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:00,568 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:00,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash 755517265, now seen corresponding path program 36 times [2018-10-15 12:28:00,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5706 backedges. 0 proven. 5706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:02,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:02,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:28:02,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:28:02,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:28:02,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1447, Invalid=4405, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:28:02,457 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 77 states. [2018-10-15 12:28:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:05,611 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-10-15 12:28:05,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 12:28:05,612 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 334 [2018-10-15 12:28:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:05,614 INFO L225 Difference]: With dead ends: 355 [2018-10-15 12:28:05,614 INFO L226 Difference]: Without dead ends: 351 [2018-10-15 12:28:05,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6857, Invalid=15793, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:28:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-15 12:28:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 344. [2018-10-15 12:28:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:28:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 344 transitions. [2018-10-15 12:28:05,620 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 344 transitions. Word has length 334 [2018-10-15 12:28:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:05,621 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 344 transitions. [2018-10-15 12:28:05,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:28:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 344 transitions. [2018-10-15 12:28:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-15 12:28:05,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:05,623 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:05,623 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:05,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:05,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1037655613, now seen corresponding path program 37 times [2018-10-15 12:28:05,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6031 backedges. 0 proven. 6031 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:07,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:07,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:28:07,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:28:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:28:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1524, Invalid=4638, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:28:07,869 INFO L87 Difference]: Start difference. First operand 344 states and 344 transitions. Second operand 79 states. [2018-10-15 12:28:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:11,240 INFO L93 Difference]: Finished difference Result 364 states and 364 transitions. [2018-10-15 12:28:11,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 12:28:11,241 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 343 [2018-10-15 12:28:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:11,243 INFO L225 Difference]: With dead ends: 364 [2018-10-15 12:28:11,243 INFO L226 Difference]: Without dead ends: 360 [2018-10-15 12:28:11,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7232, Invalid=16638, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:28:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-15 12:28:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 353. [2018-10-15 12:28:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-15 12:28:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-15 12:28:11,248 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 343 [2018-10-15 12:28:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:11,249 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-15 12:28:11,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:28:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-15 12:28:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 12:28:11,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:11,250 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:11,251 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:11,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash 194334929, now seen corresponding path program 38 times [2018-10-15 12:28:11,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6365 backedges. 0 proven. 6365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:13,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:13,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:28:13,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:28:13,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:28:13,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=4877, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:28:13,700 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 81 states. [2018-10-15 12:28:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:16,928 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-10-15 12:28:16,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 12:28:16,929 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 352 [2018-10-15 12:28:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:16,931 INFO L225 Difference]: With dead ends: 373 [2018-10-15 12:28:16,931 INFO L226 Difference]: Without dead ends: 369 [2018-10-15 12:28:16,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7617, Invalid=17505, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:28:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-15 12:28:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2018-10-15 12:28:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-15 12:28:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-10-15 12:28:16,936 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 352 [2018-10-15 12:28:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:16,936 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-10-15 12:28:16,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:28:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-10-15 12:28:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-15 12:28:16,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:16,938 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:16,938 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:16,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:16,938 INFO L82 PathProgramCache]: Analyzing trace with hash 664732861, now seen corresponding path program 39 times [2018-10-15 12:28:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6708 backedges. 0 proven. 6708 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:20,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:20,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:28:20,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:28:20,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:28:20,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=5122, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:28:20,127 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 83 states. [2018-10-15 12:28:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:23,945 INFO L93 Difference]: Finished difference Result 382 states and 382 transitions. [2018-10-15 12:28:23,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 12:28:23,945 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 361 [2018-10-15 12:28:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:23,947 INFO L225 Difference]: With dead ends: 382 [2018-10-15 12:28:23,947 INFO L226 Difference]: Without dead ends: 378 [2018-10-15 12:28:23,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8012, Invalid=18394, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:28:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-10-15 12:28:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 371. [2018-10-15 12:28:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-15 12:28:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-10-15 12:28:23,953 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 361 [2018-10-15 12:28:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:23,953 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-10-15 12:28:23,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:28:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-10-15 12:28:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-15 12:28:23,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:23,956 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:23,956 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:23,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:23,956 INFO L82 PathProgramCache]: Analyzing trace with hash 327350865, now seen corresponding path program 40 times [2018-10-15 12:28:23,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7060 backedges. 0 proven. 7060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:26,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:26,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:28:26,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:28:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:28:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=5373, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:28:26,148 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 85 states. [2018-10-15 12:28:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:30,120 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-10-15 12:28:30,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 12:28:30,120 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 370 [2018-10-15 12:28:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:30,123 INFO L225 Difference]: With dead ends: 391 [2018-10-15 12:28:30,123 INFO L226 Difference]: Without dead ends: 387 [2018-10-15 12:28:30,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8417, Invalid=19305, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:28:30,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-15 12:28:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 380. [2018-10-15 12:28:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 12:28:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-10-15 12:28:30,128 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 370 [2018-10-15 12:28:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:30,128 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-10-15 12:28:30,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:28:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-10-15 12:28:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 12:28:30,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:30,130 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:30,130 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:30,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:30,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1522010941, now seen corresponding path program 41 times [2018-10-15 12:28:30,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7421 backedges. 0 proven. 7421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:32,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:32,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:28:32,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:28:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:28:32,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1852, Invalid=5630, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:28:32,485 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 87 states. [2018-10-15 12:28:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:36,803 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2018-10-15 12:28:36,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-15 12:28:36,804 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 379 [2018-10-15 12:28:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:36,806 INFO L225 Difference]: With dead ends: 400 [2018-10-15 12:28:36,806 INFO L226 Difference]: Without dead ends: 396 [2018-10-15 12:28:36,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8832, Invalid=20238, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:28:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-15 12:28:36,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 389. [2018-10-15 12:28:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-15 12:28:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-15 12:28:36,811 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 379 [2018-10-15 12:28:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:36,811 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-15 12:28:36,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:28:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-15 12:28:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-15 12:28:36,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:36,813 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:36,813 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:36,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash 703153105, now seen corresponding path program 42 times [2018-10-15 12:28:36,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7791 backedges. 0 proven. 7791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:39,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:39,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:28:39,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:28:39,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:28:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1939, Invalid=5893, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:28:39,374 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 89 states. [2018-10-15 12:28:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:43,294 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-10-15 12:28:43,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 12:28:43,295 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 388 [2018-10-15 12:28:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:43,297 INFO L225 Difference]: With dead ends: 409 [2018-10-15 12:28:43,297 INFO L226 Difference]: Without dead ends: 405 [2018-10-15 12:28:43,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9257, Invalid=21193, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:28:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-15 12:28:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 398. [2018-10-15 12:28:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-15 12:28:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-10-15 12:28:43,303 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 388 [2018-10-15 12:28:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:43,304 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-10-15 12:28:43,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:28:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-10-15 12:28:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-15 12:28:43,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:43,306 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:43,306 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:43,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:43,307 INFO L82 PathProgramCache]: Analyzing trace with hash 755790269, now seen corresponding path program 43 times [2018-10-15 12:28:43,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8170 backedges. 0 proven. 8170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:46,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:46,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:28:46,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:28:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:28:46,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2028, Invalid=6162, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:28:46,180 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 91 states. [2018-10-15 12:28:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:50,420 INFO L93 Difference]: Finished difference Result 418 states and 418 transitions. [2018-10-15 12:28:50,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-15 12:28:50,420 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 397 [2018-10-15 12:28:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:50,422 INFO L225 Difference]: With dead ends: 418 [2018-10-15 12:28:50,423 INFO L226 Difference]: Without dead ends: 414 [2018-10-15 12:28:50,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9692, Invalid=22170, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:28:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-15 12:28:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 407. [2018-10-15 12:28:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-15 12:28:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-10-15 12:28:50,427 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 397 [2018-10-15 12:28:50,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:50,428 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-10-15 12:28:50,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:28:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-10-15 12:28:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-15 12:28:50,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:50,430 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:50,430 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:50,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:50,431 INFO L82 PathProgramCache]: Analyzing trace with hash 501230929, now seen corresponding path program 44 times [2018-10-15 12:28:50,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8558 backedges. 0 proven. 8558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:53,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:53,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:28:53,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:28:53,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:28:53,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2119, Invalid=6437, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:28:53,085 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 93 states. [2018-10-15 12:28:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:57,623 INFO L93 Difference]: Finished difference Result 427 states and 427 transitions. [2018-10-15 12:28:57,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 12:28:57,623 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 406 [2018-10-15 12:28:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:57,626 INFO L225 Difference]: With dead ends: 427 [2018-10-15 12:28:57,626 INFO L226 Difference]: Without dead ends: 423 [2018-10-15 12:28:57,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10137, Invalid=23169, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:28:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-15 12:28:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 416. [2018-10-15 12:28:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:28:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-10-15 12:28:57,634 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 406 [2018-10-15 12:28:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:57,635 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-10-15 12:28:57,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:28:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-10-15 12:28:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-15 12:28:57,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:57,637 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:57,637 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:57,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:57,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1250179133, now seen corresponding path program 45 times [2018-10-15 12:28:57,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8955 backedges. 0 proven. 8955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:00,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:00,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:29:00,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:29:00,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:29:00,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2212, Invalid=6718, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:29:00,477 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 95 states. [2018-10-15 12:29:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:05,136 INFO L93 Difference]: Finished difference Result 436 states and 436 transitions. [2018-10-15 12:29:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 12:29:05,136 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 415 [2018-10-15 12:29:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:05,139 INFO L225 Difference]: With dead ends: 436 [2018-10-15 12:29:05,139 INFO L226 Difference]: Without dead ends: 432 [2018-10-15 12:29:05,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10592, Invalid=24190, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:29:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-10-15 12:29:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 425. [2018-10-15 12:29:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-15 12:29:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 425 transitions. [2018-10-15 12:29:05,144 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 425 transitions. Word has length 415 [2018-10-15 12:29:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:05,144 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 425 transitions. [2018-10-15 12:29:05,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:29:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 425 transitions. [2018-10-15 12:29:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-15 12:29:05,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:05,146 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:05,146 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:05,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash 679458513, now seen corresponding path program 46 times [2018-10-15 12:29:05,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9361 backedges. 0 proven. 9361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:07,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:07,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:29:07,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:29:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:29:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=7005, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:29:07,878 INFO L87 Difference]: Start difference. First operand 425 states and 425 transitions. Second operand 97 states. [2018-10-15 12:29:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:13,040 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-10-15 12:29:13,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 12:29:13,040 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 424 [2018-10-15 12:29:13,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:13,042 INFO L225 Difference]: With dead ends: 445 [2018-10-15 12:29:13,042 INFO L226 Difference]: Without dead ends: 441 [2018-10-15 12:29:13,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11057, Invalid=25233, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:29:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-10-15 12:29:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 434. [2018-10-15 12:29:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:29:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 434 transitions. [2018-10-15 12:29:13,048 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 434 transitions. Word has length 424 [2018-10-15 12:29:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:13,049 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 434 transitions. [2018-10-15 12:29:13,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:29:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 434 transitions. [2018-10-15 12:29:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-15 12:29:13,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:13,051 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:13,052 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:13,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:13,052 INFO L82 PathProgramCache]: Analyzing trace with hash 889675453, now seen corresponding path program 47 times [2018-10-15 12:29:13,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9776 backedges. 0 proven. 9776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:16,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:16,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:29:16,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:29:16,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:29:16,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2404, Invalid=7298, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:29:16,070 INFO L87 Difference]: Start difference. First operand 434 states and 434 transitions. Second operand 99 states. [2018-10-15 12:29:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:21,204 INFO L93 Difference]: Finished difference Result 454 states and 454 transitions. [2018-10-15 12:29:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-15 12:29:21,204 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 433 [2018-10-15 12:29:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:21,206 INFO L225 Difference]: With dead ends: 454 [2018-10-15 12:29:21,206 INFO L226 Difference]: Without dead ends: 450 [2018-10-15 12:29:21,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11532, Invalid=26298, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:29:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-10-15 12:29:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 443. [2018-10-15 12:29:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-15 12:29:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-10-15 12:29:21,211 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 433 [2018-10-15 12:29:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:21,211 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-10-15 12:29:21,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:29:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-10-15 12:29:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-15 12:29:21,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:21,214 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:21,214 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:21,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1826611281, now seen corresponding path program 48 times [2018-10-15 12:29:21,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10200 backedges. 0 proven. 10200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:24,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:24,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:29:24,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:29:24,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:29:24,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2503, Invalid=7597, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:29:24,116 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 101 states. [2018-10-15 12:29:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:29,446 INFO L93 Difference]: Finished difference Result 463 states and 463 transitions. [2018-10-15 12:29:29,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 12:29:29,446 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 442 [2018-10-15 12:29:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:29,448 INFO L225 Difference]: With dead ends: 463 [2018-10-15 12:29:29,448 INFO L226 Difference]: Without dead ends: 459 [2018-10-15 12:29:29,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12017, Invalid=27385, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:29:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-15 12:29:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 452. [2018-10-15 12:29:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-10-15 12:29:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 452 transitions. [2018-10-15 12:29:29,454 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 452 transitions. Word has length 442 [2018-10-15 12:29:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:29,455 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 452 transitions. [2018-10-15 12:29:29,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:29:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 452 transitions. [2018-10-15 12:29:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-10-15 12:29:29,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:29,457 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:29,457 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:29,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:29,457 INFO L82 PathProgramCache]: Analyzing trace with hash -998382275, now seen corresponding path program 49 times [2018-10-15 12:29:29,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10633 backedges. 0 proven. 10633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:32,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:32,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:29:32,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:29:32,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:29:32,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2604, Invalid=7902, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:29:32,827 INFO L87 Difference]: Start difference. First operand 452 states and 452 transitions. Second operand 103 states. [2018-10-15 12:29:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:38,138 INFO L93 Difference]: Finished difference Result 472 states and 472 transitions. [2018-10-15 12:29:38,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-15 12:29:38,139 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 451 [2018-10-15 12:29:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:38,141 INFO L225 Difference]: With dead ends: 472 [2018-10-15 12:29:38,142 INFO L226 Difference]: Without dead ends: 468 [2018-10-15 12:29:38,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12512, Invalid=28494, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:29:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-15 12:29:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 461. [2018-10-15 12:29:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-10-15 12:29:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 461 transitions. [2018-10-15 12:29:38,148 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 461 transitions. Word has length 451 [2018-10-15 12:29:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:38,149 INFO L481 AbstractCegarLoop]: Abstraction has 461 states and 461 transitions. [2018-10-15 12:29:38,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:29:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 461 transitions. [2018-10-15 12:29:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-10-15 12:29:38,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:38,152 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:38,152 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:38,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:38,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2014882257, now seen corresponding path program 50 times [2018-10-15 12:29:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11075 backedges. 0 proven. 11075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:41,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:41,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:29:41,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:29:41,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:29:41,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2707, Invalid=8213, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:29:41,658 INFO L87 Difference]: Start difference. First operand 461 states and 461 transitions. Second operand 105 states. [2018-10-15 12:29:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:47,336 INFO L93 Difference]: Finished difference Result 481 states and 481 transitions. [2018-10-15 12:29:47,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 12:29:47,337 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 460 [2018-10-15 12:29:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:47,339 INFO L225 Difference]: With dead ends: 481 [2018-10-15 12:29:47,339 INFO L226 Difference]: Without dead ends: 477 [2018-10-15 12:29:47,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13017, Invalid=29625, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:29:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-15 12:29:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 470. [2018-10-15 12:29:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-15 12:29:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 470 transitions. [2018-10-15 12:29:47,343 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 470 transitions. Word has length 460 [2018-10-15 12:29:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:47,344 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 470 transitions. [2018-10-15 12:29:47,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:29:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 470 transitions. [2018-10-15 12:29:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-15 12:29:47,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:47,348 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:47,348 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:47,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:47,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1496331331, now seen corresponding path program 51 times [2018-10-15 12:29:47,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:50,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:50,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:29:50,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:29:50,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:29:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2812, Invalid=8530, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:29:50,675 INFO L87 Difference]: Start difference. First operand 470 states and 470 transitions. Second operand 107 states. [2018-10-15 12:29:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:56,779 INFO L93 Difference]: Finished difference Result 490 states and 490 transitions. [2018-10-15 12:29:56,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-15 12:29:56,779 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 469 [2018-10-15 12:29:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:56,781 INFO L225 Difference]: With dead ends: 490 [2018-10-15 12:29:56,781 INFO L226 Difference]: Without dead ends: 486 [2018-10-15 12:29:56,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13532, Invalid=30778, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:29:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-15 12:29:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 479. [2018-10-15 12:29:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-15 12:29:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-15 12:29:56,787 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 469 [2018-10-15 12:29:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:56,788 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-15 12:29:56,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:29:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-15 12:29:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-15 12:29:56,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:56,790 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:56,790 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:56,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1052634287, now seen corresponding path program 52 times [2018-10-15 12:29:56,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11986 backedges. 0 proven. 11986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:00,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:00,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:30:00,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:30:00,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:30:00,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2919, Invalid=8853, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:30:00,187 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 109 states. [2018-10-15 12:30:06,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:06,650 INFO L93 Difference]: Finished difference Result 499 states and 499 transitions. [2018-10-15 12:30:06,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 12:30:06,650 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 478 [2018-10-15 12:30:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:06,652 INFO L225 Difference]: With dead ends: 499 [2018-10-15 12:30:06,652 INFO L226 Difference]: Without dead ends: 495 [2018-10-15 12:30:06,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14057, Invalid=31953, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:30:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-15 12:30:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 488. [2018-10-15 12:30:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-15 12:30:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 488 transitions. [2018-10-15 12:30:06,657 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 488 transitions. Word has length 478 [2018-10-15 12:30:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:06,657 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 488 transitions. [2018-10-15 12:30:06,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:30:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 488 transitions. [2018-10-15 12:30:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-10-15 12:30:06,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:06,660 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:06,660 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:06,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:06,660 INFO L82 PathProgramCache]: Analyzing trace with hash -538635715, now seen corresponding path program 53 times [2018-10-15 12:30:06,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12455 backedges. 0 proven. 12455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:10,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:10,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:30:10,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:30:10,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:30:10,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3028, Invalid=9182, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:30:10,264 INFO L87 Difference]: Start difference. First operand 488 states and 488 transitions. Second operand 111 states. [2018-10-15 12:30:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:16,650 INFO L93 Difference]: Finished difference Result 508 states and 508 transitions. [2018-10-15 12:30:16,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 12:30:16,651 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 487 [2018-10-15 12:30:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:16,654 INFO L225 Difference]: With dead ends: 508 [2018-10-15 12:30:16,654 INFO L226 Difference]: Without dead ends: 504 [2018-10-15 12:30:16,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14592, Invalid=33150, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:30:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-10-15 12:30:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 497. [2018-10-15 12:30:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-10-15 12:30:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 497 transitions. [2018-10-15 12:30:16,659 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 497 transitions. Word has length 487 [2018-10-15 12:30:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:16,660 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 497 transitions. [2018-10-15 12:30:16,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:30:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 497 transitions. [2018-10-15 12:30:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-10-15 12:30:16,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:16,662 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:16,662 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:16,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:16,662 INFO L82 PathProgramCache]: Analyzing trace with hash 695475409, now seen corresponding path program 54 times [2018-10-15 12:30:16,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12933 backedges. 0 proven. 12933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:20,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:20,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:30:20,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:30:20,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:30:20,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3139, Invalid=9517, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:30:20,467 INFO L87 Difference]: Start difference. First operand 497 states and 497 transitions. Second operand 113 states. [2018-10-15 12:30:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:27,116 INFO L93 Difference]: Finished difference Result 517 states and 517 transitions. [2018-10-15 12:30:27,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 12:30:27,116 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 496 [2018-10-15 12:30:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:27,119 INFO L225 Difference]: With dead ends: 517 [2018-10-15 12:30:27,119 INFO L226 Difference]: Without dead ends: 513 [2018-10-15 12:30:27,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15137, Invalid=34369, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:30:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-15 12:30:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 506. [2018-10-15 12:30:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-10-15 12:30:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 506 transitions. [2018-10-15 12:30:27,124 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 506 transitions. Word has length 496 [2018-10-15 12:30:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:27,125 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 506 transitions. [2018-10-15 12:30:27,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:30:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 506 transitions. [2018-10-15 12:30:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-10-15 12:30:27,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:27,127 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:27,127 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:27,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:27,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1235597501, now seen corresponding path program 55 times [2018-10-15 12:30:27,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13420 backedges. 0 proven. 13420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:30,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:30,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:30:30,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:30:30,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:30:30,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=9858, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:30:30,933 INFO L87 Difference]: Start difference. First operand 506 states and 506 transitions. Second operand 115 states. [2018-10-15 12:30:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:37,937 INFO L93 Difference]: Finished difference Result 526 states and 526 transitions. [2018-10-15 12:30:37,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-15 12:30:37,937 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 505 [2018-10-15 12:30:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:37,939 INFO L225 Difference]: With dead ends: 526 [2018-10-15 12:30:37,939 INFO L226 Difference]: Without dead ends: 522 [2018-10-15 12:30:37,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15692, Invalid=35610, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:30:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-15 12:30:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 515. [2018-10-15 12:30:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-15 12:30:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 515 transitions. [2018-10-15 12:30:37,944 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 515 transitions. Word has length 505 [2018-10-15 12:30:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:37,945 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 515 transitions. [2018-10-15 12:30:37,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:30:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 515 transitions. [2018-10-15 12:30:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-10-15 12:30:37,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:37,947 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:37,947 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:37,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2076624465, now seen corresponding path program 56 times [2018-10-15 12:30:37,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13916 backedges. 0 proven. 13916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:41,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:41,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:30:41,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:30:41,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:30:41,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3367, Invalid=10205, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:30:41,836 INFO L87 Difference]: Start difference. First operand 515 states and 515 transitions. Second operand 117 states. [2018-10-15 12:30:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:48,894 INFO L93 Difference]: Finished difference Result 535 states and 535 transitions. [2018-10-15 12:30:48,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 12:30:48,894 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 514 [2018-10-15 12:30:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:48,896 INFO L225 Difference]: With dead ends: 535 [2018-10-15 12:30:48,896 INFO L226 Difference]: Without dead ends: 531 [2018-10-15 12:30:48,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=16257, Invalid=36873, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:30:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-15 12:30:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 524. [2018-10-15 12:30:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-15 12:30:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 524 transitions. [2018-10-15 12:30:48,901 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 524 transitions. Word has length 514 [2018-10-15 12:30:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:48,902 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 524 transitions. [2018-10-15 12:30:48,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:30:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 524 transitions. [2018-10-15 12:30:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-10-15 12:30:48,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:48,904 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:48,904 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:48,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:48,904 INFO L82 PathProgramCache]: Analyzing trace with hash 335134525, now seen corresponding path program 57 times [2018-10-15 12:30:48,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14421 backedges. 0 proven. 14421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:53,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:53,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:30:53,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:30:53,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:30:53,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3484, Invalid=10558, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:30:53,250 INFO L87 Difference]: Start difference. First operand 524 states and 524 transitions. Second operand 119 states. [2018-10-15 12:31:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:00,480 INFO L93 Difference]: Finished difference Result 544 states and 544 transitions. [2018-10-15 12:31:00,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-15 12:31:00,480 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 523 [2018-10-15 12:31:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:00,482 INFO L225 Difference]: With dead ends: 544 [2018-10-15 12:31:00,482 INFO L226 Difference]: Without dead ends: 540 [2018-10-15 12:31:00,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=16832, Invalid=38158, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 12:31:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-15 12:31:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 533. [2018-10-15 12:31:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-10-15 12:31:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 533 transitions. [2018-10-15 12:31:00,488 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 533 transitions. Word has length 523 [2018-10-15 12:31:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:00,489 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 533 transitions. [2018-10-15 12:31:00,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:31:00,489 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 533 transitions. [2018-10-15 12:31:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-10-15 12:31:00,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:00,491 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:00,491 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:00,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash -313389103, now seen corresponding path program 58 times [2018-10-15 12:31:00,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14935 backedges. 0 proven. 14935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:04,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:04,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 12:31:04,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 12:31:04,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 12:31:04,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3603, Invalid=10917, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:31:04,933 INFO L87 Difference]: Start difference. First operand 533 states and 533 transitions. Second operand 121 states. [2018-10-15 12:31:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:12,338 INFO L93 Difference]: Finished difference Result 553 states and 553 transitions. [2018-10-15 12:31:12,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 12:31:12,338 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 532 [2018-10-15 12:31:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:12,340 INFO L225 Difference]: With dead ends: 553 [2018-10-15 12:31:12,340 INFO L226 Difference]: Without dead ends: 549 [2018-10-15 12:31:12,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=17417, Invalid=39465, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 12:31:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-10-15 12:31:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 542. [2018-10-15 12:31:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-10-15 12:31:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 542 transitions. [2018-10-15 12:31:12,345 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 542 transitions. Word has length 532 [2018-10-15 12:31:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:12,346 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 542 transitions. [2018-10-15 12:31:12,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 12:31:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 542 transitions. [2018-10-15 12:31:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-10-15 12:31:12,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:12,348 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:12,348 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:12,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:12,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1154033085, now seen corresponding path program 59 times [2018-10-15 12:31:12,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15458 backedges. 0 proven. 15458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:16,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:16,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 12:31:16,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 12:31:16,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 12:31:16,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3724, Invalid=11282, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:31:16,717 INFO L87 Difference]: Start difference. First operand 542 states and 542 transitions. Second operand 123 states. [2018-10-15 12:31:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:24,557 INFO L93 Difference]: Finished difference Result 562 states and 562 transitions. [2018-10-15 12:31:24,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-15 12:31:24,557 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 541 [2018-10-15 12:31:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:24,560 INFO L225 Difference]: With dead ends: 562 [2018-10-15 12:31:24,560 INFO L226 Difference]: Without dead ends: 558 [2018-10-15 12:31:24,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=18012, Invalid=40794, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 12:31:24,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-10-15 12:31:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 551. [2018-10-15 12:31:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-10-15 12:31:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 551 transitions. [2018-10-15 12:31:24,566 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 551 transitions. Word has length 541 [2018-10-15 12:31:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:24,566 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 551 transitions. [2018-10-15 12:31:24,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 12:31:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 551 transitions. [2018-10-15 12:31:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-10-15 12:31:24,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:24,569 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:24,569 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:24,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:24,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1657931439, now seen corresponding path program 60 times [2018-10-15 12:31:24,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 15990 backedges. 0 proven. 15990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:29,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:29,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 12:31:29,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 12:31:29,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 12:31:29,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3847, Invalid=11653, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 12:31:29,280 INFO L87 Difference]: Start difference. First operand 551 states and 551 transitions. Second operand 125 states. [2018-10-15 12:31:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:37,369 INFO L93 Difference]: Finished difference Result 571 states and 571 transitions. [2018-10-15 12:31:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 12:31:37,370 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 550 [2018-10-15 12:31:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:37,372 INFO L225 Difference]: With dead ends: 571 [2018-10-15 12:31:37,372 INFO L226 Difference]: Without dead ends: 567 [2018-10-15 12:31:37,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11158 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=18617, Invalid=42145, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 12:31:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-10-15 12:31:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 560. [2018-10-15 12:31:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-15 12:31:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 560 transitions. [2018-10-15 12:31:37,378 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 560 transitions. Word has length 550 [2018-10-15 12:31:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:37,378 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 560 transitions. [2018-10-15 12:31:37,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 12:31:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 560 transitions. [2018-10-15 12:31:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 12:31:37,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:37,381 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:37,381 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:37,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:37,382 INFO L82 PathProgramCache]: Analyzing trace with hash 939256893, now seen corresponding path program 61 times [2018-10-15 12:31:37,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16531 backedges. 0 proven. 16531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:42,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:42,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 12:31:42,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 12:31:42,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 12:31:42,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3972, Invalid=12030, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:31:42,200 INFO L87 Difference]: Start difference. First operand 560 states and 560 transitions. Second operand 127 states. [2018-10-15 12:31:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:50,303 INFO L93 Difference]: Finished difference Result 580 states and 580 transitions. [2018-10-15 12:31:50,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 12:31:50,303 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 559 [2018-10-15 12:31:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:50,305 INFO L225 Difference]: With dead ends: 580 [2018-10-15 12:31:50,305 INFO L226 Difference]: Without dead ends: 576 [2018-10-15 12:31:50,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11527 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=19232, Invalid=43518, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 12:31:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-10-15 12:31:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 569. [2018-10-15 12:31:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-10-15 12:31:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 569 transitions. [2018-10-15 12:31:50,312 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 569 transitions. Word has length 559 [2018-10-15 12:31:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:50,313 INFO L481 AbstractCegarLoop]: Abstraction has 569 states and 569 transitions. [2018-10-15 12:31:50,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 12:31:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 569 transitions. [2018-10-15 12:31:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-10-15 12:31:50,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:50,315 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:50,316 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:50,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:50,316 INFO L82 PathProgramCache]: Analyzing trace with hash 343048913, now seen corresponding path program 62 times [2018-10-15 12:31:50,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 17081 backedges. 0 proven. 17081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:55,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:55,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 12:31:55,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 12:31:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 12:31:55,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4099, Invalid=12413, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 12:31:55,346 INFO L87 Difference]: Start difference. First operand 569 states and 569 transitions. Second operand 129 states. [2018-10-15 12:32:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:03,917 INFO L93 Difference]: Finished difference Result 589 states and 589 transitions. [2018-10-15 12:32:03,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 12:32:03,918 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 568 [2018-10-15 12:32:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:03,920 INFO L225 Difference]: With dead ends: 589 [2018-10-15 12:32:03,920 INFO L226 Difference]: Without dead ends: 585 [2018-10-15 12:32:03,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11902 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=19857, Invalid=44913, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 12:32:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-10-15 12:32:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 578. [2018-10-15 12:32:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-10-15 12:32:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 578 transitions. [2018-10-15 12:32:03,926 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 578 transitions. Word has length 568 [2018-10-15 12:32:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:03,926 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 578 transitions. [2018-10-15 12:32:03,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 12:32:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 578 transitions. [2018-10-15 12:32:03,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-10-15 12:32:03,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:03,929 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:03,929 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:03,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:03,930 INFO L82 PathProgramCache]: Analyzing trace with hash 528093885, now seen corresponding path program 63 times [2018-10-15 12:32:03,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17640 backedges. 0 proven. 17640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:08,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:08,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 12:32:08,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 12:32:08,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 12:32:08,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4228, Invalid=12802, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:32:08,771 INFO L87 Difference]: Start difference. First operand 578 states and 578 transitions. Second operand 131 states. [2018-10-15 12:32:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:17,479 INFO L93 Difference]: Finished difference Result 598 states and 598 transitions. [2018-10-15 12:32:17,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-10-15 12:32:17,479 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 577 [2018-10-15 12:32:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:17,481 INFO L225 Difference]: With dead ends: 598 [2018-10-15 12:32:17,481 INFO L226 Difference]: Without dead ends: 594 [2018-10-15 12:32:17,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12283 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20492, Invalid=46330, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 12:32:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-10-15 12:32:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 587. [2018-10-15 12:32:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-10-15 12:32:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 587 transitions. [2018-10-15 12:32:17,489 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 587 transitions. Word has length 577 [2018-10-15 12:32:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:17,489 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 587 transitions. [2018-10-15 12:32:17,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 12:32:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 587 transitions. [2018-10-15 12:32:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-10-15 12:32:17,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:17,492 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:17,493 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:17,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash -969429935, now seen corresponding path program 64 times [2018-10-15 12:32:17,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18208 backedges. 0 proven. 18208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:22,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:22,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 12:32:22,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 12:32:22,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 12:32:22,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4359, Invalid=13197, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:32:22,800 INFO L87 Difference]: Start difference. First operand 587 states and 587 transitions. Second operand 133 states. [2018-10-15 12:32:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:32,018 INFO L93 Difference]: Finished difference Result 607 states and 607 transitions. [2018-10-15 12:32:32,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 12:32:32,018 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 586 [2018-10-15 12:32:32,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:32,020 INFO L225 Difference]: With dead ends: 607 [2018-10-15 12:32:32,020 INFO L226 Difference]: Without dead ends: 603 [2018-10-15 12:32:32,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12670 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=21137, Invalid=47769, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 12:32:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-15 12:32:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 596. [2018-10-15 12:32:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-10-15 12:32:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 596 transitions. [2018-10-15 12:32:32,026 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 596 transitions. Word has length 586 [2018-10-15 12:32:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:32,027 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 596 transitions. [2018-10-15 12:32:32,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 12:32:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 596 transitions. [2018-10-15 12:32:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-10-15 12:32:32,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:32,030 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:32,030 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:32,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:32,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2094294723, now seen corresponding path program 65 times [2018-10-15 12:32:32,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 18785 backedges. 0 proven. 18785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:37,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:37,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 12:32:37,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 12:32:37,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 12:32:37,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4492, Invalid=13598, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:32:37,298 INFO L87 Difference]: Start difference. First operand 596 states and 596 transitions. Second operand 135 states. [2018-10-15 12:32:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:46,585 INFO L93 Difference]: Finished difference Result 616 states and 616 transitions. [2018-10-15 12:32:46,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-15 12:32:46,585 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 595 [2018-10-15 12:32:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:46,587 INFO L225 Difference]: With dead ends: 616 [2018-10-15 12:32:46,587 INFO L226 Difference]: Without dead ends: 612 [2018-10-15 12:32:46,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13063 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=21792, Invalid=49230, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 12:32:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-10-15 12:32:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 605. [2018-10-15 12:32:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-15 12:32:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 605 transitions. [2018-10-15 12:32:46,593 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 605 transitions. Word has length 595 [2018-10-15 12:32:46,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:46,594 INFO L481 AbstractCegarLoop]: Abstraction has 605 states and 605 transitions. [2018-10-15 12:32:46,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 12:32:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 605 transitions. [2018-10-15 12:32:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2018-10-15 12:32:46,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:46,596 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:46,597 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:46,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1886030383, now seen corresponding path program 66 times [2018-10-15 12:32:46,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19371 backedges. 0 proven. 19371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:52,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:52,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 12:32:52,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 12:32:52,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 12:32:52,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4627, Invalid=14005, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 12:32:52,038 INFO L87 Difference]: Start difference. First operand 605 states and 605 transitions. Second operand 137 states. [2018-10-15 12:33:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:01,771 INFO L93 Difference]: Finished difference Result 625 states and 625 transitions. [2018-10-15 12:33:01,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 12:33:01,772 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 604 [2018-10-15 12:33:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:01,775 INFO L225 Difference]: With dead ends: 625 [2018-10-15 12:33:01,775 INFO L226 Difference]: Without dead ends: 621 [2018-10-15 12:33:01,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13462 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=22457, Invalid=50713, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 12:33:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-10-15 12:33:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 614. [2018-10-15 12:33:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-10-15 12:33:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 614 transitions. [2018-10-15 12:33:01,781 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 614 transitions. Word has length 604 [2018-10-15 12:33:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:01,781 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 614 transitions. [2018-10-15 12:33:01,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 12:33:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 614 transitions. [2018-10-15 12:33:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-10-15 12:33:01,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:01,784 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:01,784 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:01,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:01,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1057456195, now seen corresponding path program 67 times [2018-10-15 12:33:01,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 19966 backedges. 0 proven. 19966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:07,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:07,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 12:33:07,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 12:33:07,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 12:33:07,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4764, Invalid=14418, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:33:07,415 INFO L87 Difference]: Start difference. First operand 614 states and 614 transitions. Second operand 139 states. [2018-10-15 12:33:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:17,546 INFO L93 Difference]: Finished difference Result 634 states and 634 transitions. [2018-10-15 12:33:17,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 12:33:17,546 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 613 [2018-10-15 12:33:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:17,548 INFO L225 Difference]: With dead ends: 634 [2018-10-15 12:33:17,548 INFO L226 Difference]: Without dead ends: 630 [2018-10-15 12:33:17,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13867 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23132, Invalid=52218, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 12:33:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-10-15 12:33:17,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 623. [2018-10-15 12:33:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-15 12:33:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 623 transitions. [2018-10-15 12:33:17,554 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 623 transitions. Word has length 613 [2018-10-15 12:33:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:17,554 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 623 transitions. [2018-10-15 12:33:17,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 12:33:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 623 transitions. [2018-10-15 12:33:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-15 12:33:17,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:17,557 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:17,558 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:17,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:17,558 INFO L82 PathProgramCache]: Analyzing trace with hash 933486417, now seen corresponding path program 68 times [2018-10-15 12:33:17,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 20570 backedges. 0 proven. 20570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:23,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:23,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 12:33:23,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 12:33:23,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 12:33:23,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4903, Invalid=14837, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 12:33:23,514 INFO L87 Difference]: Start difference. First operand 623 states and 623 transitions. Second operand 141 states. [2018-10-15 12:33:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:33,588 INFO L93 Difference]: Finished difference Result 643 states and 643 transitions. [2018-10-15 12:33:33,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 12:33:33,588 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 622 [2018-10-15 12:33:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:33,592 INFO L225 Difference]: With dead ends: 643 [2018-10-15 12:33:33,592 INFO L226 Difference]: Without dead ends: 639 [2018-10-15 12:33:33,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14278 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=23817, Invalid=53745, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 12:33:33,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-15 12:33:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 632. [2018-10-15 12:33:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-10-15 12:33:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 632 transitions. [2018-10-15 12:33:33,598 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 632 transitions. Word has length 622 [2018-10-15 12:33:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:33,598 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 632 transitions. [2018-10-15 12:33:33,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 12:33:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 632 transitions. [2018-10-15 12:33:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2018-10-15 12:33:33,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:33,601 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:33,601 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:33,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:33,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1932999107, now seen corresponding path program 69 times [2018-10-15 12:33:33,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21183 backedges. 0 proven. 21183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:39,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:39,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 12:33:39,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 12:33:39,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 12:33:39,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5044, Invalid=15262, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:33:39,609 INFO L87 Difference]: Start difference. First operand 632 states and 632 transitions. Second operand 143 states. [2018-10-15 12:33:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:50,162 INFO L93 Difference]: Finished difference Result 652 states and 652 transitions. [2018-10-15 12:33:50,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-15 12:33:50,162 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 631 [2018-10-15 12:33:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:50,164 INFO L225 Difference]: With dead ends: 652 [2018-10-15 12:33:50,165 INFO L226 Difference]: Without dead ends: 648 [2018-10-15 12:33:50,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14695 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=24512, Invalid=55294, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 12:33:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-15 12:33:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 641. [2018-10-15 12:33:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-10-15 12:33:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 641 transitions. [2018-10-15 12:33:50,171 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 641 transitions. Word has length 631 [2018-10-15 12:33:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:50,172 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 641 transitions. [2018-10-15 12:33:50,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 12:33:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 641 transitions. [2018-10-15 12:33:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-10-15 12:33:50,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:50,175 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:50,175 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:50,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash -277157679, now seen corresponding path program 70 times [2018-10-15 12:33:50,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21805 backedges. 0 proven. 21805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:56,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:56,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 12:33:56,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 12:33:56,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 12:33:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5187, Invalid=15693, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 12:33:56,520 INFO L87 Difference]: Start difference. First operand 641 states and 641 transitions. Second operand 145 states. [2018-10-15 12:34:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:07,247 INFO L93 Difference]: Finished difference Result 661 states and 661 transitions. [2018-10-15 12:34:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 12:34:07,247 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 640 [2018-10-15 12:34:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:07,250 INFO L225 Difference]: With dead ends: 661 [2018-10-15 12:34:07,250 INFO L226 Difference]: Without dead ends: 657 [2018-10-15 12:34:07,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15118 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=25217, Invalid=56865, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 12:34:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-10-15 12:34:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 650. [2018-10-15 12:34:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-10-15 12:34:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 650 transitions. [2018-10-15 12:34:07,256 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 650 transitions. Word has length 640 [2018-10-15 12:34:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:07,256 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 650 transitions. [2018-10-15 12:34:07,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 12:34:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 650 transitions. [2018-10-15 12:34:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-15 12:34:07,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:07,260 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:07,260 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:07,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:07,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1887726781, now seen corresponding path program 71 times [2018-10-15 12:34:07,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22436 backedges. 0 proven. 22436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:13,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:13,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 12:34:13,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 12:34:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 12:34:13,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5332, Invalid=16130, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:34:13,755 INFO L87 Difference]: Start difference. First operand 650 states and 650 transitions. Second operand 147 states. [2018-10-15 12:34:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:24,428 INFO L93 Difference]: Finished difference Result 670 states and 670 transitions. [2018-10-15 12:34:24,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-10-15 12:34:24,428 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 649 [2018-10-15 12:34:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:24,432 INFO L225 Difference]: With dead ends: 670 [2018-10-15 12:34:24,432 INFO L226 Difference]: Without dead ends: 666 [2018-10-15 12:34:24,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15547 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=25932, Invalid=58458, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 12:34:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-10-15 12:34:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 659. [2018-10-15 12:34:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-10-15 12:34:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 659 transitions. [2018-10-15 12:34:24,439 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 659 transitions. Word has length 649 [2018-10-15 12:34:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:24,439 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 659 transitions. [2018-10-15 12:34:24,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 12:34:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 659 transitions. [2018-10-15 12:34:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2018-10-15 12:34:24,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:24,442 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:24,442 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:24,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:24,443 INFO L82 PathProgramCache]: Analyzing trace with hash -768437679, now seen corresponding path program 72 times [2018-10-15 12:34:24,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 23076 backedges. 0 proven. 23076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:31,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:31,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 12:34:31,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 12:34:31,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 12:34:31,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5479, Invalid=16573, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 12:34:31,057 INFO L87 Difference]: Start difference. First operand 659 states and 659 transitions. Second operand 149 states. [2018-10-15 12:34:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:42,339 INFO L93 Difference]: Finished difference Result 679 states and 679 transitions. [2018-10-15 12:34:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-15 12:34:42,339 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 658 [2018-10-15 12:34:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:42,342 INFO L225 Difference]: With dead ends: 679 [2018-10-15 12:34:42,342 INFO L226 Difference]: Without dead ends: 675 [2018-10-15 12:34:42,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15982 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=26657, Invalid=60073, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 12:34:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-10-15 12:34:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 668. [2018-10-15 12:34:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-10-15 12:34:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 668 transitions. [2018-10-15 12:34:42,350 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 668 transitions. Word has length 658 [2018-10-15 12:34:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:42,350 INFO L481 AbstractCegarLoop]: Abstraction has 668 states and 668 transitions. [2018-10-15 12:34:42,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 12:34:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 668 transitions. [2018-10-15 12:34:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2018-10-15 12:34:42,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:42,354 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:42,354 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:42,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:42,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1276343101, now seen corresponding path program 73 times [2018-10-15 12:34:42,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 23725 backedges. 0 proven. 23725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:49,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:49,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-10-15 12:34:49,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-10-15 12:34:49,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-10-15 12:34:49,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5628, Invalid=17022, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:34:49,270 INFO L87 Difference]: Start difference. First operand 668 states and 668 transitions. Second operand 151 states. [2018-10-15 12:35:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:00,798 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2018-10-15 12:35:00,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-10-15 12:35:00,798 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 667 [2018-10-15 12:35:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:00,802 INFO L225 Difference]: With dead ends: 688 [2018-10-15 12:35:00,802 INFO L226 Difference]: Without dead ends: 684 [2018-10-15 12:35:00,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16423 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=27392, Invalid=61710, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 12:35:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-10-15 12:35:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 677. [2018-10-15 12:35:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-10-15 12:35:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 677 transitions. [2018-10-15 12:35:00,809 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 677 transitions. Word has length 667 [2018-10-15 12:35:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:00,810 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 677 transitions. [2018-10-15 12:35:00,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-10-15 12:35:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 677 transitions. [2018-10-15 12:35:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-10-15 12:35:00,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:00,813 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:00,813 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:00,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:00,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1692589009, now seen corresponding path program 74 times [2018-10-15 12:35:00,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat