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/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:26:10,252 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:26:10,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:26:10,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:26:10,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:26:10,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:26:10,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:26:10,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:26:10,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:26:10,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:26:10,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:26:10,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:26:10,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:26:10,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:26:10,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:26:10,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:26:10,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:26:10,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:26:10,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:26:10,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:26:10,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:26:10,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:26:10,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:26:10,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:26:10,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:26:10,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:26:10,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:26:10,306 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:26:10,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:26:10,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:26:10,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:26:10,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:26:10,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:26:10,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:26:10,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:26:10,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:26:10,311 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-14 16:26:10,322 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:26:10,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:26:10,323 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:26:10,326 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:26:10,326 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:26:10,327 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:26:10,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:26:10,327 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:26:10,328 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:26:10,328 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:26:10,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:26:10,328 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:26:10,328 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:26:10,330 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:26:10,330 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:26:10,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:26:10,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:26:10,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:26:10,401 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:26:10,401 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:26:10,402 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl [2018-10-14 16:26:10,402 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl' [2018-10-14 16:26:10,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:26:10,462 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:26:10,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:26:10,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:26:10,463 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:26:10,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:10" (1/1) ... [2018-10-14 16:26:10,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:10" (1/1) ... [2018-10-14 16:26:10,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:10" (1/1) ... [2018-10-14 16:26:10,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:10" (1/1) ... [2018-10-14 16:26:10,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:10" (1/1) ... [2018-10-14 16:26:10,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:10" (1/1) ... [2018-10-14 16:26:10,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:10" (1/1) ... [2018-10-14 16:26:10,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:26:10,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:26:10,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:26:10,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:26:10,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 16:26:10,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:26:10,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:26:10,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:26:11,100 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:26:11,101 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:26:11 BoogieIcfgContainer [2018-10-14 16:26:11,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:26:11,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:26:11,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:26:11,106 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:26:11,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:10" (1/2) ... [2018-10-14 16:26:11,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c11f7e and model type ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:26:11, skipping insertion in model container [2018-10-14 16:26:11,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:26:11" (2/2) ... [2018-10-14 16:26:11,110 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c_13.bpl [2018-10-14 16:26:11,120 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:26:11,129 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:26:11,146 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:26:11,175 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:26:11,176 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:26:11,176 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:26:11,177 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:26:11,177 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:26:11,177 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:26:11,177 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:26:11,177 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:26:11,177 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:26:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-10-14 16:26:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-14 16:26:11,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:11,207 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-14 16:26:11,208 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:11,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:11,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1339383475, now seen corresponding path program 1 times [2018-10-14 16:26:11,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:11,440 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-14 16:26:11,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:26:11,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-14 16:26:11,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 16:26:11,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 16:26:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 16:26:11,464 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2018-10-14 16:26:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:11,644 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2018-10-14 16:26:11,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 16:26:11,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-14 16:26:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:11,658 INFO L225 Difference]: With dead ends: 128 [2018-10-14 16:26:11,658 INFO L226 Difference]: Without dead ends: 128 [2018-10-14 16:26:11,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 16:26:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-14 16:26:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 75. [2018-10-14 16:26:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-14 16:26:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-10-14 16:26:11,706 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 24 [2018-10-14 16:26:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:11,706 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-10-14 16:26:11,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 16:26:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-10-14 16:26:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-14 16:26:11,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:11,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:11,709 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:11,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:11,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1869929568, now seen corresponding path program 1 times [2018-10-14 16:26:11,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:11,954 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-14 16:26:11,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:11,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 16:26:11,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 16:26:11,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 16:26:11,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-14 16:26:11,964 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 5 states. [2018-10-14 16:26:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:12,220 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-10-14 16:26:12,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 16:26:12,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-10-14 16:26:12,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:12,225 INFO L225 Difference]: With dead ends: 168 [2018-10-14 16:26:12,226 INFO L226 Difference]: Without dead ends: 168 [2018-10-14 16:26:12,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:26:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-14 16:26:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 115. [2018-10-14 16:26:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-14 16:26:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-10-14 16:26:12,240 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 50 [2018-10-14 16:26:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:12,241 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-10-14 16:26:12,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 16:26:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-10-14 16:26:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-14 16:26:12,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:12,244 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:12,245 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:12,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:12,245 INFO L82 PathProgramCache]: Analyzing trace with hash 908039603, now seen corresponding path program 2 times [2018-10-14 16:26:12,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:12,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:12,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 16:26:12,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:26:12,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:26:12,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:26:12,441 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 7 states. [2018-10-14 16:26:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:12,850 INFO L93 Difference]: Finished difference Result 208 states and 213 transitions. [2018-10-14 16:26:12,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:26:12,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-10-14 16:26:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:12,854 INFO L225 Difference]: With dead ends: 208 [2018-10-14 16:26:12,854 INFO L226 Difference]: Without dead ends: 208 [2018-10-14 16:26:12,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:26:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-14 16:26:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 155. [2018-10-14 16:26:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-14 16:26:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-10-14 16:26:12,884 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 76 [2018-10-14 16:26:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:12,885 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-10-14 16:26:12,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:26:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-10-14 16:26:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-14 16:26:12,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:12,890 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:12,890 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:12,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash -961708730, now seen corresponding path program 3 times [2018-10-14 16:26:12,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:13,489 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-14 16:26:13,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:13,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:26:13,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:26:13,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:26:13,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:26:13,492 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 9 states. [2018-10-14 16:26:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:13,987 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2018-10-14 16:26:13,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:26:13,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-10-14 16:26:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:13,994 INFO L225 Difference]: With dead ends: 248 [2018-10-14 16:26:13,994 INFO L226 Difference]: Without dead ends: 248 [2018-10-14 16:26:13,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:26:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-14 16:26:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 195. [2018-10-14 16:26:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-14 16:26:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 200 transitions. [2018-10-14 16:26:14,017 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 200 transitions. Word has length 102 [2018-10-14 16:26:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:14,019 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 200 transitions. [2018-10-14 16:26:14,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:26:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 200 transitions. [2018-10-14 16:26:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-14 16:26:14,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:14,023 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:14,023 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:14,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1599782119, now seen corresponding path program 4 times [2018-10-14 16:26:14,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:14,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:14,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 16:26:14,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 16:26:14,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 16:26:14,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:26:14,284 INFO L87 Difference]: Start difference. First operand 195 states and 200 transitions. Second operand 11 states. [2018-10-14 16:26:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:14,719 INFO L93 Difference]: Finished difference Result 288 states and 295 transitions. [2018-10-14 16:26:14,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 16:26:14,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 128 [2018-10-14 16:26:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:14,722 INFO L225 Difference]: With dead ends: 288 [2018-10-14 16:26:14,722 INFO L226 Difference]: Without dead ends: 288 [2018-10-14 16:26:14,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:26:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-14 16:26:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 235. [2018-10-14 16:26:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-14 16:26:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 241 transitions. [2018-10-14 16:26:14,735 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 241 transitions. Word has length 128 [2018-10-14 16:26:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:14,736 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 241 transitions. [2018-10-14 16:26:14,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 16:26:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 241 transitions. [2018-10-14 16:26:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-14 16:26:14,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:14,740 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:14,740 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:14,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:14,740 INFO L82 PathProgramCache]: Analyzing trace with hash 59873068, now seen corresponding path program 5 times [2018-10-14 16:26:14,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:15,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:15,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 16:26:15,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 16:26:15,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 16:26:15,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-14 16:26:15,097 INFO L87 Difference]: Start difference. First operand 235 states and 241 transitions. Second operand 13 states. [2018-10-14 16:26:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:15,516 INFO L93 Difference]: Finished difference Result 328 states and 336 transitions. [2018-10-14 16:26:15,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 16:26:15,517 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2018-10-14 16:26:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:15,520 INFO L225 Difference]: With dead ends: 328 [2018-10-14 16:26:15,521 INFO L226 Difference]: Without dead ends: 328 [2018-10-14 16:26:15,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:26:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-14 16:26:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 275. [2018-10-14 16:26:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-14 16:26:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 282 transitions. [2018-10-14 16:26:15,532 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 282 transitions. Word has length 154 [2018-10-14 16:26:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:15,533 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 282 transitions. [2018-10-14 16:26:15,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 16:26:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 282 transitions. [2018-10-14 16:26:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-14 16:26:15,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:15,537 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:15,537 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:15,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash 838936959, now seen corresponding path program 6 times [2018-10-14 16:26:15,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:15,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:15,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:26:15,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:26:15,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:26:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:26:15,864 INFO L87 Difference]: Start difference. First operand 275 states and 282 transitions. Second operand 15 states. [2018-10-14 16:26:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:16,278 INFO L93 Difference]: Finished difference Result 368 states and 377 transitions. [2018-10-14 16:26:16,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:26:16,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 180 [2018-10-14 16:26:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:16,282 INFO L225 Difference]: With dead ends: 368 [2018-10-14 16:26:16,282 INFO L226 Difference]: Without dead ends: 368 [2018-10-14 16:26:16,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:26:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-14 16:26:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 315. [2018-10-14 16:26:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-14 16:26:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 323 transitions. [2018-10-14 16:26:16,292 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 323 transitions. Word has length 180 [2018-10-14 16:26:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:16,293 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 323 transitions. [2018-10-14 16:26:16,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:26:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 323 transitions. [2018-10-14 16:26:16,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-14 16:26:16,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:16,297 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:16,298 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:16,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:16,298 INFO L82 PathProgramCache]: Analyzing trace with hash -192501230, now seen corresponding path program 7 times [2018-10-14 16:26:16,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:16,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:16,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 16:26:16,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 16:26:16,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 16:26:16,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-14 16:26:16,737 INFO L87 Difference]: Start difference. First operand 315 states and 323 transitions. Second operand 17 states. [2018-10-14 16:26:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:17,493 INFO L93 Difference]: Finished difference Result 408 states and 418 transitions. [2018-10-14 16:26:17,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 16:26:17,494 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 206 [2018-10-14 16:26:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:17,496 INFO L225 Difference]: With dead ends: 408 [2018-10-14 16:26:17,496 INFO L226 Difference]: Without dead ends: 408 [2018-10-14 16:26:17,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:26:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-14 16:26:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 355. [2018-10-14 16:26:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-14 16:26:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 364 transitions. [2018-10-14 16:26:17,504 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 364 transitions. Word has length 206 [2018-10-14 16:26:17,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:17,504 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 364 transitions. [2018-10-14 16:26:17,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 16:26:17,505 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 364 transitions. [2018-10-14 16:26:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-14 16:26:17,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:17,508 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:17,508 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:17,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1555613925, now seen corresponding path program 8 times [2018-10-14 16:26:17,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:19,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:19,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 16:26:19,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 16:26:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 16:26:19,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:26:19,089 INFO L87 Difference]: Start difference. First operand 355 states and 364 transitions. Second operand 19 states. [2018-10-14 16:26:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:19,518 INFO L93 Difference]: Finished difference Result 448 states and 459 transitions. [2018-10-14 16:26:19,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 16:26:19,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 232 [2018-10-14 16:26:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:19,521 INFO L225 Difference]: With dead ends: 448 [2018-10-14 16:26:19,522 INFO L226 Difference]: Without dead ends: 448 [2018-10-14 16:26:19,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:26:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-14 16:26:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 395. [2018-10-14 16:26:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-14 16:26:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 405 transitions. [2018-10-14 16:26:19,530 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 405 transitions. Word has length 232 [2018-10-14 16:26:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:19,531 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 405 transitions. [2018-10-14 16:26:19,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 16:26:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 405 transitions. [2018-10-14 16:26:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-14 16:26:19,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:19,533 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:19,533 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:19,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:19,534 INFO L82 PathProgramCache]: Analyzing trace with hash -936233480, now seen corresponding path program 9 times [2018-10-14 16:26:19,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 0 proven. 945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:19,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:19,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 16:26:19,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 16:26:19,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 16:26:19,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-14 16:26:19,919 INFO L87 Difference]: Start difference. First operand 395 states and 405 transitions. Second operand 21 states. [2018-10-14 16:26:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:20,622 INFO L93 Difference]: Finished difference Result 488 states and 500 transitions. [2018-10-14 16:26:20,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 16:26:20,622 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 258 [2018-10-14 16:26:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:20,627 INFO L225 Difference]: With dead ends: 488 [2018-10-14 16:26:20,627 INFO L226 Difference]: Without dead ends: 488 [2018-10-14 16:26:20,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:26:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-14 16:26:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 435. [2018-10-14 16:26:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-14 16:26:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 446 transitions. [2018-10-14 16:26:20,636 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 446 transitions. Word has length 258 [2018-10-14 16:26:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:20,636 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 446 transitions. [2018-10-14 16:26:20,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 16:26:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 446 transitions. [2018-10-14 16:26:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-14 16:26:20,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:20,638 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:20,639 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:20,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:20,639 INFO L82 PathProgramCache]: Analyzing trace with hash 596746571, now seen corresponding path program 10 times [2018-10-14 16:26:20,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:21,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:21,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 16:26:21,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 16:26:21,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 16:26:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:26:21,556 INFO L87 Difference]: Start difference. First operand 435 states and 446 transitions. Second operand 23 states. [2018-10-14 16:26:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:22,745 INFO L93 Difference]: Finished difference Result 528 states and 541 transitions. [2018-10-14 16:26:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 16:26:22,746 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 284 [2018-10-14 16:26:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:22,750 INFO L225 Difference]: With dead ends: 528 [2018-10-14 16:26:22,750 INFO L226 Difference]: Without dead ends: 528 [2018-10-14 16:26:22,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:26:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-14 16:26:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 475. [2018-10-14 16:26:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-14 16:26:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 487 transitions. [2018-10-14 16:26:22,759 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 487 transitions. Word has length 284 [2018-10-14 16:26:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:22,760 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 487 transitions. [2018-10-14 16:26:22,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 16:26:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 487 transitions. [2018-10-14 16:26:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-14 16:26:22,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:22,761 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:22,762 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:22,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:22,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1836694238, now seen corresponding path program 11 times [2018-10-14 16:26:22,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 0 proven. 1441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:23,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:23,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 16:26:23,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 16:26:23,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 16:26:23,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:26:23,224 INFO L87 Difference]: Start difference. First operand 475 states and 487 transitions. Second operand 25 states. [2018-10-14 16:26:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:23,878 INFO L93 Difference]: Finished difference Result 568 states and 582 transitions. [2018-10-14 16:26:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 16:26:23,879 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 310 [2018-10-14 16:26:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:23,883 INFO L225 Difference]: With dead ends: 568 [2018-10-14 16:26:23,883 INFO L226 Difference]: Without dead ends: 568 [2018-10-14 16:26:23,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:26:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-14 16:26:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 515. [2018-10-14 16:26:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-14 16:26:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 528 transitions. [2018-10-14 16:26:23,892 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 528 transitions. Word has length 310 [2018-10-14 16:26:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:23,893 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 528 transitions. [2018-10-14 16:26:23,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 16:26:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 528 transitions. [2018-10-14 16:26:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-14 16:26:23,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:23,895 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:23,896 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:23,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2039558833, now seen corresponding path program 12 times [2018-10-14 16:26:23,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 1728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:24,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:24,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 16:26:24,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 16:26:24,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 16:26:24,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:26:24,502 INFO L87 Difference]: Start difference. First operand 515 states and 528 transitions. Second operand 27 states. [2018-10-14 16:26:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:25,350 INFO L93 Difference]: Finished difference Result 608 states and 623 transitions. [2018-10-14 16:26:25,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 16:26:25,351 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 336 [2018-10-14 16:26:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:25,355 INFO L225 Difference]: With dead ends: 608 [2018-10-14 16:26:25,356 INFO L226 Difference]: Without dead ends: 608 [2018-10-14 16:26:25,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:26:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-14 16:26:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 555. [2018-10-14 16:26:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-14 16:26:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 569 transitions. [2018-10-14 16:26:25,365 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 569 transitions. Word has length 336 [2018-10-14 16:26:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:25,366 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 569 transitions. [2018-10-14 16:26:25,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 16:26:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 569 transitions. [2018-10-14 16:26:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-14 16:26:25,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:25,369 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:25,369 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:25,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:25,370 INFO L82 PathProgramCache]: Analyzing trace with hash -209536828, now seen corresponding path program 13 times [2018-10-14 16:26:25,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2041 backedges. 0 proven. 2041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:28,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:28,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 16:26:28,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 16:26:28,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 16:26:28,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-14 16:26:28,648 INFO L87 Difference]: Start difference. First operand 555 states and 569 transitions. Second operand 29 states. [2018-10-14 16:26:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:29,525 INFO L93 Difference]: Finished difference Result 648 states and 664 transitions. [2018-10-14 16:26:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 16:26:29,526 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 362 [2018-10-14 16:26:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:29,531 INFO L225 Difference]: With dead ends: 648 [2018-10-14 16:26:29,531 INFO L226 Difference]: Without dead ends: 648 [2018-10-14 16:26:29,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:26:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-14 16:26:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 595. [2018-10-14 16:26:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-10-14 16:26:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 610 transitions. [2018-10-14 16:26:29,541 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 610 transitions. Word has length 362 [2018-10-14 16:26:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:29,542 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 610 transitions. [2018-10-14 16:26:29,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 16:26:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 610 transitions. [2018-10-14 16:26:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-14 16:26:29,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:29,545 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:29,545 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:29,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:29,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1577255657, now seen corresponding path program 14 times [2018-10-14 16:26:29,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:31,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:31,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 16:26:31,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 16:26:31,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 16:26:31,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:26:31,228 INFO L87 Difference]: Start difference. First operand 595 states and 610 transitions. Second operand 31 states. [2018-10-14 16:26:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:31,978 INFO L93 Difference]: Finished difference Result 688 states and 705 transitions. [2018-10-14 16:26:31,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 16:26:31,979 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 388 [2018-10-14 16:26:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:31,983 INFO L225 Difference]: With dead ends: 688 [2018-10-14 16:26:31,984 INFO L226 Difference]: Without dead ends: 688 [2018-10-14 16:26:31,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 16:26:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-14 16:26:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 635. [2018-10-14 16:26:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-10-14 16:26:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 651 transitions. [2018-10-14 16:26:31,994 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 651 transitions. Word has length 388 [2018-10-14 16:26:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:31,995 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 651 transitions. [2018-10-14 16:26:31,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 16:26:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 651 transitions. [2018-10-14 16:26:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-14 16:26:31,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:31,998 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:31,998 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:31,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:31,999 INFO L82 PathProgramCache]: Analyzing trace with hash -374165590, now seen corresponding path program 15 times [2018-10-14 16:26:32,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 0 proven. 2745 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:33,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:33,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 16:26:33,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 16:26:33,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 16:26:33,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:26:33,512 INFO L87 Difference]: Start difference. First operand 635 states and 651 transitions. Second operand 33 states. [2018-10-14 16:26:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:34,261 INFO L93 Difference]: Finished difference Result 728 states and 746 transitions. [2018-10-14 16:26:34,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 16:26:34,262 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 414 [2018-10-14 16:26:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:34,267 INFO L225 Difference]: With dead ends: 728 [2018-10-14 16:26:34,267 INFO L226 Difference]: Without dead ends: 728 [2018-10-14 16:26:34,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:26:34,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-10-14 16:26:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 675. [2018-10-14 16:26:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-14 16:26:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 692 transitions. [2018-10-14 16:26:34,277 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 692 transitions. Word has length 414 [2018-10-14 16:26:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:34,278 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 692 transitions. [2018-10-14 16:26:34,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 16:26:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 692 transitions. [2018-10-14 16:26:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-14 16:26:34,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:34,281 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:34,282 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:34,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:34,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1873117059, now seen corresponding path program 16 times [2018-10-14 16:26:34,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:36,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:36,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 16:26:36,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 16:26:36,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 16:26:36,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:26:36,344 INFO L87 Difference]: Start difference. First operand 675 states and 692 transitions. Second operand 35 states. [2018-10-14 16:26:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:37,296 INFO L93 Difference]: Finished difference Result 768 states and 787 transitions. [2018-10-14 16:26:37,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 16:26:37,296 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 440 [2018-10-14 16:26:37,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:37,300 INFO L225 Difference]: With dead ends: 768 [2018-10-14 16:26:37,301 INFO L226 Difference]: Without dead ends: 768 [2018-10-14 16:26:37,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 16:26:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-10-14 16:26:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 715. [2018-10-14 16:26:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-14 16:26:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 733 transitions. [2018-10-14 16:26:37,312 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 733 transitions. Word has length 440 [2018-10-14 16:26:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:37,312 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 733 transitions. [2018-10-14 16:26:37,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 16:26:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 733 transitions. [2018-10-14 16:26:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-14 16:26:37,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:37,316 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:37,316 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:37,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1079042160, now seen corresponding path program 17 times [2018-10-14 16:26:37,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:38,448 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-14 16:26:38,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:38,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 16:26:38,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 16:26:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 16:26:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:26:38,450 INFO L87 Difference]: Start difference. First operand 715 states and 733 transitions. Second operand 37 states. [2018-10-14 16:26:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:39,398 INFO L93 Difference]: Finished difference Result 808 states and 828 transitions. [2018-10-14 16:26:39,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 16:26:39,398 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 466 [2018-10-14 16:26:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:39,402 INFO L225 Difference]: With dead ends: 808 [2018-10-14 16:26:39,402 INFO L226 Difference]: Without dead ends: 808 [2018-10-14 16:26:39,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 16:26:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-10-14 16:26:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 755. [2018-10-14 16:26:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-10-14 16:26:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 774 transitions. [2018-10-14 16:26:39,412 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 774 transitions. Word has length 466 [2018-10-14 16:26:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:39,413 INFO L481 AbstractCegarLoop]: Abstraction has 755 states and 774 transitions. [2018-10-14 16:26:39,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 16:26:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 774 transitions. [2018-10-14 16:26:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-14 16:26:39,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:39,417 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:39,417 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:39,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1215249635, now seen corresponding path program 18 times [2018-10-14 16:26:39,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3996 backedges. 0 proven. 3996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:41,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:41,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:26:41,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:26:41,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:26:41,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:26:41,449 INFO L87 Difference]: Start difference. First operand 755 states and 774 transitions. Second operand 39 states. [2018-10-14 16:26:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:42,467 INFO L93 Difference]: Finished difference Result 848 states and 869 transitions. [2018-10-14 16:26:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 16:26:42,468 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 492 [2018-10-14 16:26:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:42,472 INFO L225 Difference]: With dead ends: 848 [2018-10-14 16:26:42,472 INFO L226 Difference]: Without dead ends: 848 [2018-10-14 16:26:42,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 16:26:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-10-14 16:26:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 795. [2018-10-14 16:26:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-10-14 16:26:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 815 transitions. [2018-10-14 16:26:42,483 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 815 transitions. Word has length 492 [2018-10-14 16:26:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:42,483 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 815 transitions. [2018-10-14 16:26:42,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:26:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 815 transitions. [2018-10-14 16:26:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-10-14 16:26:42,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:42,487 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:42,488 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:42,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash 626886774, now seen corresponding path program 19 times [2018-10-14 16:26:42,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:43,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:43,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 16:26:43,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 16:26:43,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 16:26:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 16:26:43,363 INFO L87 Difference]: Start difference. First operand 795 states and 815 transitions. Second operand 41 states. [2018-10-14 16:26:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:44,531 INFO L93 Difference]: Finished difference Result 888 states and 910 transitions. [2018-10-14 16:26:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 16:26:44,532 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 518 [2018-10-14 16:26:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:44,537 INFO L225 Difference]: With dead ends: 888 [2018-10-14 16:26:44,537 INFO L226 Difference]: Without dead ends: 888 [2018-10-14 16:26:44,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 16:26:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-10-14 16:26:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 835. [2018-10-14 16:26:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-10-14 16:26:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 856 transitions. [2018-10-14 16:26:44,548 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 856 transitions. Word has length 518 [2018-10-14 16:26:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:44,548 INFO L481 AbstractCegarLoop]: Abstraction has 835 states and 856 transitions. [2018-10-14 16:26:44,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 16:26:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 856 transitions. [2018-10-14 16:26:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-10-14 16:26:44,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:44,553 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:44,553 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:44,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1044427337, now seen corresponding path program 20 times [2018-10-14 16:26:44,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4960 backedges. 0 proven. 4960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:45,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:45,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:26:45,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:26:45,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:26:45,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:26:45,433 INFO L87 Difference]: Start difference. First operand 835 states and 856 transitions. Second operand 43 states. [2018-10-14 16:26:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:47,051 INFO L93 Difference]: Finished difference Result 928 states and 951 transitions. [2018-10-14 16:26:47,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-14 16:26:47,052 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 544 [2018-10-14 16:26:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:47,057 INFO L225 Difference]: With dead ends: 928 [2018-10-14 16:26:47,057 INFO L226 Difference]: Without dead ends: 928 [2018-10-14 16:26:47,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 16:26:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-10-14 16:26:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 875. [2018-10-14 16:26:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-10-14 16:26:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 897 transitions. [2018-10-14 16:26:47,068 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 897 transitions. Word has length 544 [2018-10-14 16:26:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:47,069 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 897 transitions. [2018-10-14 16:26:47,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:26:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 897 transitions. [2018-10-14 16:26:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-14 16:26:47,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:47,074 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:47,074 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:47,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:47,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1793288796, now seen corresponding path program 21 times [2018-10-14 16:26:47,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5481 backedges. 0 proven. 5481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:49,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:49,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 16:26:49,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 16:26:49,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 16:26:49,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:26:49,029 INFO L87 Difference]: Start difference. First operand 875 states and 897 transitions. Second operand 45 states. [2018-10-14 16:26:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:51,354 INFO L93 Difference]: Finished difference Result 968 states and 992 transitions. [2018-10-14 16:26:51,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 16:26:51,357 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 570 [2018-10-14 16:26:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:51,361 INFO L225 Difference]: With dead ends: 968 [2018-10-14 16:26:51,361 INFO L226 Difference]: Without dead ends: 968 [2018-10-14 16:26:51,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 16:26:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-10-14 16:26:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 915. [2018-10-14 16:26:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-10-14 16:26:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 938 transitions. [2018-10-14 16:26:51,373 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 938 transitions. Word has length 570 [2018-10-14 16:26:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:51,373 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 938 transitions. [2018-10-14 16:26:51,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 16:26:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 938 transitions. [2018-10-14 16:26:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2018-10-14 16:26:51,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:51,378 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:51,378 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:51,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1240178513, now seen corresponding path program 22 times [2018-10-14 16:26:51,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6028 backedges. 0 proven. 6028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:52,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:52,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 16:26:52,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 16:26:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 16:26:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:26:52,492 INFO L87 Difference]: Start difference. First operand 915 states and 938 transitions. Second operand 47 states. [2018-10-14 16:26:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:53,949 INFO L93 Difference]: Finished difference Result 1008 states and 1033 transitions. [2018-10-14 16:26:53,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-14 16:26:53,949 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 596 [2018-10-14 16:26:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:53,954 INFO L225 Difference]: With dead ends: 1008 [2018-10-14 16:26:53,954 INFO L226 Difference]: Without dead ends: 1008 [2018-10-14 16:26:53,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 16:26:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2018-10-14 16:26:53,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 955. [2018-10-14 16:26:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-14 16:26:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 979 transitions. [2018-10-14 16:26:53,965 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 979 transitions. Word has length 596 [2018-10-14 16:26:53,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:53,965 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 979 transitions. [2018-10-14 16:26:53,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 16:26:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 979 transitions. [2018-10-14 16:26:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-14 16:26:53,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:53,970 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:53,971 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:53,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash -525974206, now seen corresponding path program 23 times [2018-10-14 16:26:53,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6601 backedges. 0 proven. 6601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:55,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:55,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 16:26:55,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 16:26:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 16:26:55,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 16:26:55,447 INFO L87 Difference]: Start difference. First operand 955 states and 979 transitions. Second operand 49 states. [2018-10-14 16:26:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:57,366 INFO L93 Difference]: Finished difference Result 1048 states and 1074 transitions. [2018-10-14 16:26:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 16:26:57,367 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 622 [2018-10-14 16:26:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:57,372 INFO L225 Difference]: With dead ends: 1048 [2018-10-14 16:26:57,372 INFO L226 Difference]: Without dead ends: 1048 [2018-10-14 16:26:57,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 16:26:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-10-14 16:26:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 995. [2018-10-14 16:26:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-14 16:26:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1020 transitions. [2018-10-14 16:26:57,383 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1020 transitions. Word has length 622 [2018-10-14 16:26:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:57,383 INFO L481 AbstractCegarLoop]: Abstraction has 995 states and 1020 transitions. [2018-10-14 16:26:57,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 16:26:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1020 transitions. [2018-10-14 16:26:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-10-14 16:26:57,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:57,389 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:57,389 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:57,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:57,389 INFO L82 PathProgramCache]: Analyzing trace with hash 611305493, now seen corresponding path program 24 times [2018-10-14 16:26:57,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:58,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:58,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 16:26:58,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 16:26:58,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 16:26:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:26:58,849 INFO L87 Difference]: Start difference. First operand 995 states and 1020 transitions. Second operand 51 states. [2018-10-14 16:27:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:00,359 INFO L93 Difference]: Finished difference Result 1088 states and 1115 transitions. [2018-10-14 16:27:00,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-14 16:27:00,360 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 648 [2018-10-14 16:27:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:00,365 INFO L225 Difference]: With dead ends: 1088 [2018-10-14 16:27:00,365 INFO L226 Difference]: Without dead ends: 1088 [2018-10-14 16:27:00,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 16:27:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-10-14 16:27:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1035. [2018-10-14 16:27:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-10-14 16:27:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1061 transitions. [2018-10-14 16:27:00,376 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1061 transitions. Word has length 648 [2018-10-14 16:27:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:00,377 INFO L481 AbstractCegarLoop]: Abstraction has 1035 states and 1061 transitions. [2018-10-14 16:27:00,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 16:27:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1061 transitions. [2018-10-14 16:27:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-14 16:27:00,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:00,382 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:00,383 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:00,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:00,383 INFO L82 PathProgramCache]: Analyzing trace with hash 927701288, now seen corresponding path program 25 times [2018-10-14 16:27:00,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7825 backedges. 0 proven. 7825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:02,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:02,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 16:27:02,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 16:27:02,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 16:27:02,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 16:27:02,299 INFO L87 Difference]: Start difference. First operand 1035 states and 1061 transitions. Second operand 53 states. [2018-10-14 16:27:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:04,112 INFO L93 Difference]: Finished difference Result 1128 states and 1156 transitions. [2018-10-14 16:27:04,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 16:27:04,113 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 674 [2018-10-14 16:27:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:04,118 INFO L225 Difference]: With dead ends: 1128 [2018-10-14 16:27:04,118 INFO L226 Difference]: Without dead ends: 1128 [2018-10-14 16:27:04,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 16:27:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2018-10-14 16:27:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1075. [2018-10-14 16:27:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-10-14 16:27:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1102 transitions. [2018-10-14 16:27:04,130 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1102 transitions. Word has length 674 [2018-10-14 16:27:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:04,131 INFO L481 AbstractCegarLoop]: Abstraction has 1075 states and 1102 transitions. [2018-10-14 16:27:04,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 16:27:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1102 transitions. [2018-10-14 16:27:04,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2018-10-14 16:27:04,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:04,137 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:04,137 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:04,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:04,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1911003013, now seen corresponding path program 26 times [2018-10-14 16:27:04,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8476 backedges. 0 proven. 8476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:05,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:05,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 16:27:05,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 16:27:05,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 16:27:05,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:27:05,704 INFO L87 Difference]: Start difference. First operand 1075 states and 1102 transitions. Second operand 55 states. [2018-10-14 16:27:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:07,831 INFO L93 Difference]: Finished difference Result 1168 states and 1197 transitions. [2018-10-14 16:27:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 16:27:07,832 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 700 [2018-10-14 16:27:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:07,837 INFO L225 Difference]: With dead ends: 1168 [2018-10-14 16:27:07,837 INFO L226 Difference]: Without dead ends: 1168 [2018-10-14 16:27:07,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 16:27:07,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-14 16:27:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1115. [2018-10-14 16:27:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-10-14 16:27:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1143 transitions. [2018-10-14 16:27:07,847 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1143 transitions. Word has length 700 [2018-10-14 16:27:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:07,847 INFO L481 AbstractCegarLoop]: Abstraction has 1115 states and 1143 transitions. [2018-10-14 16:27:07,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 16:27:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1143 transitions. [2018-10-14 16:27:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-14 16:27:07,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:07,854 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:07,854 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:07,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash -541530610, now seen corresponding path program 27 times [2018-10-14 16:27:07,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9153 backedges. 0 proven. 9153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:09,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:09,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-14 16:27:09,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-14 16:27:09,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-14 16:27:09,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 16:27:09,682 INFO L87 Difference]: Start difference. First operand 1115 states and 1143 transitions. Second operand 57 states. [2018-10-14 16:27:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:12,015 INFO L93 Difference]: Finished difference Result 1208 states and 1238 transitions. [2018-10-14 16:27:12,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 16:27:12,016 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 726 [2018-10-14 16:27:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:12,021 INFO L225 Difference]: With dead ends: 1208 [2018-10-14 16:27:12,021 INFO L226 Difference]: Without dead ends: 1208 [2018-10-14 16:27:12,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-14 16:27:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-10-14 16:27:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1155. [2018-10-14 16:27:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-14 16:27:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1184 transitions. [2018-10-14 16:27:12,030 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1184 transitions. Word has length 726 [2018-10-14 16:27:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:12,031 INFO L481 AbstractCegarLoop]: Abstraction has 1155 states and 1184 transitions. [2018-10-14 16:27:12,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-14 16:27:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1184 transitions. [2018-10-14 16:27:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2018-10-14 16:27:12,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:12,037 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:12,037 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:12,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:12,038 INFO L82 PathProgramCache]: Analyzing trace with hash -401358367, now seen corresponding path program 28 times [2018-10-14 16:27:12,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9856 backedges. 0 proven. 9856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:13,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:13,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 16:27:13,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 16:27:13,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 16:27:13,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 16:27:13,532 INFO L87 Difference]: Start difference. First operand 1155 states and 1184 transitions. Second operand 59 states. [2018-10-14 16:27:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:15,564 INFO L93 Difference]: Finished difference Result 1248 states and 1279 transitions. [2018-10-14 16:27:15,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 16:27:15,565 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 752 [2018-10-14 16:27:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:15,571 INFO L225 Difference]: With dead ends: 1248 [2018-10-14 16:27:15,571 INFO L226 Difference]: Without dead ends: 1248 [2018-10-14 16:27:15,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-14 16:27:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2018-10-14 16:27:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1195. [2018-10-14 16:27:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2018-10-14 16:27:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1225 transitions. [2018-10-14 16:27:15,582 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1225 transitions. Word has length 752 [2018-10-14 16:27:15,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:15,583 INFO L481 AbstractCegarLoop]: Abstraction has 1195 states and 1225 transitions. [2018-10-14 16:27:15,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 16:27:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1225 transitions. [2018-10-14 16:27:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-10-14 16:27:15,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:15,589 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:15,589 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:15,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1796451316, now seen corresponding path program 29 times [2018-10-14 16:27:15,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:17,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:17,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-14 16:27:17,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-14 16:27:17,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-14 16:27:17,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 16:27:17,575 INFO L87 Difference]: Start difference. First operand 1195 states and 1225 transitions. Second operand 61 states. [2018-10-14 16:27:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:19,986 INFO L93 Difference]: Finished difference Result 1288 states and 1320 transitions. [2018-10-14 16:27:19,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 16:27:19,986 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 778 [2018-10-14 16:27:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:19,992 INFO L225 Difference]: With dead ends: 1288 [2018-10-14 16:27:19,993 INFO L226 Difference]: Without dead ends: 1288 [2018-10-14 16:27:19,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-14 16:27:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2018-10-14 16:27:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1235. [2018-10-14 16:27:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-14 16:27:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1266 transitions. [2018-10-14 16:27:20,003 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1266 transitions. Word has length 778 [2018-10-14 16:27:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:20,003 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1266 transitions. [2018-10-14 16:27:20,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-14 16:27:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1266 transitions. [2018-10-14 16:27:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2018-10-14 16:27:20,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:20,008 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:20,008 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:20,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2007454791, now seen corresponding path program 30 times [2018-10-14 16:27:20,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11340 backedges. 0 proven. 11340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:22,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:22,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-14 16:27:22,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-14 16:27:22,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-14 16:27:22,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:27:22,546 INFO L87 Difference]: Start difference. First operand 1235 states and 1266 transitions. Second operand 63 states. [2018-10-14 16:27:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:25,017 INFO L93 Difference]: Finished difference Result 1328 states and 1361 transitions. [2018-10-14 16:27:25,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-14 16:27:25,017 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 804 [2018-10-14 16:27:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:25,023 INFO L225 Difference]: With dead ends: 1328 [2018-10-14 16:27:25,023 INFO L226 Difference]: Without dead ends: 1328 [2018-10-14 16:27:25,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-14 16:27:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-14 16:27:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1275. [2018-10-14 16:27:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2018-10-14 16:27:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1307 transitions. [2018-10-14 16:27:25,034 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1307 transitions. Word has length 804 [2018-10-14 16:27:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:25,034 INFO L481 AbstractCegarLoop]: Abstraction has 1275 states and 1307 transitions. [2018-10-14 16:27:25,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-14 16:27:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1307 transitions. [2018-10-14 16:27:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2018-10-14 16:27:25,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:25,039 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:25,040 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:25,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:25,040 INFO L82 PathProgramCache]: Analyzing trace with hash -356422950, now seen corresponding path program 31 times [2018-10-14 16:27:25,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12121 backedges. 0 proven. 12121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:26,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:26,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-14 16:27:26,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-14 16:27:26,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-14 16:27:26,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 16:27:26,979 INFO L87 Difference]: Start difference. First operand 1275 states and 1307 transitions. Second operand 65 states. [2018-10-14 16:27:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:29,628 INFO L93 Difference]: Finished difference Result 1368 states and 1402 transitions. [2018-10-14 16:27:29,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 16:27:29,629 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 830 [2018-10-14 16:27:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:29,635 INFO L225 Difference]: With dead ends: 1368 [2018-10-14 16:27:29,635 INFO L226 Difference]: Without dead ends: 1368 [2018-10-14 16:27:29,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-14 16:27:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2018-10-14 16:27:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1315. [2018-10-14 16:27:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2018-10-14 16:27:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1348 transitions. [2018-10-14 16:27:29,647 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1348 transitions. Word has length 830 [2018-10-14 16:27:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:29,648 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1348 transitions. [2018-10-14 16:27:29,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-14 16:27:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1348 transitions. [2018-10-14 16:27:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2018-10-14 16:27:29,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:29,653 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:29,653 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:29,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:29,654 INFO L82 PathProgramCache]: Analyzing trace with hash 844668845, now seen corresponding path program 32 times [2018-10-14 16:27:29,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12928 backedges. 0 proven. 12928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:33,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:33,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 16:27:33,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 16:27:33,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 16:27:33,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 16:27:33,240 INFO L87 Difference]: Start difference. First operand 1315 states and 1348 transitions. Second operand 67 states. [2018-10-14 16:27:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:36,157 INFO L93 Difference]: Finished difference Result 1408 states and 1443 transitions. [2018-10-14 16:27:36,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-14 16:27:36,158 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 856 [2018-10-14 16:27:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:36,164 INFO L225 Difference]: With dead ends: 1408 [2018-10-14 16:27:36,164 INFO L226 Difference]: Without dead ends: 1408 [2018-10-14 16:27:36,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-14 16:27:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-10-14 16:27:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1355. [2018-10-14 16:27:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2018-10-14 16:27:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1389 transitions. [2018-10-14 16:27:36,174 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1389 transitions. Word has length 856 [2018-10-14 16:27:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:36,175 INFO L481 AbstractCegarLoop]: Abstraction has 1355 states and 1389 transitions. [2018-10-14 16:27:36,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 16:27:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1389 transitions. [2018-10-14 16:27:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2018-10-14 16:27:36,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:36,181 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:36,181 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:36,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1348969152, now seen corresponding path program 33 times [2018-10-14 16:27:36,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13761 backedges. 0 proven. 13761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:38,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:38,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-14 16:27:38,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-14 16:27:38,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-14 16:27:38,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 16:27:38,359 INFO L87 Difference]: Start difference. First operand 1355 states and 1389 transitions. Second operand 69 states. [2018-10-14 16:27:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:41,056 INFO L93 Difference]: Finished difference Result 1448 states and 1484 transitions. [2018-10-14 16:27:41,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-14 16:27:41,056 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 882 [2018-10-14 16:27:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:41,061 INFO L225 Difference]: With dead ends: 1448 [2018-10-14 16:27:41,061 INFO L226 Difference]: Without dead ends: 1448 [2018-10-14 16:27:41,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-14 16:27:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2018-10-14 16:27:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1395. [2018-10-14 16:27:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1395 states. [2018-10-14 16:27:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1430 transitions. [2018-10-14 16:27:41,072 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1430 transitions. Word has length 882 [2018-10-14 16:27:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:41,073 INFO L481 AbstractCegarLoop]: Abstraction has 1395 states and 1430 transitions. [2018-10-14 16:27:41,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-14 16:27:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1430 transitions. [2018-10-14 16:27:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2018-10-14 16:27:41,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:41,079 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:41,079 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:41,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash 502080531, now seen corresponding path program 34 times [2018-10-14 16:27:41,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 14620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:43,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:43,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-14 16:27:43,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-14 16:27:43,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-14 16:27:43,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 16:27:43,448 INFO L87 Difference]: Start difference. First operand 1395 states and 1430 transitions. Second operand 71 states. [2018-10-14 16:27:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:46,476 INFO L93 Difference]: Finished difference Result 1488 states and 1525 transitions. [2018-10-14 16:27:46,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-14 16:27:46,476 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 908 [2018-10-14 16:27:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:46,483 INFO L225 Difference]: With dead ends: 1488 [2018-10-14 16:27:46,483 INFO L226 Difference]: Without dead ends: 1488 [2018-10-14 16:27:46,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-14 16:27:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2018-10-14 16:27:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1435. [2018-10-14 16:27:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435 states. [2018-10-14 16:27:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1471 transitions. [2018-10-14 16:27:46,495 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1471 transitions. Word has length 908 [2018-10-14 16:27:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:46,495 INFO L481 AbstractCegarLoop]: Abstraction has 1435 states and 1471 transitions. [2018-10-14 16:27:46,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-14 16:27:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1471 transitions. [2018-10-14 16:27:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2018-10-14 16:27:46,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:46,502 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:46,502 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:46,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:46,502 INFO L82 PathProgramCache]: Analyzing trace with hash -840182874, now seen corresponding path program 35 times [2018-10-14 16:27:46,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 15505 backedges. 0 proven. 15505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:49,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:49,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-14 16:27:49,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-14 16:27:49,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-14 16:27:49,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 16:27:49,223 INFO L87 Difference]: Start difference. First operand 1435 states and 1471 transitions. Second operand 73 states. [2018-10-14 16:27:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:52,321 INFO L93 Difference]: Finished difference Result 1528 states and 1566 transitions. [2018-10-14 16:27:52,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-14 16:27:52,322 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 934 [2018-10-14 16:27:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:52,327 INFO L225 Difference]: With dead ends: 1528 [2018-10-14 16:27:52,327 INFO L226 Difference]: Without dead ends: 1528 [2018-10-14 16:27:52,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-14 16:27:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-10-14 16:27:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1475. [2018-10-14 16:27:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2018-10-14 16:27:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1512 transitions. [2018-10-14 16:27:52,340 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1512 transitions. Word has length 934 [2018-10-14 16:27:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:52,341 INFO L481 AbstractCegarLoop]: Abstraction has 1475 states and 1512 transitions. [2018-10-14 16:27:52,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-14 16:27:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1512 transitions. [2018-10-14 16:27:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2018-10-14 16:27:52,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:52,348 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:52,348 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:52,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1335205511, now seen corresponding path program 36 times [2018-10-14 16:27:52,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16416 backedges. 0 proven. 16416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:27:54,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:54,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-14 16:27:54,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-14 16:27:54,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-14 16:27:54,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 16:27:54,966 INFO L87 Difference]: Start difference. First operand 1475 states and 1512 transitions. Second operand 75 states. [2018-10-14 16:27:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:58,617 INFO L93 Difference]: Finished difference Result 1568 states and 1607 transitions. [2018-10-14 16:27:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-14 16:27:58,624 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 960 [2018-10-14 16:27:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:58,629 INFO L225 Difference]: With dead ends: 1568 [2018-10-14 16:27:58,629 INFO L226 Difference]: Without dead ends: 1568 [2018-10-14 16:27:58,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-14 16:27:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2018-10-14 16:27:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1515. [2018-10-14 16:27:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2018-10-14 16:27:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1553 transitions. [2018-10-14 16:27:58,644 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1553 transitions. Word has length 960 [2018-10-14 16:27:58,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:58,645 INFO L481 AbstractCegarLoop]: Abstraction has 1515 states and 1553 transitions. [2018-10-14 16:27:58,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-14 16:27:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1553 transitions. [2018-10-14 16:27:58,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2018-10-14 16:27:58,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:58,654 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 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-14 16:27:58,654 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:58,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash 896761228, now seen corresponding path program 37 times [2018-10-14 16:27:58,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 17353 backedges. 0 proven. 17353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:28:01,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:01,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-14 16:28:01,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-14 16:28:01,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-14 16:28:01,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 16:28:01,154 INFO L87 Difference]: Start difference. First operand 1515 states and 1553 transitions. Second operand 77 states. [2018-10-14 16:28:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:04,650 INFO L93 Difference]: Finished difference Result 1608 states and 1648 transitions. [2018-10-14 16:28:04,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-14 16:28:04,650 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 986 [2018-10-14 16:28:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:04,656 INFO L225 Difference]: With dead ends: 1608 [2018-10-14 16:28:04,656 INFO L226 Difference]: Without dead ends: 1608 [2018-10-14 16:28:04,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-14 16:28:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2018-10-14 16:28:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1555. [2018-10-14 16:28:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-10-14 16:28:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1594 transitions. [2018-10-14 16:28:04,673 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1594 transitions. Word has length 986 [2018-10-14 16:28:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:04,674 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 1594 transitions. [2018-10-14 16:28:04,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-14 16:28:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1594 transitions. [2018-10-14 16:28:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2018-10-14 16:28:04,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:04,682 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 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-14 16:28:04,682 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:04,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:04,683 INFO L82 PathProgramCache]: Analyzing trace with hash 806737887, now seen corresponding path program 38 times [2018-10-14 16:28:04,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18316 backedges. 0 proven. 18316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:28:07,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:07,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-14 16:28:07,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-14 16:28:07,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-14 16:28:07,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 16:28:07,225 INFO L87 Difference]: Start difference. First operand 1555 states and 1594 transitions. Second operand 79 states. [2018-10-14 16:28:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:11,180 INFO L93 Difference]: Finished difference Result 1648 states and 1689 transitions. [2018-10-14 16:28:11,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-14 16:28:11,180 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 1012 [2018-10-14 16:28:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:11,185 INFO L225 Difference]: With dead ends: 1648 [2018-10-14 16:28:11,185 INFO L226 Difference]: Without dead ends: 1648 [2018-10-14 16:28:11,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-14 16:28:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2018-10-14 16:28:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1595. [2018-10-14 16:28:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2018-10-14 16:28:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 1635 transitions. [2018-10-14 16:28:11,201 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 1635 transitions. Word has length 1012 [2018-10-14 16:28:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:11,202 INFO L481 AbstractCegarLoop]: Abstraction has 1595 states and 1635 transitions. [2018-10-14 16:28:11,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-14 16:28:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 1635 transitions. [2018-10-14 16:28:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-14 16:28:11,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:11,211 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 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-14 16:28:11,211 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:11,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1499734130, now seen corresponding path program 39 times [2018-10-14 16:28:11,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 19305 backedges. 0 proven. 19305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:28:14,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:14,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-14 16:28:14,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-14 16:28:14,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-14 16:28:14,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 16:28:14,662 INFO L87 Difference]: Start difference. First operand 1595 states and 1635 transitions. Second operand 81 states. [2018-10-14 16:28:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:18,848 INFO L93 Difference]: Finished difference Result 1688 states and 1730 transitions. [2018-10-14 16:28:18,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-14 16:28:18,849 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1038 [2018-10-14 16:28:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:18,852 INFO L225 Difference]: With dead ends: 1688 [2018-10-14 16:28:18,853 INFO L226 Difference]: Without dead ends: 1688 [2018-10-14 16:28:18,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-14 16:28:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-10-14 16:28:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1635. [2018-10-14 16:28:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-10-14 16:28:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1676 transitions. [2018-10-14 16:28:18,867 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1676 transitions. Word has length 1038 [2018-10-14 16:28:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:18,867 INFO L481 AbstractCegarLoop]: Abstraction has 1635 states and 1676 transitions. [2018-10-14 16:28:18,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-14 16:28:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1676 transitions. [2018-10-14 16:28:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2018-10-14 16:28:18,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:18,877 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 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-14 16:28:18,878 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:18,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash 326436677, now seen corresponding path program 40 times [2018-10-14 16:28:18,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20320 backedges. 0 proven. 20320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:28:21,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:21,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-14 16:28:21,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-14 16:28:21,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-14 16:28:21,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 16:28:21,669 INFO L87 Difference]: Start difference. First operand 1635 states and 1676 transitions. Second operand 83 states. [2018-10-14 16:28:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:26,121 INFO L93 Difference]: Finished difference Result 1728 states and 1771 transitions. [2018-10-14 16:28:26,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-14 16:28:26,122 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 1064 [2018-10-14 16:28:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:26,126 INFO L225 Difference]: With dead ends: 1728 [2018-10-14 16:28:26,126 INFO L226 Difference]: Without dead ends: 1728 [2018-10-14 16:28:26,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-14 16:28:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2018-10-14 16:28:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1675. [2018-10-14 16:28:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1675 states. [2018-10-14 16:28:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 1717 transitions. [2018-10-14 16:28:26,138 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 1717 transitions. Word has length 1064 [2018-10-14 16:28:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:26,139 INFO L481 AbstractCegarLoop]: Abstraction has 1675 states and 1717 transitions. [2018-10-14 16:28:26,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-14 16:28:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1717 transitions. [2018-10-14 16:28:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1091 [2018-10-14 16:28:26,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:26,147 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 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-14 16:28:26,147 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:26,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:26,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1818442840, now seen corresponding path program 41 times [2018-10-14 16:28:26,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 21361 backedges. 0 proven. 21361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:28:29,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:29,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-14 16:28:29,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-14 16:28:29,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-14 16:28:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 16:28:29,383 INFO L87 Difference]: Start difference. First operand 1675 states and 1717 transitions. Second operand 85 states. [2018-10-14 16:28:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:33,805 INFO L93 Difference]: Finished difference Result 1768 states and 1812 transitions. [2018-10-14 16:28:33,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-14 16:28:33,806 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 1090 [2018-10-14 16:28:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:33,809 INFO L225 Difference]: With dead ends: 1768 [2018-10-14 16:28:33,810 INFO L226 Difference]: Without dead ends: 1768 [2018-10-14 16:28:33,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-14 16:28:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-14 16:28:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1715. [2018-10-14 16:28:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-10-14 16:28:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 1758 transitions. [2018-10-14 16:28:33,824 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 1758 transitions. Word has length 1090 [2018-10-14 16:28:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:33,825 INFO L481 AbstractCegarLoop]: Abstraction has 1715 states and 1758 transitions. [2018-10-14 16:28:33,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-14 16:28:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1758 transitions. [2018-10-14 16:28:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2018-10-14 16:28:33,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:33,838 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 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-14 16:28:33,838 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:33,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:33,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1632464811, now seen corresponding path program 42 times [2018-10-14 16:28:33,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 22428 backedges. 0 proven. 22428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:28:36,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:36,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-14 16:28:36,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-14 16:28:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-14 16:28:36,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 16:28:36,810 INFO L87 Difference]: Start difference. First operand 1715 states and 1758 transitions. Second operand 87 states. [2018-10-14 16:28:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:41,489 INFO L93 Difference]: Finished difference Result 1808 states and 1853 transitions. [2018-10-14 16:28:41,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-14 16:28:41,490 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1116 [2018-10-14 16:28:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:41,495 INFO L225 Difference]: With dead ends: 1808 [2018-10-14 16:28:41,495 INFO L226 Difference]: Without dead ends: 1808 [2018-10-14 16:28:41,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-14 16:28:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2018-10-14 16:28:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1755. [2018-10-14 16:28:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2018-10-14 16:28:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 1799 transitions. [2018-10-14 16:28:41,512 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 1799 transitions. Word has length 1116 [2018-10-14 16:28:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:41,513 INFO L481 AbstractCegarLoop]: Abstraction has 1755 states and 1799 transitions. [2018-10-14 16:28:41,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-14 16:28:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 1799 transitions. [2018-10-14 16:28:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1143 [2018-10-14 16:28:41,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:41,526 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 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-14 16:28:41,526 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:41,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1633046846, now seen corresponding path program 43 times [2018-10-14 16:28:41,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23521 backedges. 0 proven. 23521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:28:44,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:44,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-14 16:28:44,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-14 16:28:44,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-14 16:28:44,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 16:28:44,943 INFO L87 Difference]: Start difference. First operand 1755 states and 1799 transitions. Second operand 89 states. [2018-10-14 16:28:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:49,676 INFO L93 Difference]: Finished difference Result 1848 states and 1894 transitions. [2018-10-14 16:28:49,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-14 16:28:49,676 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1142 [2018-10-14 16:28:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:49,682 INFO L225 Difference]: With dead ends: 1848 [2018-10-14 16:28:49,682 INFO L226 Difference]: Without dead ends: 1848 [2018-10-14 16:28:49,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-14 16:28:49,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2018-10-14 16:28:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1795. [2018-10-14 16:28:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-10-14 16:28:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 1840 transitions. [2018-10-14 16:28:49,699 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 1840 transitions. Word has length 1142 [2018-10-14 16:28:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:49,700 INFO L481 AbstractCegarLoop]: Abstraction has 1795 states and 1840 transitions. [2018-10-14 16:28:49,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-14 16:28:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 1840 transitions. [2018-10-14 16:28:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1169 [2018-10-14 16:28:49,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:49,713 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 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-14 16:28:49,713 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:49,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:49,714 INFO L82 PathProgramCache]: Analyzing trace with hash 279220497, now seen corresponding path program 44 times [2018-10-14 16:28:49,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 24640 backedges. 0 proven. 24640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:28:53,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:53,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-14 16:28:53,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-14 16:28:53,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-14 16:28:53,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 16:28:53,009 INFO L87 Difference]: Start difference. First operand 1795 states and 1840 transitions. Second operand 91 states. [2018-10-14 16:28:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:58,230 INFO L93 Difference]: Finished difference Result 1888 states and 1935 transitions. [2018-10-14 16:28:58,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-14 16:28:58,231 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1168 [2018-10-14 16:28:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:58,235 INFO L225 Difference]: With dead ends: 1888 [2018-10-14 16:28:58,235 INFO L226 Difference]: Without dead ends: 1888 [2018-10-14 16:28:58,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-14 16:28:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2018-10-14 16:28:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1835. [2018-10-14 16:28:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2018-10-14 16:28:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 1881 transitions. [2018-10-14 16:28:58,253 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 1881 transitions. Word has length 1168 [2018-10-14 16:28:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:58,254 INFO L481 AbstractCegarLoop]: Abstraction has 1835 states and 1881 transitions. [2018-10-14 16:28:58,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-14 16:28:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 1881 transitions. [2018-10-14 16:28:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1195 [2018-10-14 16:28:58,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:58,267 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 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-14 16:28:58,267 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:58,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1264770852, now seen corresponding path program 45 times [2018-10-14 16:28:58,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 25785 backedges. 0 proven. 25785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:29:01,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:01,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-14 16:29:01,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-14 16:29:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-14 16:29:01,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 16:29:01,996 INFO L87 Difference]: Start difference. First operand 1835 states and 1881 transitions. Second operand 93 states. [2018-10-14 16:29:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:07,490 INFO L93 Difference]: Finished difference Result 1928 states and 1976 transitions. [2018-10-14 16:29:07,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-14 16:29:07,490 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1194 [2018-10-14 16:29:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:07,493 INFO L225 Difference]: With dead ends: 1928 [2018-10-14 16:29:07,494 INFO L226 Difference]: Without dead ends: 1928 [2018-10-14 16:29:07,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-14 16:29:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-10-14 16:29:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1875. [2018-10-14 16:29:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-10-14 16:29:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1922 transitions. [2018-10-14 16:29:07,508 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1922 transitions. Word has length 1194 [2018-10-14 16:29:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:07,509 INFO L481 AbstractCegarLoop]: Abstraction has 1875 states and 1922 transitions. [2018-10-14 16:29:07,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-14 16:29:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1922 transitions. [2018-10-14 16:29:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2018-10-14 16:29:07,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:07,519 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 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-14 16:29:07,519 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:07,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1757408119, now seen corresponding path program 46 times [2018-10-14 16:29:07,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 26956 backedges. 0 proven. 26956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:29:11,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:11,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-14 16:29:11,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-14 16:29:11,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-14 16:29:11,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 16:29:11,429 INFO L87 Difference]: Start difference. First operand 1875 states and 1922 transitions. Second operand 95 states. [2018-10-14 16:29:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:17,127 INFO L93 Difference]: Finished difference Result 1968 states and 2017 transitions. [2018-10-14 16:29:17,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-14 16:29:17,128 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1220 [2018-10-14 16:29:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:17,131 INFO L225 Difference]: With dead ends: 1968 [2018-10-14 16:29:17,131 INFO L226 Difference]: Without dead ends: 1968 [2018-10-14 16:29:17,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-14 16:29:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-10-14 16:29:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1915. [2018-10-14 16:29:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2018-10-14 16:29:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 1963 transitions. [2018-10-14 16:29:17,149 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 1963 transitions. Word has length 1220 [2018-10-14 16:29:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:17,150 INFO L481 AbstractCegarLoop]: Abstraction has 1915 states and 1963 transitions. [2018-10-14 16:29:17,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-14 16:29:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 1963 transitions. [2018-10-14 16:29:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2018-10-14 16:29:17,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:17,164 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 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-14 16:29:17,164 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:17,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:17,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1108449782, now seen corresponding path program 47 times [2018-10-14 16:29:17,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 28153 backedges. 0 proven. 28153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:29:21,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:21,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-14 16:29:21,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-14 16:29:21,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-14 16:29:21,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 16:29:21,280 INFO L87 Difference]: Start difference. First operand 1915 states and 1963 transitions. Second operand 97 states. [2018-10-14 16:29:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:26,823 INFO L93 Difference]: Finished difference Result 2008 states and 2058 transitions. [2018-10-14 16:29:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-14 16:29:26,824 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1246 [2018-10-14 16:29:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:26,827 INFO L225 Difference]: With dead ends: 2008 [2018-10-14 16:29:26,827 INFO L226 Difference]: Without dead ends: 2008 [2018-10-14 16:29:26,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-14 16:29:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2018-10-14 16:29:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1955. [2018-10-14 16:29:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1955 states. [2018-10-14 16:29:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2004 transitions. [2018-10-14 16:29:26,848 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2004 transitions. Word has length 1246 [2018-10-14 16:29:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:26,849 INFO L481 AbstractCegarLoop]: Abstraction has 1955 states and 2004 transitions. [2018-10-14 16:29:26,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-14 16:29:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2004 transitions. [2018-10-14 16:29:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1273 [2018-10-14 16:29:26,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:26,865 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 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-14 16:29:26,865 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:26,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:26,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1629814493, now seen corresponding path program 48 times [2018-10-14 16:29:26,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 29376 backedges. 0 proven. 29376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:29:30,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:30,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-14 16:29:30,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-14 16:29:30,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-14 16:29:30,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 16:29:30,930 INFO L87 Difference]: Start difference. First operand 1955 states and 2004 transitions. Second operand 99 states. [2018-10-14 16:29:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:37,042 INFO L93 Difference]: Finished difference Result 2048 states and 2099 transitions. [2018-10-14 16:29:37,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-14 16:29:37,043 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1272 [2018-10-14 16:29:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:37,046 INFO L225 Difference]: With dead ends: 2048 [2018-10-14 16:29:37,046 INFO L226 Difference]: Without dead ends: 2048 [2018-10-14 16:29:37,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-14 16:29:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2018-10-14 16:29:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1995. [2018-10-14 16:29:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2018-10-14 16:29:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2045 transitions. [2018-10-14 16:29:37,064 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2045 transitions. Word has length 1272 [2018-10-14 16:29:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:37,065 INFO L481 AbstractCegarLoop]: Abstraction has 1995 states and 2045 transitions. [2018-10-14 16:29:37,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-14 16:29:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2045 transitions. [2018-10-14 16:29:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1299 [2018-10-14 16:29:37,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:37,080 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 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-14 16:29:37,081 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:37,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:37,081 INFO L82 PathProgramCache]: Analyzing trace with hash 748578288, now seen corresponding path program 49 times [2018-10-14 16:29:37,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 30625 backedges. 0 proven. 30625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:29:41,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:41,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-14 16:29:41,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-14 16:29:41,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-14 16:29:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-14 16:29:41,309 INFO L87 Difference]: Start difference. First operand 1995 states and 2045 transitions. Second operand 101 states. [2018-10-14 16:29:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:47,282 INFO L93 Difference]: Finished difference Result 2088 states and 2140 transitions. [2018-10-14 16:29:47,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-14 16:29:47,283 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 1298 [2018-10-14 16:29:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:47,286 INFO L225 Difference]: With dead ends: 2088 [2018-10-14 16:29:47,286 INFO L226 Difference]: Without dead ends: 2088 [2018-10-14 16:29:47,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-14 16:29:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-10-14 16:29:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2035. [2018-10-14 16:29:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2018-10-14 16:29:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2086 transitions. [2018-10-14 16:29:47,304 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2086 transitions. Word has length 1298 [2018-10-14 16:29:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:47,305 INFO L481 AbstractCegarLoop]: Abstraction has 2035 states and 2086 transitions. [2018-10-14 16:29:47,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-14 16:29:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2086 transitions. [2018-10-14 16:29:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1325 [2018-10-14 16:29:47,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:47,316 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 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-14 16:29:47,316 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:47,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash 26823491, now seen corresponding path program 50 times [2018-10-14 16:29:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 31900 backedges. 0 proven. 31900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:29:51,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:51,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-14 16:29:51,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-14 16:29:51,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-14 16:29:51,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 16:29:51,683 INFO L87 Difference]: Start difference. First operand 2035 states and 2086 transitions. Second operand 103 states. [2018-10-14 16:29:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:58,443 INFO L93 Difference]: Finished difference Result 2128 states and 2181 transitions. [2018-10-14 16:29:58,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-14 16:29:58,443 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 1324 [2018-10-14 16:29:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:58,447 INFO L225 Difference]: With dead ends: 2128 [2018-10-14 16:29:58,447 INFO L226 Difference]: Without dead ends: 2128 [2018-10-14 16:29:58,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-14 16:29:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2018-10-14 16:29:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2075. [2018-10-14 16:29:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2018-10-14 16:29:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 2127 transitions. [2018-10-14 16:29:58,462 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 2127 transitions. Word has length 1324 [2018-10-14 16:29:58,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:58,463 INFO L481 AbstractCegarLoop]: Abstraction has 2075 states and 2127 transitions. [2018-10-14 16:29:58,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-14 16:29:58,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2127 transitions. [2018-10-14 16:29:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1351 [2018-10-14 16:29:58,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:58,475 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 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-14 16:29:58,475 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:58,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:58,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1264082646, now seen corresponding path program 51 times [2018-10-14 16:29:58,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 33201 backedges. 0 proven. 33201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:30:03,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:03,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-14 16:30:03,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-14 16:30:03,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-14 16:30:03,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-14 16:30:03,036 INFO L87 Difference]: Start difference. First operand 2075 states and 2127 transitions. Second operand 105 states. [2018-10-14 16:30:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:09,567 INFO L93 Difference]: Finished difference Result 2168 states and 2222 transitions. [2018-10-14 16:30:09,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-14 16:30:09,568 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 1350 [2018-10-14 16:30:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:09,570 INFO L225 Difference]: With dead ends: 2168 [2018-10-14 16:30:09,571 INFO L226 Difference]: Without dead ends: 2168 [2018-10-14 16:30:09,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-14 16:30:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-14 16:30:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2115. [2018-10-14 16:30:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-10-14 16:30:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2168 transitions. [2018-10-14 16:30:09,585 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2168 transitions. Word has length 1350 [2018-10-14 16:30:09,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:09,586 INFO L481 AbstractCegarLoop]: Abstraction has 2115 states and 2168 transitions. [2018-10-14 16:30:09,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-14 16:30:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2168 transitions. [2018-10-14 16:30:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1377 [2018-10-14 16:30:09,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:09,598 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 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-14 16:30:09,598 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:09,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1037938519, now seen corresponding path program 52 times [2018-10-14 16:30:09,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 34528 backedges. 0 proven. 34528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:30:14,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:14,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-14 16:30:14,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-14 16:30:14,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-14 16:30:14,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 16:30:14,231 INFO L87 Difference]: Start difference. First operand 2115 states and 2168 transitions. Second operand 107 states. [2018-10-14 16:30:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:21,281 INFO L93 Difference]: Finished difference Result 2208 states and 2263 transitions. [2018-10-14 16:30:21,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-14 16:30:21,281 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 1376 [2018-10-14 16:30:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:21,284 INFO L225 Difference]: With dead ends: 2208 [2018-10-14 16:30:21,284 INFO L226 Difference]: Without dead ends: 2208 [2018-10-14 16:30:21,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-14 16:30:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2018-10-14 16:30:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2155. [2018-10-14 16:30:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2155 states. [2018-10-14 16:30:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2209 transitions. [2018-10-14 16:30:21,298 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2209 transitions. Word has length 1376 [2018-10-14 16:30:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:21,298 INFO L481 AbstractCegarLoop]: Abstraction has 2155 states and 2209 transitions. [2018-10-14 16:30:21,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-14 16:30:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2209 transitions. [2018-10-14 16:30:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1403 [2018-10-14 16:30:21,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:21,311 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 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-14 16:30:21,311 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:21,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1849807036, now seen corresponding path program 53 times [2018-10-14 16:30:21,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 35881 backedges. 0 proven. 35881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:30:25,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:25,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-14 16:30:25,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-14 16:30:25,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-14 16:30:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-14 16:30:25,777 INFO L87 Difference]: Start difference. First operand 2155 states and 2209 transitions. Second operand 109 states. [2018-10-14 16:30:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:33,667 INFO L93 Difference]: Finished difference Result 2248 states and 2304 transitions. [2018-10-14 16:30:33,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-14 16:30:33,667 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 1402 [2018-10-14 16:30:33,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:33,670 INFO L225 Difference]: With dead ends: 2248 [2018-10-14 16:30:33,670 INFO L226 Difference]: Without dead ends: 2248 [2018-10-14 16:30:33,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-14 16:30:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2018-10-14 16:30:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2195. [2018-10-14 16:30:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2018-10-14 16:30:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 2250 transitions. [2018-10-14 16:30:33,686 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 2250 transitions. Word has length 1402 [2018-10-14 16:30:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:33,686 INFO L481 AbstractCegarLoop]: Abstraction has 2195 states and 2250 transitions. [2018-10-14 16:30:33,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-14 16:30:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2250 transitions. [2018-10-14 16:30:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2018-10-14 16:30:33,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:33,700 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 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-14 16:30:33,700 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:33,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash -351957233, now seen corresponding path program 54 times [2018-10-14 16:30:33,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 37260 backedges. 0 proven. 37260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:30:38,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:38,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-14 16:30:38,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-14 16:30:38,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-14 16:30:38,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-14 16:30:38,719 INFO L87 Difference]: Start difference. First operand 2195 states and 2250 transitions. Second operand 111 states. [2018-10-14 16:30:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:46,699 INFO L93 Difference]: Finished difference Result 2288 states and 2345 transitions. [2018-10-14 16:30:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-14 16:30:46,699 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 1428 [2018-10-14 16:30:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:46,702 INFO L225 Difference]: With dead ends: 2288 [2018-10-14 16:30:46,702 INFO L226 Difference]: Without dead ends: 2288 [2018-10-14 16:30:46,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-14 16:30:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2018-10-14 16:30:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2235. [2018-10-14 16:30:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2018-10-14 16:30:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2291 transitions. [2018-10-14 16:30:46,717 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2291 transitions. Word has length 1428 [2018-10-14 16:30:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:46,718 INFO L481 AbstractCegarLoop]: Abstraction has 2235 states and 2291 transitions. [2018-10-14 16:30:46,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-14 16:30:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2291 transitions. [2018-10-14 16:30:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1455 [2018-10-14 16:30:46,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:46,732 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 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-14 16:30:46,732 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:46,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash -373277790, now seen corresponding path program 55 times [2018-10-14 16:30:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 38665 backedges. 0 proven. 38665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:30:51,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:51,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-14 16:30:51,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-14 16:30:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-14 16:30:51,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-14 16:30:51,691 INFO L87 Difference]: Start difference. First operand 2235 states and 2291 transitions. Second operand 113 states. [2018-10-14 16:31:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:00,202 INFO L93 Difference]: Finished difference Result 2328 states and 2386 transitions. [2018-10-14 16:31:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-14 16:31:00,202 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 1454 [2018-10-14 16:31:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:00,206 INFO L225 Difference]: With dead ends: 2328 [2018-10-14 16:31:00,206 INFO L226 Difference]: Without dead ends: 2328 [2018-10-14 16:31:00,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-14 16:31:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2018-10-14 16:31:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2275. [2018-10-14 16:31:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2018-10-14 16:31:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 2332 transitions. [2018-10-14 16:31:00,222 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 2332 transitions. Word has length 1454 [2018-10-14 16:31:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:00,223 INFO L481 AbstractCegarLoop]: Abstraction has 2275 states and 2332 transitions. [2018-10-14 16:31:00,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-14 16:31:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2332 transitions. [2018-10-14 16:31:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1481 [2018-10-14 16:31:00,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:00,236 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 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-14 16:31:00,236 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:00,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:00,236 INFO L82 PathProgramCache]: Analyzing trace with hash -188184971, now seen corresponding path program 56 times [2018-10-14 16:31:00,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 40096 backedges. 0 proven. 40096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:31:05,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:05,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-14 16:31:05,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-14 16:31:05,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-14 16:31:05,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-14 16:31:05,593 INFO L87 Difference]: Start difference. First operand 2275 states and 2332 transitions. Second operand 115 states. [2018-10-14 16:31:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:13,677 INFO L93 Difference]: Finished difference Result 2368 states and 2427 transitions. [2018-10-14 16:31:13,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-14 16:31:13,678 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 1480 [2018-10-14 16:31:13,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:13,682 INFO L225 Difference]: With dead ends: 2368 [2018-10-14 16:31:13,682 INFO L226 Difference]: Without dead ends: 2368 [2018-10-14 16:31:13,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-14 16:31:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2018-10-14 16:31:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2315. [2018-10-14 16:31:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2018-10-14 16:31:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2373 transitions. [2018-10-14 16:31:13,699 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2373 transitions. Word has length 1480 [2018-10-14 16:31:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:13,699 INFO L481 AbstractCegarLoop]: Abstraction has 2315 states and 2373 transitions. [2018-10-14 16:31:13,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-14 16:31:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2373 transitions. [2018-10-14 16:31:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1507 [2018-10-14 16:31:13,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:13,714 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 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-14 16:31:13,714 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:13,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:13,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1920540552, now seen corresponding path program 57 times [2018-10-14 16:31:13,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 41553 backedges. 0 proven. 41553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:31:19,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:19,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-14 16:31:19,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-14 16:31:19,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-14 16:31:19,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-14 16:31:19,377 INFO L87 Difference]: Start difference. First operand 2315 states and 2373 transitions. Second operand 117 states. [2018-10-14 16:31:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:27,957 INFO L93 Difference]: Finished difference Result 2408 states and 2468 transitions. [2018-10-14 16:31:27,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-14 16:31:27,958 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 1506 [2018-10-14 16:31:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:27,960 INFO L225 Difference]: With dead ends: 2408 [2018-10-14 16:31:27,961 INFO L226 Difference]: Without dead ends: 2408 [2018-10-14 16:31:27,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-14 16:31:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2018-10-14 16:31:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2355. [2018-10-14 16:31:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2018-10-14 16:31:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 2414 transitions. [2018-10-14 16:31:27,974 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 2414 transitions. Word has length 1506 [2018-10-14 16:31:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:27,974 INFO L481 AbstractCegarLoop]: Abstraction has 2355 states and 2414 transitions. [2018-10-14 16:31:27,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-14 16:31:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2414 transitions. [2018-10-14 16:31:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2018-10-14 16:31:27,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:27,989 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 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-14 16:31:27,989 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:27,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:27,989 INFO L82 PathProgramCache]: Analyzing trace with hash -399460645, now seen corresponding path program 58 times [2018-10-14 16:31:27,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 43036 backedges. 0 proven. 43036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:31:33,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:33,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-14 16:31:33,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-14 16:31:33,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-14 16:31:33,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-14 16:31:33,413 INFO L87 Difference]: Start difference. First operand 2355 states and 2414 transitions. Second operand 119 states. [2018-10-14 16:31:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:41,914 INFO L93 Difference]: Finished difference Result 2448 states and 2509 transitions. [2018-10-14 16:31:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-14 16:31:41,915 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 1532 [2018-10-14 16:31:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:41,918 INFO L225 Difference]: With dead ends: 2448 [2018-10-14 16:31:41,918 INFO L226 Difference]: Without dead ends: 2448 [2018-10-14 16:31:41,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-14 16:31:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2018-10-14 16:31:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2395. [2018-10-14 16:31:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2018-10-14 16:31:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 2455 transitions. [2018-10-14 16:31:41,935 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 2455 transitions. Word has length 1532 [2018-10-14 16:31:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:41,936 INFO L481 AbstractCegarLoop]: Abstraction has 2395 states and 2455 transitions. [2018-10-14 16:31:41,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-14 16:31:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2455 transitions. [2018-10-14 16:31:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1559 [2018-10-14 16:31:41,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:41,949 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 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-14 16:31:41,950 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:41,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2102525038, now seen corresponding path program 59 times [2018-10-14 16:31:41,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 44545 backedges. 0 proven. 44545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:31:48,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:48,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-14 16:31:48,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-14 16:31:48,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-14 16:31:48,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-14 16:31:48,036 INFO L87 Difference]: Start difference. First operand 2395 states and 2455 transitions. Second operand 121 states. [2018-10-14 16:31:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:57,029 INFO L93 Difference]: Finished difference Result 2488 states and 2550 transitions. [2018-10-14 16:31:57,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-14 16:31:57,029 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 1558 [2018-10-14 16:31:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:57,032 INFO L225 Difference]: With dead ends: 2488 [2018-10-14 16:31:57,032 INFO L226 Difference]: Without dead ends: 2488 [2018-10-14 16:31:57,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-14 16:31:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2018-10-14 16:31:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2435. [2018-10-14 16:31:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-14 16:31:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 2496 transitions. [2018-10-14 16:31:57,046 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 2496 transitions. Word has length 1558 [2018-10-14 16:31:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:57,046 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 2496 transitions. [2018-10-14 16:31:57,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-14 16:31:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 2496 transitions. [2018-10-14 16:31:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1585 [2018-10-14 16:31:57,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:57,062 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 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-14 16:31:57,063 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:57,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1102864319, now seen corresponding path program 60 times [2018-10-14 16:31:57,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 46080 backedges. 0 proven. 46080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:32:02,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:02,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-14 16:32:02,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-14 16:32:02,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-14 16:32:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-14 16:32:02,938 INFO L87 Difference]: Start difference. First operand 2435 states and 2496 transitions. Second operand 123 states. [2018-10-14 16:32:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:12,431 INFO L93 Difference]: Finished difference Result 2528 states and 2591 transitions. [2018-10-14 16:32:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-14 16:32:12,432 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 1584 [2018-10-14 16:32:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:12,436 INFO L225 Difference]: With dead ends: 2528 [2018-10-14 16:32:12,436 INFO L226 Difference]: Without dead ends: 2528 [2018-10-14 16:32:12,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-14 16:32:12,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2018-10-14 16:32:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2475. [2018-10-14 16:32:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-10-14 16:32:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2537 transitions. [2018-10-14 16:32:12,452 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2537 transitions. Word has length 1584 [2018-10-14 16:32:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:12,453 INFO L481 AbstractCegarLoop]: Abstraction has 2475 states and 2537 transitions. [2018-10-14 16:32:12,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-14 16:32:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2537 transitions. [2018-10-14 16:32:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1611 [2018-10-14 16:32:12,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:12,469 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 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-14 16:32:12,469 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:12,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:12,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1620028844, now seen corresponding path program 61 times [2018-10-14 16:32:12,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 47641 backedges. 0 proven. 47641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:32:18,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:18,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-14 16:32:18,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-14 16:32:18,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-14 16:32:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-14 16:32:18,657 INFO L87 Difference]: Start difference. First operand 2475 states and 2537 transitions. Second operand 125 states. [2018-10-14 16:32:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:28,110 INFO L93 Difference]: Finished difference Result 2568 states and 2632 transitions. [2018-10-14 16:32:28,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-14 16:32:28,110 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 1610 [2018-10-14 16:32:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:28,113 INFO L225 Difference]: With dead ends: 2568 [2018-10-14 16:32:28,114 INFO L226 Difference]: Without dead ends: 2568 [2018-10-14 16:32:28,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-14 16:32:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2018-10-14 16:32:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2515. [2018-10-14 16:32:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2515 states. [2018-10-14 16:32:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 2578 transitions. [2018-10-14 16:32:28,130 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 2578 transitions. Word has length 1610 [2018-10-14 16:32:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:28,131 INFO L481 AbstractCegarLoop]: Abstraction has 2515 states and 2578 transitions. [2018-10-14 16:32:28,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-14 16:32:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 2578 transitions. [2018-10-14 16:32:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1637 [2018-10-14 16:32:28,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:28,147 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 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-14 16:32:28,148 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:28,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:28,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1069104473, now seen corresponding path program 62 times [2018-10-14 16:32:28,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 49228 backedges. 0 proven. 49228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:32:34,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:34,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-14 16:32:34,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-14 16:32:34,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-14 16:32:34,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-14 16:32:34,635 INFO L87 Difference]: Start difference. First operand 2515 states and 2578 transitions. Second operand 127 states. [2018-10-14 16:32:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:45,626 INFO L93 Difference]: Finished difference Result 2608 states and 2673 transitions. [2018-10-14 16:32:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-14 16:32:45,627 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 1636 [2018-10-14 16:32:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:45,630 INFO L225 Difference]: With dead ends: 2608 [2018-10-14 16:32:45,630 INFO L226 Difference]: Without dead ends: 2608 [2018-10-14 16:32:45,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-14 16:32:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2018-10-14 16:32:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2555. [2018-10-14 16:32:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2018-10-14 16:32:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 2619 transitions. [2018-10-14 16:32:45,644 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 2619 transitions. Word has length 1636 [2018-10-14 16:32:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:45,645 INFO L481 AbstractCegarLoop]: Abstraction has 2555 states and 2619 transitions. [2018-10-14 16:32:45,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-14 16:32:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 2619 transitions. [2018-10-14 16:32:45,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1663 [2018-10-14 16:32:45,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:45,661 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 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-14 16:32:45,661 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:45,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash -298213062, now seen corresponding path program 63 times [2018-10-14 16:32:45,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 50841 backedges. 0 proven. 50841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:32:52,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:52,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-14 16:32:52,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-14 16:32:52,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-14 16:32:52,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-14 16:32:52,340 INFO L87 Difference]: Start difference. First operand 2555 states and 2619 transitions. Second operand 129 states. [2018-10-14 16:33:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:02,670 INFO L93 Difference]: Finished difference Result 2648 states and 2714 transitions. [2018-10-14 16:33:02,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-14 16:33:02,670 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 1662 [2018-10-14 16:33:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:02,674 INFO L225 Difference]: With dead ends: 2648 [2018-10-14 16:33:02,674 INFO L226 Difference]: Without dead ends: 2648 [2018-10-14 16:33:02,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-14 16:33:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-10-14 16:33:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2595. [2018-10-14 16:33:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2018-10-14 16:33:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 2660 transitions. [2018-10-14 16:33:02,693 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 2660 transitions. Word has length 1662 [2018-10-14 16:33:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:02,694 INFO L481 AbstractCegarLoop]: Abstraction has 2595 states and 2660 transitions. [2018-10-14 16:33:02,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-14 16:33:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 2660 transitions. [2018-10-14 16:33:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1689 [2018-10-14 16:33:02,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:02,710 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 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-14 16:33:02,710 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:02,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash -406872563, now seen corresponding path program 64 times [2018-10-14 16:33:02,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 52480 backedges. 0 proven. 52480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:33:09,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:09,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-14 16:33:09,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-14 16:33:09,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-14 16:33:09,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-14 16:33:09,677 INFO L87 Difference]: Start difference. First operand 2595 states and 2660 transitions. Second operand 131 states. [2018-10-14 16:33:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:20,788 INFO L93 Difference]: Finished difference Result 2688 states and 2755 transitions. [2018-10-14 16:33:20,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-14 16:33:20,789 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 1688 [2018-10-14 16:33:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:20,793 INFO L225 Difference]: With dead ends: 2688 [2018-10-14 16:33:20,793 INFO L226 Difference]: Without dead ends: 2688 [2018-10-14 16:33:20,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-14 16:33:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2018-10-14 16:33:20,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2635. [2018-10-14 16:33:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2018-10-14 16:33:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 2701 transitions. [2018-10-14 16:33:20,813 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 2701 transitions. Word has length 1688 [2018-10-14 16:33:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:20,815 INFO L481 AbstractCegarLoop]: Abstraction has 2635 states and 2701 transitions. [2018-10-14 16:33:20,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-14 16:33:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 2701 transitions. [2018-10-14 16:33:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1715 [2018-10-14 16:33:20,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:20,834 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 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-14 16:33:20,834 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:20,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:20,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1599301920, now seen corresponding path program 65 times [2018-10-14 16:33:20,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 54145 backedges. 0 proven. 54145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:33:28,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:28,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-14 16:33:28,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-14 16:33:28,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-14 16:33:28,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-14 16:33:28,215 INFO L87 Difference]: Start difference. First operand 2635 states and 2701 transitions. Second operand 133 states. [2018-10-14 16:33:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:39,736 INFO L93 Difference]: Finished difference Result 2728 states and 2796 transitions. [2018-10-14 16:33:39,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-14 16:33:39,736 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 1714 [2018-10-14 16:33:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:39,740 INFO L225 Difference]: With dead ends: 2728 [2018-10-14 16:33:39,741 INFO L226 Difference]: Without dead ends: 2728 [2018-10-14 16:33:39,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-14 16:33:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2018-10-14 16:33:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2675. [2018-10-14 16:33:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2018-10-14 16:33:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 2742 transitions. [2018-10-14 16:33:39,759 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 2742 transitions. Word has length 1714 [2018-10-14 16:33:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:39,760 INFO L481 AbstractCegarLoop]: Abstraction has 2675 states and 2742 transitions. [2018-10-14 16:33:39,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-14 16:33:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 2742 transitions. [2018-10-14 16:33:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2018-10-14 16:33:39,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:39,777 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 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-14 16:33:39,777 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:39,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:39,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1047769715, now seen corresponding path program 66 times [2018-10-14 16:33:39,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 55836 backedges. 0 proven. 55836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:33:47,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:47,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-14 16:33:47,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-14 16:33:47,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-14 16:33:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-14 16:33:47,084 INFO L87 Difference]: Start difference. First operand 2675 states and 2742 transitions. Second operand 135 states. [2018-10-14 16:33:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:59,581 INFO L93 Difference]: Finished difference Result 2768 states and 2837 transitions. [2018-10-14 16:33:59,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-14 16:33:59,582 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 1740 [2018-10-14 16:33:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:59,585 INFO L225 Difference]: With dead ends: 2768 [2018-10-14 16:33:59,585 INFO L226 Difference]: Without dead ends: 2768 [2018-10-14 16:33:59,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-14 16:33:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2018-10-14 16:33:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 2715. [2018-10-14 16:33:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2715 states. [2018-10-14 16:33:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 2783 transitions. [2018-10-14 16:33:59,604 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 2783 transitions. Word has length 1740 [2018-10-14 16:33:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:59,605 INFO L481 AbstractCegarLoop]: Abstraction has 2715 states and 2783 transitions. [2018-10-14 16:33:59,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-14 16:33:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 2783 transitions. [2018-10-14 16:33:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2018-10-14 16:33:59,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:59,630 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 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-14 16:33:59,630 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:59,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:59,631 INFO L82 PathProgramCache]: Analyzing trace with hash 681781766, now seen corresponding path program 67 times [2018-10-14 16:33:59,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 57553 backedges. 0 proven. 57553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:34:07,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:07,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-14 16:34:07,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-14 16:34:07,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-14 16:34:07,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-14 16:34:07,164 INFO L87 Difference]: Start difference. First operand 2715 states and 2783 transitions. Second operand 137 states. [2018-10-14 16:34:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:20,113 INFO L93 Difference]: Finished difference Result 2808 states and 2878 transitions. [2018-10-14 16:34:20,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-14 16:34:20,113 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 1766 [2018-10-14 16:34:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:20,116 INFO L225 Difference]: With dead ends: 2808 [2018-10-14 16:34:20,117 INFO L226 Difference]: Without dead ends: 2808 [2018-10-14 16:34:20,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-14 16:34:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2018-10-14 16:34:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2755. [2018-10-14 16:34:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2018-10-14 16:34:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 2824 transitions. [2018-10-14 16:34:20,132 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 2824 transitions. Word has length 1766 [2018-10-14 16:34:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:20,132 INFO L481 AbstractCegarLoop]: Abstraction has 2755 states and 2824 transitions. [2018-10-14 16:34:20,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-14 16:34:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 2824 transitions. [2018-10-14 16:34:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1793 [2018-10-14 16:34:20,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:20,151 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 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-14 16:34:20,152 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:20,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:20,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1047035865, now seen corresponding path program 68 times [2018-10-14 16:34:20,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 59296 backedges. 0 proven. 59296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:34:27,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:27,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-14 16:34:27,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-14 16:34:27,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-14 16:34:27,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-14 16:34:27,989 INFO L87 Difference]: Start difference. First operand 2755 states and 2824 transitions. Second operand 139 states.