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/nec20_false-unreach-call_true-termination.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:35:41,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:35:41,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:35:41,927 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:35:41,927 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:35:41,928 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:35:41,929 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:35:41,931 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:35:41,933 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:35:41,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:35:41,935 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:35:41,935 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:35:41,936 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:35:41,937 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:35:41,938 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:35:41,939 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:35:41,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:35:41,941 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:35:41,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:35:41,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:35:41,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:35:41,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:35:41,953 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:35:41,953 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:35:41,953 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:35:41,954 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:35:41,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:35:41,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:35:41,957 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:35:41,958 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:35:41,958 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:35:41,959 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:35:41,959 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:35:41,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:35:41,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:35:41,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:35:41,961 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:35:41,970 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:35:41,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:35:41,971 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:35:41,971 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:35:41,971 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:35:41,972 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:35:41,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:35:41,972 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:35:41,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:35:41,973 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:35:41,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:35:41,973 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:35:41,973 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:35:41,974 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:35:41,974 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:35:42,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:35:42,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:35:42,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:35:42,041 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:35:42,042 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:35:42,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/nec20_false-unreach-call_true-termination.i_4.bpl [2018-10-15 12:35:42,043 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/nec20_false-unreach-call_true-termination.i_4.bpl' [2018-10-15 12:35:42,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:35:42,118 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:35:42,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:35:42,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:35:42,119 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:35:42,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:42" (1/1) ... [2018-10-15 12:35:42,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:42" (1/1) ... [2018-10-15 12:35:42,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:42" (1/1) ... [2018-10-15 12:35:42,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:42" (1/1) ... [2018-10-15 12:35:42,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:42" (1/1) ... [2018-10-15 12:35:42,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:42" (1/1) ... [2018-10-15 12:35:42,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:42" (1/1) ... [2018-10-15 12:35:42,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:35:42,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:35:42,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:35:42,173 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:35:42,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:42" (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:35:42,237 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:35:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:35:42,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:35:42,585 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:35:42,586 INFO L202 PluginConnector]: Adding new model nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:35:42 BoogieIcfgContainer [2018-10-15 12:35:42,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:35:42,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:35:42,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:35:42,591 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:35:42,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:42" (1/2) ... [2018-10-15 12:35:42,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfb854a and model type nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:35:42, skipping insertion in model container [2018-10-15 12:35:42,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nec20_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:35:42" (2/2) ... [2018-10-15 12:35:42,595 INFO L112 eAbstractionObserver]: Analyzing ICFG nec20_false-unreach-call_true-termination.i_4.bpl [2018-10-15 12:35:42,606 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:35:42,614 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:35:42,633 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:35:42,663 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:35:42,664 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:35:42,664 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:35:42,664 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:35:42,664 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:35:42,665 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:35:42,665 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:35:42,665 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:35:42,665 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:35:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-10-15 12:35:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 12:35:42,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:42,693 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:42,694 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:42,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1325438740, now seen corresponding path program 1 times [2018-10-15 12:35:42,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:42,926 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:35:42,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:35:42,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 12:35:42,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 12:35:42,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 12:35:42,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:35:42,948 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-10-15 12:35:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:43,052 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-15 12:35:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 12:35:43,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-10-15 12:35:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:43,065 INFO L225 Difference]: With dead ends: 32 [2018-10-15 12:35:43,065 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 12:35:43,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:35:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 12:35:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-10-15 12:35:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 12:35:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-15 12:35:43,105 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 24 [2018-10-15 12:35:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:43,106 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-15 12:35:43,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 12:35:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-15 12:35:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 12:35:43,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:43,107 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:43,108 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:43,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:43,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1494278656, now seen corresponding path program 1 times [2018-10-15 12:35:43,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:43,252 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:35:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:43,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 12:35:43,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 12:35:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 12:35:43,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:35:43,256 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 6 states. [2018-10-15 12:35:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:43,645 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-15 12:35:43,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 12:35:43,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-10-15 12:35:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:43,647 INFO L225 Difference]: With dead ends: 37 [2018-10-15 12:35:43,647 INFO L226 Difference]: Without dead ends: 37 [2018-10-15 12:35:43,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:35:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-15 12:35:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-15 12:35:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 12:35:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-15 12:35:43,654 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 29 [2018-10-15 12:35:43,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:43,654 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-15 12:35:43,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 12:35:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-15 12:35:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 12:35:43,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:43,656 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:43,656 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:43,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash -229209452, now seen corresponding path program 2 times [2018-10-15 12:35:43,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:43,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:43,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:35:43,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:35:43,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:35:43,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:35:43,880 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 8 states. [2018-10-15 12:35:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:44,297 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-15 12:35:44,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 12:35:44,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-10-15 12:35:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:44,301 INFO L225 Difference]: With dead ends: 42 [2018-10-15 12:35:44,301 INFO L226 Difference]: Without dead ends: 42 [2018-10-15 12:35:44,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:35:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-15 12:35:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-10-15 12:35:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 12:35:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-15 12:35:44,309 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 34 [2018-10-15 12:35:44,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:44,309 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-15 12:35:44,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:35:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-15 12:35:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 12:35:44,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:44,311 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:44,312 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:44,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash 115809920, now seen corresponding path program 3 times [2018-10-15 12:35:44,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:44,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:44,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 12:35:44,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 12:35:44,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 12:35:44,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:35:44,674 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 10 states. [2018-10-15 12:35:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:45,140 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-15 12:35:45,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 12:35:45,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-10-15 12:35:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:45,143 INFO L225 Difference]: With dead ends: 47 [2018-10-15 12:35:45,143 INFO L226 Difference]: Without dead ends: 47 [2018-10-15 12:35:45,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:35:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-15 12:35:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-10-15 12:35:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 12:35:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 12:35:45,150 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 39 [2018-10-15 12:35:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:45,151 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 12:35:45,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 12:35:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 12:35:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 12:35:45,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:45,153 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:45,153 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:45,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:45,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1217257964, now seen corresponding path program 4 times [2018-10-15 12:35:45,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:45,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:45,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:35:45,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:35:45,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:35:45,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:35:45,339 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 12 states. [2018-10-15 12:35:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:45,927 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-15 12:35:45,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 12:35:45,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-10-15 12:35:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:45,932 INFO L225 Difference]: With dead ends: 52 [2018-10-15 12:35:45,932 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 12:35:45,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:35:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 12:35:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-10-15 12:35:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 12:35:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-15 12:35:45,945 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2018-10-15 12:35:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:45,945 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-15 12:35:45,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:35:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-15 12:35:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 12:35:45,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:45,949 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:45,950 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:45,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:45,952 INFO L82 PathProgramCache]: Analyzing trace with hash -310658304, now seen corresponding path program 5 times [2018-10-15 12:35:45,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:46,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:46,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 12:35:46,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 12:35:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 12:35:46,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:35:46,197 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 14 states. [2018-10-15 12:35:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:46,606 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 12:35:46,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 12:35:46,607 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-10-15 12:35:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:46,609 INFO L225 Difference]: With dead ends: 57 [2018-10-15 12:35:46,609 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 12:35:46,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=591, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:35:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 12:35:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-15 12:35:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 12:35:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 12:35:46,618 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 49 [2018-10-15 12:35:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:46,619 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 12:35:46,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 12:35:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 12:35:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 12:35:46,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:46,620 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:46,621 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:46,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:46,621 INFO L82 PathProgramCache]: Analyzing trace with hash -607432300, now seen corresponding path program 6 times [2018-10-15 12:35:46,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:46,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:46,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 12:35:46,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 12:35:46,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 12:35:46,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:35:46,877 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 16 states. [2018-10-15 12:35:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:47,499 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-15 12:35:47,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 12:35:47,500 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-10-15 12:35:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:47,502 INFO L225 Difference]: With dead ends: 62 [2018-10-15 12:35:47,502 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 12:35:47,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:35:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 12:35:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-10-15 12:35:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 12:35:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-15 12:35:47,508 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 54 [2018-10-15 12:35:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:47,509 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-15 12:35:47,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 12:35:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-15 12:35:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 12:35:47,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:47,510 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:47,511 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:47,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:47,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2052503424, now seen corresponding path program 7 times [2018-10-15 12:35:47,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:47,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:47,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:35:47,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:35:47,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:35:47,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:35:47,881 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 18 states. [2018-10-15 12:35:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:48,575 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-15 12:35:48,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 12:35:48,575 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-10-15 12:35:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:48,577 INFO L225 Difference]: With dead ends: 67 [2018-10-15 12:35:48,577 INFO L226 Difference]: Without dead ends: 67 [2018-10-15 12:35:48,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=485, Invalid=1075, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:35:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-15 12:35:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-10-15 12:35:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 12:35:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 12:35:48,584 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 59 [2018-10-15 12:35:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:48,585 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 12:35:48,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:35:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 12:35:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 12:35:48,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:48,586 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:48,587 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:48,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:48,587 INFO L82 PathProgramCache]: Analyzing trace with hash 651830548, now seen corresponding path program 8 times [2018-10-15 12:35:48,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:48,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:48,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 12:35:48,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 12:35:48,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 12:35:48,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:35:48,891 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 20 states. [2018-10-15 12:35:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:49,723 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 12:35:49,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:35:49,724 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-10-15 12:35:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:49,725 INFO L225 Difference]: With dead ends: 72 [2018-10-15 12:35:49,725 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 12:35:49,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=1371, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:35:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 12:35:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-10-15 12:35:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 12:35:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-15 12:35:49,731 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 64 [2018-10-15 12:35:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:49,731 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-15 12:35:49,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 12:35:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-15 12:35:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 12:35:49,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:49,733 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:49,733 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:49,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:49,733 INFO L82 PathProgramCache]: Analyzing trace with hash -788524032, now seen corresponding path program 9 times [2018-10-15 12:35:49,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:50,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:50,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 12:35:50,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 12:35:50,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 12:35:50,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:35:50,081 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 22 states. [2018-10-15 12:35:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:51,016 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-15 12:35:51,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:35:51,017 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-10-15 12:35:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:51,018 INFO L225 Difference]: With dead ends: 77 [2018-10-15 12:35:51,018 INFO L226 Difference]: Without dead ends: 77 [2018-10-15 12:35:51,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=747, Invalid=1703, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:35:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-15 12:35:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-10-15 12:35:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 12:35:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 12:35:51,025 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 69 [2018-10-15 12:35:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:51,025 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 12:35:51,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 12:35:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 12:35:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 12:35:51,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:51,027 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:51,028 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:51,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1779865748, now seen corresponding path program 10 times [2018-10-15 12:35:51,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:51,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:51,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 12:35:51,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 12:35:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 12:35:51,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:35:51,340 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 24 states. [2018-10-15 12:35:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:52,029 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-15 12:35:52,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 12:35:52,030 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-10-15 12:35:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:52,031 INFO L225 Difference]: With dead ends: 82 [2018-10-15 12:35:52,032 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 12:35:52,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=899, Invalid=2071, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:35:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 12:35:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-10-15 12:35:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 12:35:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-15 12:35:52,038 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 74 [2018-10-15 12:35:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:52,038 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-15 12:35:52,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 12:35:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-15 12:35:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:35:52,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:52,040 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:52,040 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:52,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1258279040, now seen corresponding path program 11 times [2018-10-15 12:35:52,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:52,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:52,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 12:35:52,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 12:35:52,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 12:35:52,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:35:52,404 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 26 states. [2018-10-15 12:35:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:53,994 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-15 12:35:53,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 12:35:53,995 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-10-15 12:35:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:53,996 INFO L225 Difference]: With dead ends: 87 [2018-10-15 12:35:53,996 INFO L226 Difference]: Without dead ends: 87 [2018-10-15 12:35:53,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1065, Invalid=2475, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:35:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-15 12:35:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-15 12:35:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 12:35:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 12:35:54,003 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 79 [2018-10-15 12:35:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:54,004 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 12:35:54,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 12:35:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 12:35:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 12:35:54,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:54,005 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:54,006 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:54,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash 16296980, now seen corresponding path program 12 times [2018-10-15 12:35:54,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:54,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:54,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 12:35:54,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 12:35:54,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 12:35:54,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:35:54,620 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 28 states. [2018-10-15 12:35:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:56,142 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-15 12:35:56,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 12:35:56,143 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2018-10-15 12:35:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:56,144 INFO L225 Difference]: With dead ends: 92 [2018-10-15 12:35:56,144 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 12:35:56,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1245, Invalid=2915, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:35:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 12:35:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-10-15 12:35:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-15 12:35:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-15 12:35:56,150 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 84 [2018-10-15 12:35:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:56,150 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-15 12:35:56,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 12:35:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-15 12:35:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 12:35:56,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:56,152 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:56,152 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:56,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:56,153 INFO L82 PathProgramCache]: Analyzing trace with hash -136450816, now seen corresponding path program 13 times [2018-10-15 12:35:56,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:56,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:56,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 12:35:56,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 12:35:56,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 12:35:56,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:35:56,828 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 30 states. [2018-10-15 12:35:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:58,169 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-15 12:35:58,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 12:35:58,170 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2018-10-15 12:35:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:58,170 INFO L225 Difference]: With dead ends: 97 [2018-10-15 12:35:58,170 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 12:35:58,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1439, Invalid=3391, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 12:35:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 12:35:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-10-15 12:35:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 12:35:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 12:35:58,176 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 89 [2018-10-15 12:35:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:58,176 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 12:35:58,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 12:35:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 12:35:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 12:35:58,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:58,178 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:58,178 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:58,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:58,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1358454676, now seen corresponding path program 14 times [2018-10-15 12:35:58,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:58,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:58,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 12:35:58,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 12:35:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 12:35:58,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:35:58,652 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 32 states. [2018-10-15 12:36:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:00,110 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-15 12:36:00,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 12:36:00,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 94 [2018-10-15 12:36:00,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:00,112 INFO L225 Difference]: With dead ends: 102 [2018-10-15 12:36:00,112 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 12:36:00,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1647, Invalid=3903, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:36:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 12:36:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-15 12:36:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 12:36:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-15 12:36:00,118 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 94 [2018-10-15 12:36:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:00,119 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-15 12:36:00,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 12:36:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-15 12:36:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 12:36:00,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:00,120 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:00,120 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:00,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash 488794496, now seen corresponding path program 15 times [2018-10-15 12:36:00,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:01,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:01,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 12:36:01,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 12:36:01,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 12:36:01,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:36:01,395 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 34 states. [2018-10-15 12:36:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:02,723 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-15 12:36:02,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 12:36:02,723 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 99 [2018-10-15 12:36:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:02,725 INFO L225 Difference]: With dead ends: 107 [2018-10-15 12:36:02,725 INFO L226 Difference]: Without dead ends: 107 [2018-10-15 12:36:02,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1869, Invalid=4451, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 12:36:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-15 12:36:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-10-15 12:36:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 12:36:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-15 12:36:02,729 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 99 [2018-10-15 12:36:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:02,730 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-15 12:36:02,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 12:36:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-15 12:36:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 12:36:02,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:02,731 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:02,731 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:02,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:02,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1234023188, now seen corresponding path program 16 times [2018-10-15 12:36:02,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:03,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:03,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 12:36:03,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 12:36:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 12:36:03,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:36:03,406 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 36 states. [2018-10-15 12:36:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:05,251 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-15 12:36:05,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:36:05,251 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 104 [2018-10-15 12:36:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:05,252 INFO L225 Difference]: With dead ends: 112 [2018-10-15 12:36:05,252 INFO L226 Difference]: Without dead ends: 112 [2018-10-15 12:36:05,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2105, Invalid=5035, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:36:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-15 12:36:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-10-15 12:36:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 12:36:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 12:36:05,258 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 104 [2018-10-15 12:36:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:05,258 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 12:36:05,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 12:36:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 12:36:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:36:05,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:05,260 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:05,260 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:05,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:05,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1235925504, now seen corresponding path program 17 times [2018-10-15 12:36:05,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:05,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:05,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 12:36:05,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 12:36:05,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 12:36:05,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:36:05,974 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 38 states. [2018-10-15 12:36:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:07,689 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-15 12:36:07,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 12:36:07,690 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-10-15 12:36:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:07,691 INFO L225 Difference]: With dead ends: 117 [2018-10-15 12:36:07,691 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 12:36:07,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1734 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2355, Invalid=5655, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:36:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 12:36:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-15 12:36:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:36:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 12:36:07,697 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 109 [2018-10-15 12:36:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:07,698 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 12:36:07,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 12:36:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 12:36:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:36:07,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:07,698 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:07,699 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:07,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash -466573676, now seen corresponding path program 18 times [2018-10-15 12:36:07,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:08,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:08,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 12:36:08,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 12:36:08,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 12:36:08,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:36:08,615 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 40 states. [2018-10-15 12:36:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:10,627 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-15 12:36:10,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 12:36:10,628 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2018-10-15 12:36:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:10,629 INFO L225 Difference]: With dead ends: 122 [2018-10-15 12:36:10,629 INFO L226 Difference]: Without dead ends: 122 [2018-10-15 12:36:10,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2619, Invalid=6311, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:36:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-15 12:36:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-10-15 12:36:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-15 12:36:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-15 12:36:10,633 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 114 [2018-10-15 12:36:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:10,634 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-15 12:36:10,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 12:36:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-15 12:36:10,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 12:36:10,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:10,635 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:10,635 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:10,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:10,636 INFO L82 PathProgramCache]: Analyzing trace with hash -184647040, now seen corresponding path program 19 times [2018-10-15 12:36:10,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:11,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:11,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 12:36:11,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 12:36:11,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 12:36:11,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1280, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:36:11,399 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 42 states. [2018-10-15 12:36:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:13,252 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-15 12:36:13,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 12:36:13,252 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 119 [2018-10-15 12:36:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:13,253 INFO L225 Difference]: With dead ends: 127 [2018-10-15 12:36:13,254 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 12:36:13,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2897, Invalid=7003, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 12:36:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 12:36:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-10-15 12:36:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 12:36:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-15 12:36:13,258 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 119 [2018-10-15 12:36:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:13,258 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-15 12:36:13,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 12:36:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-15 12:36:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 12:36:13,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:13,260 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:13,260 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:13,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1537656300, now seen corresponding path program 20 times [2018-10-15 12:36:13,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:14,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:14,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 12:36:14,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 12:36:14,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 12:36:14,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1407, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:36:14,491 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 44 states. [2018-10-15 12:36:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:17,146 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-15 12:36:17,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 12:36:17,146 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 124 [2018-10-15 12:36:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:17,148 INFO L225 Difference]: With dead ends: 132 [2018-10-15 12:36:17,148 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 12:36:17,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2400 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3189, Invalid=7731, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:36:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 12:36:17,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-15 12:36:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-15 12:36:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-15 12:36:17,155 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 124 [2018-10-15 12:36:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:17,155 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-15 12:36:17,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 12:36:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-15 12:36:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 12:36:17,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:17,157 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:17,157 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:17,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1062854912, now seen corresponding path program 21 times [2018-10-15 12:36:17,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:18,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:18,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 12:36:18,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 12:36:18,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 12:36:18,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1540, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:36:18,074 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 46 states. [2018-10-15 12:36:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:20,649 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 12:36:20,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 12:36:20,655 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2018-10-15 12:36:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:20,656 INFO L225 Difference]: With dead ends: 137 [2018-10-15 12:36:20,656 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 12:36:20,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3495, Invalid=8495, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 12:36:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 12:36:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-10-15 12:36:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 12:36:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-15 12:36:20,661 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 129 [2018-10-15 12:36:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:20,661 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-15 12:36:20,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 12:36:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-15 12:36:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 12:36:20,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:20,662 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:20,662 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:20,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:20,663 INFO L82 PathProgramCache]: Analyzing trace with hash 394227092, now seen corresponding path program 22 times [2018-10-15 12:36:20,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:21,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:21,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:36:21,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:36:21,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:36:21,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1679, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:36:21,877 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 48 states. [2018-10-15 12:36:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:24,313 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-15 12:36:24,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 12:36:24,314 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 134 [2018-10-15 12:36:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:24,315 INFO L225 Difference]: With dead ends: 142 [2018-10-15 12:36:24,315 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 12:36:24,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2904 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3815, Invalid=9295, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:36:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 12:36:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-10-15 12:36:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:36:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-15 12:36:24,319 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 134 [2018-10-15 12:36:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:24,320 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-15 12:36:24,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:36:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-15 12:36:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:36:24,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:24,321 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:24,321 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:24,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:24,322 INFO L82 PathProgramCache]: Analyzing trace with hash 919870336, now seen corresponding path program 23 times [2018-10-15 12:36:24,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:25,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:25,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 12:36:25,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 12:36:25,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 12:36:25,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=1824, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:36:25,699 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 50 states. [2018-10-15 12:36:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:28,314 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-15 12:36:28,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:36:28,314 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 139 [2018-10-15 12:36:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:28,316 INFO L225 Difference]: With dead ends: 147 [2018-10-15 12:36:28,316 INFO L226 Difference]: Without dead ends: 147 [2018-10-15 12:36:28,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3174 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4149, Invalid=10131, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 12:36:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-15 12:36:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-10-15 12:36:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 12:36:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 12:36:28,321 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 139 [2018-10-15 12:36:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:28,321 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 12:36:28,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 12:36:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 12:36:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 12:36:28,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:28,323 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:28,323 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:28,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:28,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1427849492, now seen corresponding path program 24 times [2018-10-15 12:36:28,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:29,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:29,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 12:36:29,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 12:36:29,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 12:36:29,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=1975, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:36:29,528 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 52 states. [2018-10-15 12:36:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:33,270 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-15 12:36:33,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 12:36:33,271 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 144 [2018-10-15 12:36:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:33,272 INFO L225 Difference]: With dead ends: 152 [2018-10-15 12:36:33,272 INFO L226 Difference]: Without dead ends: 152 [2018-10-15 12:36:33,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3456 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4497, Invalid=11003, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 12:36:33,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-15 12:36:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-10-15 12:36:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 12:36:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-15 12:36:33,276 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 144 [2018-10-15 12:36:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:33,277 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-15 12:36:33,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 12:36:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-15 12:36:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:36:33,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:33,277 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:33,278 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:33,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash 722499584, now seen corresponding path program 25 times [2018-10-15 12:36:33,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:34,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:34,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 12:36:34,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 12:36:34,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 12:36:34,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=2132, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 12:36:34,428 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 54 states. [2018-10-15 12:36:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:37,946 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-15 12:36:37,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 12:36:37,953 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 149 [2018-10-15 12:36:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:37,954 INFO L225 Difference]: With dead ends: 157 [2018-10-15 12:36:37,954 INFO L226 Difference]: Without dead ends: 157 [2018-10-15 12:36:37,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3750 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4859, Invalid=11911, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 12:36:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-15 12:36:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-10-15 12:36:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:36:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 12:36:37,958 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 149 [2018-10-15 12:36:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:37,958 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 12:36:37,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 12:36:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 12:36:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:36:37,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:37,959 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:37,959 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:37,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2124723348, now seen corresponding path program 26 times [2018-10-15 12:36:37,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:39,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:39,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-15 12:36:39,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-15 12:36:39,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-15 12:36:39,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=2295, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 12:36:39,146 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 56 states. [2018-10-15 12:36:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:42,509 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 12:36:42,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 12:36:42,510 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 154 [2018-10-15 12:36:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:42,512 INFO L225 Difference]: With dead ends: 162 [2018-10-15 12:36:42,512 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 12:36:42,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4056 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5235, Invalid=12855, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:36:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 12:36:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-10-15 12:36:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 12:36:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-15 12:36:42,517 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 154 [2018-10-15 12:36:42,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:42,518 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-15 12:36:42,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-15 12:36:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-15 12:36:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 12:36:42,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:42,519 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:42,519 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:42,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:42,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1495059328, now seen corresponding path program 27 times [2018-10-15 12:36:42,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:43,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:43,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 12:36:43,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 12:36:43,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 12:36:43,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=842, Invalid=2464, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 12:36:43,774 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 58 states. [2018-10-15 12:36:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:47,537 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-15 12:36:47,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 12:36:47,537 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 159 [2018-10-15 12:36:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:47,538 INFO L225 Difference]: With dead ends: 167 [2018-10-15 12:36:47,538 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 12:36:47,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4374 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5625, Invalid=13835, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 12:36:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 12:36:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-15 12:36:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-15 12:36:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-15 12:36:47,543 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 159 [2018-10-15 12:36:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:47,544 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-15 12:36:47,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 12:36:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-15 12:36:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-15 12:36:47,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:47,545 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:47,545 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:47,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:47,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1066649620, now seen corresponding path program 28 times [2018-10-15 12:36:47,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:48,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:48,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 12:36:48,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 12:36:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 12:36:48,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2639, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:36:48,921 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 60 states. [2018-10-15 12:36:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:53,855 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-15 12:36:53,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 12:36:53,855 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 164 [2018-10-15 12:36:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:53,856 INFO L225 Difference]: With dead ends: 172 [2018-10-15 12:36:53,857 INFO L226 Difference]: Without dead ends: 172 [2018-10-15 12:36:53,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6029, Invalid=14851, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 12:36:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-15 12:36:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-10-15 12:36:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 12:36:53,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-15 12:36:53,861 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 164 [2018-10-15 12:36:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:53,862 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-15 12:36:53,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 12:36:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-15 12:36:53,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:36:53,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:53,863 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:53,863 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:53,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:53,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1775522048, now seen corresponding path program 29 times [2018-10-15 12:36:53,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:55,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:55,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 12:36:55,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 12:36:55,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 12:36:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=962, Invalid=2820, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 12:36:55,363 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 62 states. [2018-10-15 12:36:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:59,436 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-15 12:36:59,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 12:36:59,437 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 169 [2018-10-15 12:36:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:59,439 INFO L225 Difference]: With dead ends: 177 [2018-10-15 12:36:59,439 INFO L226 Difference]: Without dead ends: 177 [2018-10-15 12:36:59,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5046 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6447, Invalid=15903, Unknown=0, NotChecked=0, Total=22350 [2018-10-15 12:36:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-15 12:36:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-15 12:36:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 12:36:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-15 12:36:59,444 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 169 [2018-10-15 12:36:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:59,444 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-15 12:36:59,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 12:36:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-15 12:36:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-15 12:36:59,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:59,445 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:59,445 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:59,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1298168724, now seen corresponding path program 30 times [2018-10-15 12:36:59,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:01,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:01,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-15 12:37:01,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-15 12:37:01,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-15 12:37:01,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1025, Invalid=3007, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 12:37:01,525 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 64 states. [2018-10-15 12:37:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:05,584 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-15 12:37:05,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 12:37:05,584 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 174 [2018-10-15 12:37:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:05,586 INFO L225 Difference]: With dead ends: 182 [2018-10-15 12:37:05,586 INFO L226 Difference]: Without dead ends: 182 [2018-10-15 12:37:05,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5400 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6879, Invalid=16991, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:37:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-15 12:37:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-15 12:37:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-15 12:37:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-15 12:37:05,591 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 174 [2018-10-15 12:37:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:05,591 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-15 12:37:05,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-15 12:37:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-15 12:37:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 12:37:05,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:05,592 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:05,593 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:05,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1768672640, now seen corresponding path program 31 times [2018-10-15 12:37:05,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:07,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:07,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 12:37:07,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 12:37:07,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 12:37:07,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1090, Invalid=3200, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 12:37:07,335 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 66 states. [2018-10-15 12:37:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:12,033 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-15 12:37:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 12:37:12,033 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 179 [2018-10-15 12:37:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:12,034 INFO L225 Difference]: With dead ends: 187 [2018-10-15 12:37:12,035 INFO L226 Difference]: Without dead ends: 187 [2018-10-15 12:37:12,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5766 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7325, Invalid=18115, Unknown=0, NotChecked=0, Total=25440 [2018-10-15 12:37:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-15 12:37:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-10-15 12:37:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 12:37:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-15 12:37:12,039 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 179 [2018-10-15 12:37:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:12,039 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-15 12:37:12,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 12:37:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-15 12:37:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:37:12,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:12,040 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:12,040 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:12,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:12,040 INFO L82 PathProgramCache]: Analyzing trace with hash -410857708, now seen corresponding path program 32 times [2018-10-15 12:37:12,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:14,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:14,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 12:37:14,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 12:37:14,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 12:37:14,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1157, Invalid=3399, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:37:14,009 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 68 states. [2018-10-15 12:37:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:18,807 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-15 12:37:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-15 12:37:18,809 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 184 [2018-10-15 12:37:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:18,811 INFO L225 Difference]: With dead ends: 192 [2018-10-15 12:37:18,811 INFO L226 Difference]: Without dead ends: 192 [2018-10-15 12:37:18,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6144 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7785, Invalid=19275, Unknown=0, NotChecked=0, Total=27060 [2018-10-15 12:37:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-15 12:37:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-10-15 12:37:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-15 12:37:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-15 12:37:18,816 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 184 [2018-10-15 12:37:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:18,816 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-15 12:37:18,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 12:37:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-15 12:37:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-15 12:37:18,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:18,818 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:18,818 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:18,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1362209280, now seen corresponding path program 33 times [2018-10-15 12:37:18,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:20,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:20,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 12:37:20,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 12:37:20,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 12:37:20,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1226, Invalid=3604, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 12:37:20,545 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 70 states. [2018-10-15 12:37:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:25,641 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-15 12:37:25,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 12:37:25,641 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 189 [2018-10-15 12:37:25,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:25,642 INFO L225 Difference]: With dead ends: 197 [2018-10-15 12:37:25,642 INFO L226 Difference]: Without dead ends: 197 [2018-10-15 12:37:25,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6534 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8259, Invalid=20471, Unknown=0, NotChecked=0, Total=28730 [2018-10-15 12:37:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-15 12:37:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-10-15 12:37:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-15 12:37:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-15 12:37:25,648 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 189 [2018-10-15 12:37:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:25,648 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-15 12:37:25,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 12:37:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-15 12:37:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-15 12:37:25,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:25,650 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:25,650 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:25,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:25,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1467138708, now seen corresponding path program 34 times [2018-10-15 12:37:25,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:27,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:27,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 12:37:27,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 12:37:27,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 12:37:27,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1297, Invalid=3815, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 12:37:27,684 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 72 states. [2018-10-15 12:37:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:33,006 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-15 12:37:33,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-15 12:37:33,006 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 194 [2018-10-15 12:37:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:33,007 INFO L225 Difference]: With dead ends: 202 [2018-10-15 12:37:33,007 INFO L226 Difference]: Without dead ends: 202 [2018-10-15 12:37:33,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6936 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8747, Invalid=21703, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:37:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-15 12:37:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-10-15 12:37:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:37:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 12:37:33,011 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 194 [2018-10-15 12:37:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:33,011 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 12:37:33,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 12:37:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 12:37:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:37:33,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:33,012 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:33,012 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:33,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash 44951168, now seen corresponding path program 35 times [2018-10-15 12:37:33,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:35,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:35,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 12:37:35,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 12:37:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 12:37:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=4032, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 12:37:35,888 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 74 states. [2018-10-15 12:37:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:41,265 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-15 12:37:41,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 12:37:41,265 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 199 [2018-10-15 12:37:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:41,267 INFO L225 Difference]: With dead ends: 207 [2018-10-15 12:37:41,267 INFO L226 Difference]: Without dead ends: 207 [2018-10-15 12:37:41,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7350 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=9249, Invalid=22971, Unknown=0, NotChecked=0, Total=32220 [2018-10-15 12:37:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-15 12:37:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-10-15 12:37:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 12:37:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-15 12:37:41,272 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 199 [2018-10-15 12:37:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:41,273 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-15 12:37:41,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 12:37:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-15 12:37:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 12:37:41,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:41,274 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:41,274 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:41,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:41,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1890080276, now seen corresponding path program 36 times [2018-10-15 12:37:41,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:44,254 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:37:44,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:44,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-15 12:37:44,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-15 12:37:44,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-15 12:37:44,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=4255, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 12:37:44,256 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 76 states. [2018-10-15 12:37:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:50,181 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-10-15 12:37:50,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-15 12:37:50,182 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 204 [2018-10-15 12:37:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:50,183 INFO L225 Difference]: With dead ends: 212 [2018-10-15 12:37:50,183 INFO L226 Difference]: Without dead ends: 212 [2018-10-15 12:37:50,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7776 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=9765, Invalid=24275, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 12:37:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-15 12:37:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-10-15 12:37:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-15 12:37:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-15 12:37:50,188 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 204 [2018-10-15 12:37:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:50,188 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-15 12:37:50,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-15 12:37:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-15 12:37:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 12:37:50,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:50,190 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:50,190 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:50,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:50,190 INFO L82 PathProgramCache]: Analyzing trace with hash 359170816, now seen corresponding path program 37 times [2018-10-15 12:37:50,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:52,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:52,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 12:37:52,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 12:37:52,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 12:37:52,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1522, Invalid=4484, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:37:52,784 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 78 states. [2018-10-15 12:37:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:58,776 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-15 12:37:58,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 12:37:58,782 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 209 [2018-10-15 12:37:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:58,783 INFO L225 Difference]: With dead ends: 217 [2018-10-15 12:37:58,784 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 12:37:58,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8214 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10295, Invalid=25615, Unknown=0, NotChecked=0, Total=35910 [2018-10-15 12:37:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 12:37:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-10-15 12:37:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-15 12:37:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-15 12:37:58,788 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 209 [2018-10-15 12:37:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:58,788 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-15 12:37:58,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 12:37:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-15 12:37:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-15 12:37:58,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:58,790 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:58,790 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:58,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash 278628756, now seen corresponding path program 38 times [2018-10-15 12:37:58,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:01,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:01,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-15 12:38:01,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-15 12:38:01,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-15 12:38:01,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=4719, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 12:38:01,121 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 80 states. [2018-10-15 12:38:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:07,839 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-10-15 12:38:07,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-15 12:38:07,840 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 214 [2018-10-15 12:38:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:07,841 INFO L225 Difference]: With dead ends: 222 [2018-10-15 12:38:07,841 INFO L226 Difference]: Without dead ends: 222 [2018-10-15 12:38:07,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8664 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=10839, Invalid=26991, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:38:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-15 12:38:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-10-15 12:38:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 12:38:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-10-15 12:38:07,844 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 214 [2018-10-15 12:38:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:07,844 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-10-15 12:38:07,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-15 12:38:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-10-15 12:38:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 12:38:07,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:07,846 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:07,846 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:07,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:07,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1458143104, now seen corresponding path program 39 times [2018-10-15 12:38:07,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:10,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:10,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 12:38:10,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 12:38:10,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 12:38:10,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1682, Invalid=4960, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 12:38:10,159 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 82 states. [2018-10-15 12:38:16,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:16,935 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-15 12:38:16,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-15 12:38:16,936 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 219 [2018-10-15 12:38:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:16,937 INFO L225 Difference]: With dead ends: 227 [2018-10-15 12:38:16,937 INFO L226 Difference]: Without dead ends: 227 [2018-10-15 12:38:16,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9126 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11397, Invalid=28403, Unknown=0, NotChecked=0, Total=39800 [2018-10-15 12:38:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-15 12:38:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-15 12:38:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-15 12:38:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-15 12:38:16,941 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 219 [2018-10-15 12:38:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:16,941 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-15 12:38:16,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 12:38:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-15 12:38:16,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-15 12:38:16,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:16,942 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:16,942 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:16,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:16,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1631298284, now seen corresponding path program 40 times [2018-10-15 12:38:16,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:19,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:19,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 12:38:19,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 12:38:19,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 12:38:19,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1765, Invalid=5207, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:38:19,949 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 84 states. [2018-10-15 12:38:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:27,038 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-15 12:38:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-10-15 12:38:27,038 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 224 [2018-10-15 12:38:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:27,040 INFO L225 Difference]: With dead ends: 232 [2018-10-15 12:38:27,040 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 12:38:27,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9600 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=11969, Invalid=29851, Unknown=0, NotChecked=0, Total=41820 [2018-10-15 12:38:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 12:38:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-10-15 12:38:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 12:38:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-15 12:38:27,044 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 224 [2018-10-15 12:38:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:27,045 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-15 12:38:27,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 12:38:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-15 12:38:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 12:38:27,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:27,046 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:27,046 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:27,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1253628928, now seen corresponding path program 41 times [2018-10-15 12:38:27,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:29,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:29,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 12:38:29,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 12:38:29,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 12:38:29,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1850, Invalid=5460, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 12:38:29,935 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 86 states. [2018-10-15 12:38:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:37,176 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-10-15 12:38:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-15 12:38:37,177 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 229 [2018-10-15 12:38:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:37,178 INFO L225 Difference]: With dead ends: 237 [2018-10-15 12:38:37,178 INFO L226 Difference]: Without dead ends: 237 [2018-10-15 12:38:37,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10086 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12555, Invalid=31335, Unknown=0, NotChecked=0, Total=43890 [2018-10-15 12:38:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-15 12:38:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-10-15 12:38:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-15 12:38:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-15 12:38:37,183 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 229 [2018-10-15 12:38:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:37,184 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-15 12:38:37,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 12:38:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-15 12:38:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-15 12:38:37,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:37,185 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:37,185 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:37,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1936011116, now seen corresponding path program 42 times [2018-10-15 12:38:37,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:40,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:40,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 12:38:40,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 12:38:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 12:38:40,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1937, Invalid=5719, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:38:40,026 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 88 states. [2018-10-15 12:38:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:48,650 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-10-15 12:38:48,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-15 12:38:48,651 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 234 [2018-10-15 12:38:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:48,652 INFO L225 Difference]: With dead ends: 242 [2018-10-15 12:38:48,652 INFO L226 Difference]: Without dead ends: 242 [2018-10-15 12:38:48,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10584 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=13155, Invalid=32855, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:38:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-15 12:38:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-15 12:38:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 12:38:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-15 12:38:48,658 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 234 [2018-10-15 12:38:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:48,658 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-15 12:38:48,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 12:38:48,659 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-15 12:38:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 12:38:48,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:48,660 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:48,660 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:48,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1436641152, now seen corresponding path program 43 times [2018-10-15 12:38:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:51,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:51,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 12:38:51,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 12:38:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 12:38:51,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=5984, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:38:51,994 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 90 states. [2018-10-15 12:39:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:00,480 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-15 12:39:00,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-15 12:39:00,481 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 239 [2018-10-15 12:39:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:00,482 INFO L225 Difference]: With dead ends: 247 [2018-10-15 12:39:00,482 INFO L226 Difference]: Without dead ends: 247 [2018-10-15 12:39:00,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11094 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=13769, Invalid=34411, Unknown=0, NotChecked=0, Total=48180 [2018-10-15 12:39:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-15 12:39:00,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-10-15 12:39:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 12:39:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-15 12:39:00,487 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 239 [2018-10-15 12:39:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:00,488 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-15 12:39:00,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 12:39:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-15 12:39:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-15 12:39:00,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:00,489 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:00,490 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:00,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash -711531500, now seen corresponding path program 44 times [2018-10-15 12:39:00,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:03,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:03,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-15 12:39:03,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-15 12:39:03,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-15 12:39:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2117, Invalid=6255, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 12:39:03,362 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 92 states. [2018-10-15 12:39:11,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:11,820 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-10-15 12:39:11,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 12:39:11,820 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 244 [2018-10-15 12:39:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:11,821 INFO L225 Difference]: With dead ends: 252 [2018-10-15 12:39:11,822 INFO L226 Difference]: Without dead ends: 252 [2018-10-15 12:39:11,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11616 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14397, Invalid=36003, Unknown=0, NotChecked=0, Total=50400 [2018-10-15 12:39:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-15 12:39:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2018-10-15 12:39:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-15 12:39:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-10-15 12:39:11,825 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 244 [2018-10-15 12:39:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:11,825 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-10-15 12:39:11,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-15 12:39:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-10-15 12:39:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 12:39:11,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:11,827 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:11,827 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:11,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash -446515968, now seen corresponding path program 45 times [2018-10-15 12:39:11,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:14,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:14,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-15 12:39:14,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-15 12:39:14,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-15 12:39:14,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2210, Invalid=6532, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 12:39:14,924 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 94 states. [2018-10-15 12:39:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:23,586 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-15 12:39:23,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-15 12:39:23,586 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 249 [2018-10-15 12:39:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:23,587 INFO L225 Difference]: With dead ends: 257 [2018-10-15 12:39:23,588 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 12:39:23,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12150 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15039, Invalid=37631, Unknown=0, NotChecked=0, Total=52670 [2018-10-15 12:39:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 12:39:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-10-15 12:39:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-15 12:39:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-15 12:39:23,593 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 249 [2018-10-15 12:39:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:23,593 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-15 12:39:23,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-15 12:39:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-15 12:39:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-15 12:39:23,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:23,595 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:23,595 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:23,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2133890964, now seen corresponding path program 46 times [2018-10-15 12:39:23,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:26,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:26,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 12:39:26,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 12:39:26,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 12:39:26,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2305, Invalid=6815, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 12:39:26,908 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 96 states. [2018-10-15 12:39:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:36,252 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-15 12:39:36,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-10-15 12:39:36,253 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 254 [2018-10-15 12:39:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:36,254 INFO L225 Difference]: With dead ends: 262 [2018-10-15 12:39:36,254 INFO L226 Difference]: Without dead ends: 262 [2018-10-15 12:39:36,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12696 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=15695, Invalid=39295, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 12:39:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-15 12:39:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-10-15 12:39:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 12:39:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-15 12:39:36,258 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 254 [2018-10-15 12:39:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:36,261 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-15 12:39:36,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 12:39:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-15 12:39:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 12:39:36,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:36,262 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:36,263 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:36,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:36,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1588776576, now seen corresponding path program 47 times [2018-10-15 12:39:36,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:39,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:39,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-10-15 12:39:39,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-15 12:39:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-15 12:39:39,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2402, Invalid=7104, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 12:39:39,474 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 98 states. [2018-10-15 12:39:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:48,757 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-15 12:39:48,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-15 12:39:48,757 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 259 [2018-10-15 12:39:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:48,758 INFO L225 Difference]: With dead ends: 267 [2018-10-15 12:39:48,758 INFO L226 Difference]: Without dead ends: 267 [2018-10-15 12:39:48,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13254 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16365, Invalid=40995, Unknown=0, NotChecked=0, Total=57360 [2018-10-15 12:39:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-15 12:39:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-10-15 12:39:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-15 12:39:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-15 12:39:48,762 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 259 [2018-10-15 12:39:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:48,763 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-15 12:39:48,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-15 12:39:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-15 12:39:48,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-15 12:39:48,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:48,764 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:48,764 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:48,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash 417327892, now seen corresponding path program 48 times [2018-10-15 12:39:48,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:52,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:52,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-10-15 12:39:52,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-15 12:39:52,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-15 12:39:52,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2501, Invalid=7399, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 12:39:52,349 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 100 states. [2018-10-15 12:40:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:02,487 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-15 12:40:02,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-10-15 12:40:02,487 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 264 [2018-10-15 12:40:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:02,488 INFO L225 Difference]: With dead ends: 272 [2018-10-15 12:40:02,488 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 12:40:02,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13824 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17049, Invalid=42731, Unknown=0, NotChecked=0, Total=59780 [2018-10-15 12:40:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 12:40:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-10-15 12:40:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-15 12:40:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-15 12:40:02,494 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 264 [2018-10-15 12:40:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:02,494 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-15 12:40:02,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-15 12:40:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-15 12:40:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 12:40:02,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:02,496 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:02,496 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:02,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:02,496 INFO L82 PathProgramCache]: Analyzing trace with hash 967183872, now seen corresponding path program 49 times [2018-10-15 12:40:02,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:06,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:06,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 12:40:06,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 12:40:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 12:40:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2602, Invalid=7700, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 12:40:06,111 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 102 states. [2018-10-15 12:40:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:16,460 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-15 12:40:16,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-15 12:40:16,460 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 269 [2018-10-15 12:40:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:16,462 INFO L225 Difference]: With dead ends: 277 [2018-10-15 12:40:16,462 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 12:40:16,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14406 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=17747, Invalid=44503, Unknown=0, NotChecked=0, Total=62250 [2018-10-15 12:40:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 12:40:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-10-15 12:40:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-15 12:40:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-15 12:40:16,468 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 269 [2018-10-15 12:40:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:16,469 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-15 12:40:16,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 12:40:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-15 12:40:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-15 12:40:16,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:16,470 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:16,471 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:16,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:16,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1008524948, now seen corresponding path program 50 times [2018-10-15 12:40:16,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:20,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:20,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-10-15 12:40:20,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-15 12:40:20,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-15 12:40:20,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2705, Invalid=8007, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 12:40:20,285 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 104 states. [2018-10-15 12:40:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:31,543 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-10-15 12:40:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-10-15 12:40:31,543 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 274 [2018-10-15 12:40:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:31,544 INFO L225 Difference]: With dead ends: 282 [2018-10-15 12:40:31,545 INFO L226 Difference]: Without dead ends: 282 [2018-10-15 12:40:31,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15000 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=18459, Invalid=46311, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 12:40:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-15 12:40:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-10-15 12:40:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-15 12:40:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-10-15 12:40:31,549 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 274 [2018-10-15 12:40:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:31,550 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-10-15 12:40:31,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-15 12:40:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-10-15 12:40:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 12:40:31,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:31,551 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:31,552 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:31,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1073040000, now seen corresponding path program 51 times [2018-10-15 12:40:31,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:35,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:35,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-10-15 12:40:35,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-15 12:40:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-15 12:40:35,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2810, Invalid=8320, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 12:40:35,414 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 106 states. [2018-10-15 12:40:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:46,779 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-15 12:40:46,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 12:40:46,779 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 279 [2018-10-15 12:40:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:46,780 INFO L225 Difference]: With dead ends: 287 [2018-10-15 12:40:46,781 INFO L226 Difference]: Without dead ends: 287 [2018-10-15 12:40:46,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15606 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19185, Invalid=48155, Unknown=0, NotChecked=0, Total=67340 [2018-10-15 12:40:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-15 12:40:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-10-15 12:40:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-15 12:40:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-15 12:40:46,784 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 279 [2018-10-15 12:40:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:46,785 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-15 12:40:46,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-15 12:40:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-15 12:40:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-15 12:40:46,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:46,786 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:46,786 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:46,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:46,787 INFO L82 PathProgramCache]: Analyzing trace with hash 207581716, now seen corresponding path program 52 times [2018-10-15 12:40:46,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6682 backedges. 0 proven. 6682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:50,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:50,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 12:40:50,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 12:40:50,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 12:40:50,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2917, Invalid=8639, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:40:50,692 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 108 states. [2018-10-15 12:41:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:02,523 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-10-15 12:41:02,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-10-15 12:41:02,523 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 284 [2018-10-15 12:41:02,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:02,524 INFO L225 Difference]: With dead ends: 292 [2018-10-15 12:41:02,524 INFO L226 Difference]: Without dead ends: 292 [2018-10-15 12:41:02,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16224 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=19925, Invalid=50035, Unknown=0, NotChecked=0, Total=69960 [2018-10-15 12:41:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-15 12:41:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2018-10-15 12:41:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:41:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 12:41:02,528 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 284 [2018-10-15 12:41:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:02,529 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 12:41:02,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 12:41:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 12:41:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:41:02,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:02,530 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:02,530 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:02,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash -71112960, now seen corresponding path program 53 times [2018-10-15 12:41:02,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6943 backedges. 0 proven. 6943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:06,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:06,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-10-15 12:41:06,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-15 12:41:06,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-15 12:41:06,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3026, Invalid=8964, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 12:41:06,456 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 110 states. [2018-10-15 12:41:18,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:18,527 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-10-15 12:41:18,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-10-15 12:41:18,528 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 289 [2018-10-15 12:41:18,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:18,529 INFO L225 Difference]: With dead ends: 297 [2018-10-15 12:41:18,529 INFO L226 Difference]: Without dead ends: 297 [2018-10-15 12:41:18,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16854 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20679, Invalid=51951, Unknown=0, NotChecked=0, Total=72630 [2018-10-15 12:41:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-15 12:41:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2018-10-15 12:41:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 12:41:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-10-15 12:41:18,533 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 289 [2018-10-15 12:41:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:18,534 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-10-15 12:41:18,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-15 12:41:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-10-15 12:41:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-15 12:41:18,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:18,535 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:18,536 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:18,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1222662764, now seen corresponding path program 54 times [2018-10-15 12:41:18,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 0 proven. 7209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:22,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:22,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-10-15 12:41:22,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-15 12:41:22,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-15 12:41:22,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3137, Invalid=9295, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 12:41:22,856 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 112 states. [2018-10-15 12:41:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:35,242 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-15 12:41:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-15 12:41:35,243 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 294 [2018-10-15 12:41:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:35,244 INFO L225 Difference]: With dead ends: 302 [2018-10-15 12:41:35,244 INFO L226 Difference]: Without dead ends: 302 [2018-10-15 12:41:35,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17496 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21447, Invalid=53903, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 12:41:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-15 12:41:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-10-15 12:41:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-15 12:41:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-10-15 12:41:35,249 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 294 [2018-10-15 12:41:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:35,249 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-10-15 12:41:35,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-15 12:41:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-10-15 12:41:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 12:41:35,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:35,251 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:35,251 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:35,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash -359210112, now seen corresponding path program 55 times [2018-10-15 12:41:35,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7480 backedges. 0 proven. 7480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:39,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:39,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-10-15 12:41:39,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-15 12:41:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-15 12:41:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=9632, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 12:41:39,742 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 114 states. [2018-10-15 12:41:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:53,041 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-15 12:41:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-15 12:41:53,042 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 299 [2018-10-15 12:41:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:53,043 INFO L225 Difference]: With dead ends: 307 [2018-10-15 12:41:53,043 INFO L226 Difference]: Without dead ends: 307 [2018-10-15 12:41:53,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18150 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=22229, Invalid=55891, Unknown=0, NotChecked=0, Total=78120 [2018-10-15 12:41:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-15 12:41:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2018-10-15 12:41:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-15 12:41:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-15 12:41:53,047 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 299 [2018-10-15 12:41:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:53,048 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-15 12:41:53,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-15 12:41:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-15 12:41:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-15 12:41:53,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:53,050 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:53,050 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:53,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:53,050 INFO L82 PathProgramCache]: Analyzing trace with hash -204113644, now seen corresponding path program 56 times [2018-10-15 12:41:53,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7756 backedges. 0 proven. 7756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:57,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:57,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-10-15 12:41:57,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-15 12:41:57,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-15 12:41:57,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3365, Invalid=9975, Unknown=0, NotChecked=0, Total=13340 [2018-10-15 12:41:57,487 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 116 states. [2018-10-15 12:42:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:10,808 INFO L93 Difference]: Finished difference Result 312 states and 312 transitions. [2018-10-15 12:42:10,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-10-15 12:42:10,809 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 304 [2018-10-15 12:42:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:10,810 INFO L225 Difference]: With dead ends: 312 [2018-10-15 12:42:10,810 INFO L226 Difference]: Without dead ends: 312 [2018-10-15 12:42:10,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18816 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=23025, Invalid=57915, Unknown=0, NotChecked=0, Total=80940 [2018-10-15 12:42:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-15 12:42:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2018-10-15 12:42:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-15 12:42:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-10-15 12:42:10,815 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 304 [2018-10-15 12:42:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:10,815 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-10-15 12:42:10,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-15 12:42:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-10-15 12:42:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 12:42:10,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:10,817 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:10,817 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:10,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:10,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1073299456, now seen corresponding path program 57 times [2018-10-15 12:42:10,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8037 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:15,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:15,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-10-15 12:42:15,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-15 12:42:15,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-15 12:42:15,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3482, Invalid=10324, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 12:42:15,631 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 118 states. [2018-10-15 12:42:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:29,650 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-15 12:42:29,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-15 12:42:29,651 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 309 [2018-10-15 12:42:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:29,652 INFO L225 Difference]: With dead ends: 317 [2018-10-15 12:42:29,652 INFO L226 Difference]: Without dead ends: 317 [2018-10-15 12:42:29,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19494 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=23835, Invalid=59975, Unknown=0, NotChecked=0, Total=83810 [2018-10-15 12:42:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-15 12:42:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2018-10-15 12:42:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-15 12:42:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-15 12:42:29,658 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 309 [2018-10-15 12:42:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:29,658 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-15 12:42:29,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-15 12:42:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-15 12:42:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-15 12:42:29,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:29,660 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:29,660 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:29,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:29,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2080838508, now seen corresponding path program 58 times [2018-10-15 12:42:29,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8323 backedges. 0 proven. 8323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:34,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:34,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-10-15 12:42:34,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-15 12:42:34,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-15 12:42:34,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3601, Invalid=10679, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 12:42:34,449 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 120 states. [2018-10-15 12:42:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:48,420 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-10-15 12:42:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-15 12:42:48,420 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 314 [2018-10-15 12:42:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:48,422 INFO L225 Difference]: With dead ends: 322 [2018-10-15 12:42:48,422 INFO L226 Difference]: Without dead ends: 322 [2018-10-15 12:42:48,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20184 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=24659, Invalid=62071, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 12:42:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-15 12:42:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-10-15 12:42:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 12:42:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-15 12:42:48,426 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 314 [2018-10-15 12:42:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:48,426 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-15 12:42:48,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-15 12:42:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-15 12:42:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 12:42:48,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:48,428 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:48,428 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:48,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:48,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1701969024, now seen corresponding path program 59 times [2018-10-15 12:42:48,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8614 backedges. 0 proven. 8614 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:53,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:53,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-10-15 12:42:53,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-15 12:42:53,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-15 12:42:53,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3722, Invalid=11040, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 12:42:53,596 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 122 states. [2018-10-15 12:43:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:08,373 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-10-15 12:43:08,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-10-15 12:43:08,373 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 319 [2018-10-15 12:43:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:08,374 INFO L225 Difference]: With dead ends: 327 [2018-10-15 12:43:08,375 INFO L226 Difference]: Without dead ends: 327 [2018-10-15 12:43:08,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20886 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=25497, Invalid=64203, Unknown=0, NotChecked=0, Total=89700 [2018-10-15 12:43:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-15 12:43:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-15 12:43:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-15 12:43:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-10-15 12:43:08,379 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 319 [2018-10-15 12:43:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:08,379 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-10-15 12:43:08,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-15 12:43:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-10-15 12:43:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-15 12:43:08,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:08,380 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:08,380 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:08,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1291714540, now seen corresponding path program 60 times [2018-10-15 12:43:08,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8910 backedges. 0 proven. 8910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:13,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:13,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-10-15 12:43:13,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-15 12:43:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-15 12:43:13,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3845, Invalid=11407, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 12:43:13,591 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 124 states. [2018-10-15 12:43:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:28,812 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-10-15 12:43:28,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-10-15 12:43:28,813 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 324 [2018-10-15 12:43:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:28,814 INFO L225 Difference]: With dead ends: 332 [2018-10-15 12:43:28,815 INFO L226 Difference]: Without dead ends: 332 [2018-10-15 12:43:28,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21600 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=26349, Invalid=66371, Unknown=0, NotChecked=0, Total=92720 [2018-10-15 12:43:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-15 12:43:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-10-15 12:43:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-15 12:43:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-10-15 12:43:28,820 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 324 [2018-10-15 12:43:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:28,820 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-10-15 12:43:28,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-15 12:43:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-10-15 12:43:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-15 12:43:28,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:28,822 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:28,822 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:28,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:28,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2055805184, now seen corresponding path program 61 times [2018-10-15 12:43:28,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9211 backedges. 0 proven. 9211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:34,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:34,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-10-15 12:43:34,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-15 12:43:34,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-15 12:43:34,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3970, Invalid=11780, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 12:43:34,353 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 126 states. [2018-10-15 12:43:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:50,378 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-15 12:43:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-15 12:43:50,378 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 329 [2018-10-15 12:43:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:50,379 INFO L225 Difference]: With dead ends: 337 [2018-10-15 12:43:50,379 INFO L226 Difference]: Without dead ends: 337 [2018-10-15 12:43:50,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22326 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=27215, Invalid=68575, Unknown=0, NotChecked=0, Total=95790 [2018-10-15 12:43:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-15 12:43:50,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2018-10-15 12:43:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-15 12:43:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-10-15 12:43:50,385 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 329 [2018-10-15 12:43:50,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:50,385 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-10-15 12:43:50,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-15 12:43:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-10-15 12:43:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-15 12:43:50,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:50,387 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:50,388 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:50,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:50,388 INFO L82 PathProgramCache]: Analyzing trace with hash -697781356, now seen corresponding path program 62 times [2018-10-15 12:43:50,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9517 backedges. 0 proven. 9517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:56,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:56,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-10-15 12:43:56,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-15 12:43:56,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-15 12:43:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=12159, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 12:43:56,022 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 128 states. [2018-10-15 12:44:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:11,666 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2018-10-15 12:44:11,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-10-15 12:44:11,667 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 334 [2018-10-15 12:44:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:11,668 INFO L225 Difference]: With dead ends: 342 [2018-10-15 12:44:11,669 INFO L226 Difference]: Without dead ends: 342 [2018-10-15 12:44:11,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23064 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=28095, Invalid=70815, Unknown=0, NotChecked=0, Total=98910 [2018-10-15 12:44:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-15 12:44:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-10-15 12:44:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-15 12:44:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-10-15 12:44:11,674 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 334 [2018-10-15 12:44:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:11,674 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-10-15 12:44:11,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-15 12:44:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-10-15 12:44:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 12:44:11,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:11,675 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:11,675 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:11,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash -725183104, now seen corresponding path program 63 times [2018-10-15 12:44:11,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat