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/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:25:12,419 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:25:12,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:25:12,437 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:25:12,438 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:25:12,439 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:25:12,440 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:25:12,442 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:25:12,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:25:12,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:25:12,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:25:12,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:25:12,447 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:25:12,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:25:12,449 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:25:12,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:25:12,451 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:25:12,453 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:25:12,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:25:12,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:25:12,458 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:25:12,459 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:25:12,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:25:12,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:25:12,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:25:12,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:25:12,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:25:12,465 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:25:12,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:25:12,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:25:12,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:25:12,468 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:25:12,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:25:12,469 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:25:12,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:25:12,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:25:12,471 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:25:12,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:25:12,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:25:12,482 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:25:12,482 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:25:12,482 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:25:12,482 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:25:12,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:25:12,483 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:25:12,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:25:12,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:25:12,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:25:12,484 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:25:12,484 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:25:12,485 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:25:12,485 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:25:12,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:25:12,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:25:12,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:25:12,554 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:25:12,555 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:25:12,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl [2018-10-14 16:25:12,556 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl' [2018-10-14 16:25:12,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:25:12,643 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:25:12,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:25:12,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:25:12,644 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:25:12,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:12" (1/1) ... [2018-10-14 16:25:12,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:12" (1/1) ... [2018-10-14 16:25:12,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:12" (1/1) ... [2018-10-14 16:25:12,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:12" (1/1) ... [2018-10-14 16:25:12,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:12" (1/1) ... [2018-10-14 16:25:12,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:12" (1/1) ... [2018-10-14 16:25:12,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:12" (1/1) ... [2018-10-14 16:25:12,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:25:12,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:25:12,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:25:12,705 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:25:12,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:12" (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:25:12,765 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:25:12,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:25:12,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:25:13,270 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:25:13,271 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:25:13 BoogieIcfgContainer [2018-10-14 16:25:13,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:25:13,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:25:13,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:25:13,277 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:25:13,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:12" (1/2) ... [2018-10-14 16:25:13,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af1cdbc and model type ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:25:13, skipping insertion in model container [2018-10-14 16:25:13,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:25:13" (2/2) ... [2018-10-14 16:25:13,280 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl [2018-10-14 16:25:13,290 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:25:13,299 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:25:13,316 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:25:13,352 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:25:13,353 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:25:13,353 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:25:13,353 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:25:13,354 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:25:13,354 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:25:13,355 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:25:13,355 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:25:13,355 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:25:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-10-14 16:25:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-14 16:25:13,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:13,402 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] [2018-10-14 16:25:13,403 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:13,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash 631576572, now seen corresponding path program 1 times [2018-10-14 16:25:13,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:13,707 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:25:13,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:25:13,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-14 16:25:13,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 16:25:13,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 16:25:13,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:25:13,734 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 6 states. [2018-10-14 16:25:14,108 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-14 16:25:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:14,240 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-10-14 16:25:14,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 16:25:14,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-10-14 16:25:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:14,258 INFO L225 Difference]: With dead ends: 102 [2018-10-14 16:25:14,258 INFO L226 Difference]: Without dead ends: 102 [2018-10-14 16:25:14,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:25:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-14 16:25:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2018-10-14 16:25:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-14 16:25:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-10-14 16:25:14,303 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 42 [2018-10-14 16:25:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:14,304 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-10-14 16:25:14,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 16:25:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-10-14 16:25:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-14 16:25:14,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:14,311 INFO L375 BasicCegarLoop]: trace histogram [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, 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:25:14,311 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:14,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:14,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1779054223, now seen corresponding path program 1 times [2018-10-14 16:25:14,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:25:14,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:14,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:25:14,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:25:14,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:25:14,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:25:14,652 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 9 states. [2018-10-14 16:25:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:15,803 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2018-10-14 16:25:15,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 16:25:15,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-10-14 16:25:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:15,810 INFO L225 Difference]: With dead ends: 210 [2018-10-14 16:25:15,810 INFO L226 Difference]: Without dead ends: 210 [2018-10-14 16:25:15,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:25:15,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-14 16:25:15,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 84. [2018-10-14 16:25:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 16:25:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-10-14 16:25:15,831 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 68 [2018-10-14 16:25:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:15,834 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-10-14 16:25:15,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:25:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-10-14 16:25:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-14 16:25:15,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:15,838 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:15,839 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:15,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:15,839 INFO L82 PathProgramCache]: Analyzing trace with hash 681413385, now seen corresponding path program 1 times [2018-10-14 16:25:15,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:25:16,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:16,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:25:16,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:25:16,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:25:16,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:25:16,133 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 10 states. [2018-10-14 16:25:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:16,762 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-10-14 16:25:16,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:25:16,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-10-14 16:25:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:16,765 INFO L225 Difference]: With dead ends: 165 [2018-10-14 16:25:16,765 INFO L226 Difference]: Without dead ends: 165 [2018-10-14 16:25:16,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:25:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-14 16:25:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2018-10-14 16:25:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-14 16:25:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-10-14 16:25:16,780 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 83 [2018-10-14 16:25:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:16,781 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-10-14 16:25:16,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:25:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-10-14 16:25:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-14 16:25:16,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:16,785 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:25:16,785 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:16,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1966058966, now seen corresponding path program 2 times [2018-10-14 16:25:16,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 39 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-14 16:25:16,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:16,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:25:16,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:25:16,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:25:16,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:25:16,931 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 8 states. [2018-10-14 16:25:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:17,122 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-10-14 16:25:17,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:25:17,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-10-14 16:25:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:17,124 INFO L225 Difference]: With dead ends: 145 [2018-10-14 16:25:17,124 INFO L226 Difference]: Without dead ends: 145 [2018-10-14 16:25:17,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:25:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-14 16:25:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2018-10-14 16:25:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-14 16:25:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-10-14 16:25:17,134 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 109 [2018-10-14 16:25:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:17,135 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-10-14 16:25:17,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:25:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-10-14 16:25:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-14 16:25:17,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:17,137 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:17,138 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:17,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:17,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1280955748, now seen corresponding path program 3 times [2018-10-14 16:25:17,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-14 16:25:17,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:17,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 16:25:17,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 16:25:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 16:25:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-14 16:25:17,287 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 5 states. [2018-10-14 16:25:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:17,398 INFO L93 Difference]: Finished difference Result 192 states and 195 transitions. [2018-10-14 16:25:17,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 16:25:17,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2018-10-14 16:25:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:17,400 INFO L225 Difference]: With dead ends: 192 [2018-10-14 16:25:17,401 INFO L226 Difference]: Without dead ends: 192 [2018-10-14 16:25:17,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:25:17,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-14 16:25:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 140. [2018-10-14 16:25:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-14 16:25:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2018-10-14 16:25:17,411 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 124 [2018-10-14 16:25:17,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:17,412 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2018-10-14 16:25:17,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 16:25:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-10-14 16:25:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-14 16:25:17,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:17,415 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:17,415 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:17,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:17,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1853662372, now seen corresponding path program 4 times [2018-10-14 16:25:17,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 5 proven. 99 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:25:17,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:17,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 16:25:17,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 16:25:17,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 16:25:17,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:25:17,825 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 14 states. [2018-10-14 16:25:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:19,026 INFO L93 Difference]: Finished difference Result 236 states and 241 transitions. [2018-10-14 16:25:19,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 16:25:19,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 139 [2018-10-14 16:25:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:19,031 INFO L225 Difference]: With dead ends: 236 [2018-10-14 16:25:19,031 INFO L226 Difference]: Without dead ends: 236 [2018-10-14 16:25:19,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:25:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-14 16:25:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 196. [2018-10-14 16:25:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-14 16:25:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 201 transitions. [2018-10-14 16:25:19,042 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 201 transitions. Word has length 139 [2018-10-14 16:25:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:19,043 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 201 transitions. [2018-10-14 16:25:19,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 16:25:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 201 transitions. [2018-10-14 16:25:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-14 16:25:19,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:19,046 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:19,047 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:19,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash -981238097, now seen corresponding path program 5 times [2018-10-14 16:25:19,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 46 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-14 16:25:19,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:19,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:25:19,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:25:19,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:25:19,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:25:19,317 INFO L87 Difference]: Start difference. First operand 196 states and 201 transitions. Second operand 10 states. [2018-10-14 16:25:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:19,991 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-10-14 16:25:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:25:19,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2018-10-14 16:25:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:19,995 INFO L225 Difference]: With dead ends: 196 [2018-10-14 16:25:19,996 INFO L226 Difference]: Without dead ends: 196 [2018-10-14 16:25:19,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:25:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-14 16:25:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-14 16:25:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-14 16:25:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2018-10-14 16:25:20,005 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 199 transitions. Word has length 165 [2018-10-14 16:25:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:20,005 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 199 transitions. [2018-10-14 16:25:20,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:25:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 199 transitions. [2018-10-14 16:25:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-14 16:25:20,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:20,009 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:20,009 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:20,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash -366729745, now seen corresponding path program 6 times [2018-10-14 16:25:20,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 137 proven. 64 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-14 16:25:20,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:20,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:25:20,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:25:20,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:25:20,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:25:20,305 INFO L87 Difference]: Start difference. First operand 196 states and 199 transitions. Second operand 12 states. [2018-10-14 16:25:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:20,694 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2018-10-14 16:25:20,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 16:25:20,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2018-10-14 16:25:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:20,696 INFO L225 Difference]: With dead ends: 196 [2018-10-14 16:25:20,696 INFO L226 Difference]: Without dead ends: 196 [2018-10-14 16:25:20,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:25:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-14 16:25:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-14 16:25:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-14 16:25:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-10-14 16:25:20,702 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 180 [2018-10-14 16:25:20,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:20,702 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-10-14 16:25:20,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:25:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-10-14 16:25:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-14 16:25:20,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:20,705 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:20,706 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:20,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:20,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2109216431, now seen corresponding path program 7 times [2018-10-14 16:25:20,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 105 proven. 19 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-14 16:25:20,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:20,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 16:25:20,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:25:20,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:25:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:25:20,914 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 7 states. [2018-10-14 16:25:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:21,078 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-10-14 16:25:21,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:25:21,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2018-10-14 16:25:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:21,081 INFO L225 Difference]: With dead ends: 243 [2018-10-14 16:25:21,081 INFO L226 Difference]: Without dead ends: 243 [2018-10-14 16:25:21,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:25:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-14 16:25:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 211. [2018-10-14 16:25:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-14 16:25:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 213 transitions. [2018-10-14 16:25:21,087 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 213 transitions. Word has length 195 [2018-10-14 16:25:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:21,088 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 213 transitions. [2018-10-14 16:25:21,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:25:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 213 transitions. [2018-10-14 16:25:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-14 16:25:21,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:21,091 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:21,091 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:21,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2041538281, now seen corresponding path program 8 times [2018-10-14 16:25:21,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-14 16:25:22,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:22,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:25:22,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:25:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:25:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:25:22,168 INFO L87 Difference]: Start difference. First operand 211 states and 213 transitions. Second operand 15 states. [2018-10-14 16:25:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:23,197 INFO L93 Difference]: Finished difference Result 303 states and 307 transitions. [2018-10-14 16:25:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 16:25:23,197 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 210 [2018-10-14 16:25:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:23,200 INFO L225 Difference]: With dead ends: 303 [2018-10-14 16:25:23,200 INFO L226 Difference]: Without dead ends: 303 [2018-10-14 16:25:23,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=535, Invalid=1915, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:25:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-14 16:25:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 267. [2018-10-14 16:25:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-14 16:25:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2018-10-14 16:25:23,207 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 210 [2018-10-14 16:25:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:23,207 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2018-10-14 16:25:23,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:25:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2018-10-14 16:25:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-14 16:25:23,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:23,211 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:23,211 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:23,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1689063370, now seen corresponding path program 9 times [2018-10-14 16:25:23,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 403 proven. 196 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-14 16:25:23,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:23,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:25:23,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:25:23,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:25:23,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:25:23,551 INFO L87 Difference]: Start difference. First operand 267 states and 270 transitions. Second operand 16 states. [2018-10-14 16:25:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:24,534 INFO L93 Difference]: Finished difference Result 282 states and 284 transitions. [2018-10-14 16:25:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 16:25:24,534 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 266 [2018-10-14 16:25:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:24,536 INFO L225 Difference]: With dead ends: 282 [2018-10-14 16:25:24,536 INFO L226 Difference]: Without dead ends: 282 [2018-10-14 16:25:24,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:25:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-14 16:25:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-10-14 16:25:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-14 16:25:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 284 transitions. [2018-10-14 16:25:24,543 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 284 transitions. Word has length 266 [2018-10-14 16:25:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:24,543 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 284 transitions. [2018-10-14 16:25:24,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:25:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 284 transitions. [2018-10-14 16:25:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-14 16:25:24,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:24,546 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:24,547 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:24,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:24,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1594975556, now seen corresponding path program 10 times [2018-10-14 16:25:24,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 298 proven. 51 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-10-14 16:25:25,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:25,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:25:25,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:25:25,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:25:25,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:25:25,283 INFO L87 Difference]: Start difference. First operand 282 states and 284 transitions. Second operand 9 states. [2018-10-14 16:25:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:25,691 INFO L93 Difference]: Finished difference Result 357 states and 361 transitions. [2018-10-14 16:25:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:25:25,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2018-10-14 16:25:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:25,694 INFO L225 Difference]: With dead ends: 357 [2018-10-14 16:25:25,694 INFO L226 Difference]: Without dead ends: 357 [2018-10-14 16:25:25,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:25:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-14 16:25:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 297. [2018-10-14 16:25:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-14 16:25:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 300 transitions. [2018-10-14 16:25:25,701 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 300 transitions. Word has length 281 [2018-10-14 16:25:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:25,702 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 300 transitions. [2018-10-14 16:25:25,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:25:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 300 transitions. [2018-10-14 16:25:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-14 16:25:25,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:25,704 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:25,704 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:25,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:25,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1854449468, now seen corresponding path program 11 times [2018-10-14 16:25:25,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 0 proven. 821 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-14 16:25:26,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:26,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 16:25:26,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 16:25:26,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 16:25:26,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-10-14 16:25:26,021 INFO L87 Difference]: Start difference. First operand 297 states and 300 transitions. Second operand 17 states. [2018-10-14 16:25:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:27,155 INFO L93 Difference]: Finished difference Result 404 states and 409 transitions. [2018-10-14 16:25:27,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 16:25:27,155 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 296 [2018-10-14 16:25:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:27,158 INFO L225 Difference]: With dead ends: 404 [2018-10-14 16:25:27,159 INFO L226 Difference]: Without dead ends: 404 [2018-10-14 16:25:27,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=809, Invalid=2973, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 16:25:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-14 16:25:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 368. [2018-10-14 16:25:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-14 16:25:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 372 transitions. [2018-10-14 16:25:27,169 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 372 transitions. Word has length 296 [2018-10-14 16:25:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:27,169 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 372 transitions. [2018-10-14 16:25:27,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 16:25:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 372 transitions. [2018-10-14 16:25:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-14 16:25:27,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:27,173 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:27,173 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:27,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:27,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1773481265, now seen corresponding path program 12 times [2018-10-14 16:25:27,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 0 proven. 1414 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-14 16:25:27,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:27,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 16:25:27,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 16:25:27,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 16:25:27,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:25:27,667 INFO L87 Difference]: Start difference. First operand 368 states and 372 transitions. Second operand 19 states. [2018-10-14 16:25:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:29,446 INFO L93 Difference]: Finished difference Result 475 states and 481 transitions. [2018-10-14 16:25:29,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 16:25:29,447 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 367 [2018-10-14 16:25:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:29,449 INFO L225 Difference]: With dead ends: 475 [2018-10-14 16:25:29,449 INFO L226 Difference]: Without dead ends: 475 [2018-10-14 16:25:29,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1772 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1137, Invalid=4265, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 16:25:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-10-14 16:25:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 439. [2018-10-14 16:25:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-14 16:25:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 444 transitions. [2018-10-14 16:25:29,459 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 444 transitions. Word has length 367 [2018-10-14 16:25:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:29,459 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 444 transitions. [2018-10-14 16:25:29,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 16:25:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 444 transitions. [2018-10-14 16:25:29,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-14 16:25:29,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:29,463 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:29,463 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:29,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:29,463 INFO L82 PathProgramCache]: Analyzing trace with hash -40885284, now seen corresponding path program 13 times [2018-10-14 16:25:29,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2384 backedges. 1504 proven. 452 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2018-10-14 16:25:31,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:31,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 16:25:31,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 16:25:31,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 16:25:31,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:25:31,194 INFO L87 Difference]: Start difference. First operand 439 states and 444 transitions. Second operand 20 states. [2018-10-14 16:25:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:32,269 INFO L93 Difference]: Finished difference Result 469 states and 473 transitions. [2018-10-14 16:25:32,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 16:25:32,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 438 [2018-10-14 16:25:32,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:32,272 INFO L225 Difference]: With dead ends: 469 [2018-10-14 16:25:32,272 INFO L226 Difference]: Without dead ends: 469 [2018-10-14 16:25:32,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=375, Invalid=1517, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:25:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-10-14 16:25:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2018-10-14 16:25:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-14 16:25:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 473 transitions. [2018-10-14 16:25:32,281 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 473 transitions. Word has length 438 [2018-10-14 16:25:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:32,282 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 473 transitions. [2018-10-14 16:25:32,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 16:25:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 473 transitions. [2018-10-14 16:25:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-10-14 16:25:32,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:32,285 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:32,285 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:32,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash -448487646, now seen corresponding path program 14 times [2018-10-14 16:25:32,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2895 backedges. 0 proven. 2593 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-10-14 16:25:33,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:33,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 16:25:33,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 16:25:33,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 16:25:33,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-10-14 16:25:33,619 INFO L87 Difference]: Start difference. First operand 469 states and 473 transitions. Second operand 21 states. [2018-10-14 16:25:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:36,070 INFO L93 Difference]: Finished difference Result 576 states and 581 transitions. [2018-10-14 16:25:36,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 16:25:36,071 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 468 [2018-10-14 16:25:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:36,075 INFO L225 Difference]: With dead ends: 576 [2018-10-14 16:25:36,075 INFO L226 Difference]: Without dead ends: 576 [2018-10-14 16:25:36,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2499 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1519, Invalid=5791, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 16:25:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-10-14 16:25:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 555. [2018-10-14 16:25:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-14 16:25:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 560 transitions. [2018-10-14 16:25:36,087 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 560 transitions. Word has length 468 [2018-10-14 16:25:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:36,088 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 560 transitions. [2018-10-14 16:25:36,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 16:25:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 560 transitions. [2018-10-14 16:25:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2018-10-14 16:25:36,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:36,092 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:36,092 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:36,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash -868829515, now seen corresponding path program 15 times [2018-10-14 16:25:36,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4286 backedges. 0 proven. 3890 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-10-14 16:25:41,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:41,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 16:25:41,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 16:25:41,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 16:25:41,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:25:41,143 INFO L87 Difference]: Start difference. First operand 555 states and 560 transitions. Second operand 23 states. [2018-10-14 16:25:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:43,951 INFO L93 Difference]: Finished difference Result 662 states and 668 transitions. [2018-10-14 16:25:43,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-14 16:25:43,951 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 554 [2018-10-14 16:25:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:43,956 INFO L225 Difference]: With dead ends: 662 [2018-10-14 16:25:43,956 INFO L226 Difference]: Without dead ends: 662 [2018-10-14 16:25:43,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3351 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1955, Invalid=7551, Unknown=0, NotChecked=0, Total=9506 [2018-10-14 16:25:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-10-14 16:25:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 641. [2018-10-14 16:25:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-10-14 16:25:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 647 transitions. [2018-10-14 16:25:43,968 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 647 transitions. Word has length 554 [2018-10-14 16:25:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:43,969 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 647 transitions. [2018-10-14 16:25:43,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 16:25:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 647 transitions. [2018-10-14 16:25:43,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-10-14 16:25:43,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:43,974 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:43,975 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:43,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:43,975 INFO L82 PathProgramCache]: Analyzing trace with hash 465860104, now seen corresponding path program 16 times [2018-10-14 16:25:43,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5951 backedges. 43 proven. 5415 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2018-10-14 16:25:45,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:45,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 16:25:45,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 16:25:45,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 16:25:45,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:25:45,075 INFO L87 Difference]: Start difference. First operand 641 states and 647 transitions. Second operand 25 states. [2018-10-14 16:25:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:47,545 INFO L93 Difference]: Finished difference Result 748 states and 755 transitions. [2018-10-14 16:25:47,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-14 16:25:47,545 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 640 [2018-10-14 16:25:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:47,550 INFO L225 Difference]: With dead ends: 748 [2018-10-14 16:25:47,550 INFO L226 Difference]: Without dead ends: 748 [2018-10-14 16:25:47,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4123 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2543, Invalid=8799, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 16:25:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-14 16:25:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 727. [2018-10-14 16:25:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-10-14 16:25:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 734 transitions. [2018-10-14 16:25:47,564 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 734 transitions. Word has length 640 [2018-10-14 16:25:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:47,564 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 734 transitions. [2018-10-14 16:25:47,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 16:25:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 734 transitions. [2018-10-14 16:25:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-14 16:25:47,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:47,571 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:47,571 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:47,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:47,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1195085083, now seen corresponding path program 17 times [2018-10-14 16:25:47,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7890 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-10-14 16:25:48,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:48,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 16:25:48,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 16:25:48,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 16:25:48,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2018-10-14 16:25:48,425 INFO L87 Difference]: Start difference. First operand 727 states and 734 transitions. Second operand 29 states. [2018-10-14 16:25:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:53,745 INFO L93 Difference]: Finished difference Result 834 states and 842 transitions. [2018-10-14 16:25:53,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-14 16:25:53,745 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 726 [2018-10-14 16:25:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:53,749 INFO L225 Difference]: With dead ends: 834 [2018-10-14 16:25:53,750 INFO L226 Difference]: Without dead ends: 834 [2018-10-14 16:25:53,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9471 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4336, Invalid=19844, Unknown=0, NotChecked=0, Total=24180 [2018-10-14 16:25:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-10-14 16:25:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 813. [2018-10-14 16:25:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-10-14 16:25:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 821 transitions. [2018-10-14 16:25:53,767 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 821 transitions. Word has length 726 [2018-10-14 16:25:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:53,768 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 821 transitions. [2018-10-14 16:25:53,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 16:25:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 821 transitions. [2018-10-14 16:25:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2018-10-14 16:25:53,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:53,775 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:53,776 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:53,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1912230930, now seen corresponding path program 18 times [2018-10-14 16:25:53,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10103 backedges. 0 proven. 9425 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2018-10-14 16:25:54,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:54,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 16:25:54,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 16:25:54,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 16:25:54,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-10-14 16:25:54,911 INFO L87 Difference]: Start difference. First operand 813 states and 821 transitions. Second operand 29 states. [2018-10-14 16:25:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:58,208 INFO L93 Difference]: Finished difference Result 920 states and 929 transitions. [2018-10-14 16:25:58,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-14 16:25:58,208 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 812 [2018-10-14 16:25:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:58,214 INFO L225 Difference]: With dead ends: 920 [2018-10-14 16:25:58,214 INFO L226 Difference]: Without dead ends: 920 [2018-10-14 16:25:58,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6657 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3587, Invalid=14235, Unknown=0, NotChecked=0, Total=17822 [2018-10-14 16:25:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-10-14 16:25:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 899. [2018-10-14 16:25:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-14 16:25:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 908 transitions. [2018-10-14 16:25:58,228 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 908 transitions. Word has length 812 [2018-10-14 16:25:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:58,229 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 908 transitions. [2018-10-14 16:25:58,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 16:25:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 908 transitions. [2018-10-14 16:25:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-10-14 16:25:58,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:58,237 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:58,237 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:58,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:58,237 INFO L82 PathProgramCache]: Analyzing trace with hash -559381887, now seen corresponding path program 19 times [2018-10-14 16:25:58,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12590 backedges. 0 proven. 11818 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2018-10-14 16:26:00,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:00,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 16:26:00,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 16:26:00,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 16:26:00,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:26:00,754 INFO L87 Difference]: Start difference. First operand 899 states and 908 transitions. Second operand 31 states. [2018-10-14 16:26:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:04,576 INFO L93 Difference]: Finished difference Result 1006 states and 1016 transitions. [2018-10-14 16:26:04,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-14 16:26:04,576 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 898 [2018-10-14 16:26:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:04,581 INFO L225 Difference]: With dead ends: 1006 [2018-10-14 16:26:04,581 INFO L226 Difference]: Without dead ends: 1006 [2018-10-14 16:26:04,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8009 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4239, Invalid=16931, Unknown=0, NotChecked=0, Total=21170 [2018-10-14 16:26:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-10-14 16:26:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 985. [2018-10-14 16:26:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2018-10-14 16:26:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 995 transitions. [2018-10-14 16:26:04,596 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 995 transitions. Word has length 898 [2018-10-14 16:26:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:04,597 INFO L481 AbstractCegarLoop]: Abstraction has 985 states and 995 transitions. [2018-10-14 16:26:04,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 16:26:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 995 transitions. [2018-10-14 16:26:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 985 [2018-10-14 16:26:04,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:04,606 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:04,607 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:04,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:04,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2043003092, now seen corresponding path program 20 times [2018-10-14 16:26:04,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 15351 backedges. 9237 proven. 1162 refuted. 0 times theorem prover too weak. 4952 trivial. 0 not checked. [2018-10-14 16:26:05,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:05,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:26:05,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:26:05,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:26:05,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:26:05,747 INFO L87 Difference]: Start difference. First operand 985 states and 995 transitions. Second operand 26 states. [2018-10-14 16:26:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:06,782 INFO L93 Difference]: Finished difference Result 1182 states and 1192 transitions. [2018-10-14 16:26:06,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 16:26:06,784 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 984 [2018-10-14 16:26:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:06,788 INFO L225 Difference]: With dead ends: 1182 [2018-10-14 16:26:06,788 INFO L226 Difference]: Without dead ends: 1182 [2018-10-14 16:26:06,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=554, Invalid=2308, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:26:06,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-10-14 16:26:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1089. [2018-10-14 16:26:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-10-14 16:26:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1099 transitions. [2018-10-14 16:26:06,801 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1099 transitions. Word has length 984 [2018-10-14 16:26:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:06,802 INFO L481 AbstractCegarLoop]: Abstraction has 1089 states and 1099 transitions. [2018-10-14 16:26:06,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:26:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1099 transitions. [2018-10-14 16:26:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2018-10-14 16:26:06,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:06,813 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:06,813 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:06,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:06,814 INFO L82 PathProgramCache]: Analyzing trace with hash -543143870, now seen corresponding path program 21 times [2018-10-14 16:26:06,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19440 backedges. 12625 proven. 1862 refuted. 0 times theorem prover too weak. 4953 trivial. 0 not checked. [2018-10-14 16:26:08,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:08,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:26:08,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:26:08,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:26:08,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:26:08,636 INFO L87 Difference]: Start difference. First operand 1089 states and 1099 transitions. Second operand 30 states. [2018-10-14 16:26:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:10,489 INFO L93 Difference]: Finished difference Result 1261 states and 1271 transitions. [2018-10-14 16:26:10,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 16:26:10,490 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1074 [2018-10-14 16:26:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:10,495 INFO L225 Difference]: With dead ends: 1261 [2018-10-14 16:26:10,495 INFO L226 Difference]: Without dead ends: 1261 [2018-10-14 16:26:10,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=750, Invalid=3156, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:26:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2018-10-14 16:26:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1179. [2018-10-14 16:26:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2018-10-14 16:26:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1190 transitions. [2018-10-14 16:26:10,509 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1190 transitions. Word has length 1074 [2018-10-14 16:26:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:10,510 INFO L481 AbstractCegarLoop]: Abstraction has 1179 states and 1190 transitions. [2018-10-14 16:26:10,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:26:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1190 transitions. [2018-10-14 16:26:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1150 [2018-10-14 16:26:10,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:10,522 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:10,522 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:10,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1731378808, now seen corresponding path program 22 times [2018-10-14 16:26:10,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 23260 backedges. 0 proven. 21648 refuted. 0 times theorem prover too weak. 1612 trivial. 0 not checked. [2018-10-14 16:26:12,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:12,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 16:26:12,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 16:26:12,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 16:26:12,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:26:12,198 INFO L87 Difference]: Start difference. First operand 1179 states and 1190 transitions. Second operand 33 states. [2018-10-14 16:26:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:16,593 INFO L93 Difference]: Finished difference Result 1315 states and 1327 transitions. [2018-10-14 16:26:16,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-14 16:26:16,594 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1149 [2018-10-14 16:26:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:16,600 INFO L225 Difference]: With dead ends: 1315 [2018-10-14 16:26:16,600 INFO L226 Difference]: Without dead ends: 1315 [2018-10-14 16:26:16,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9486 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4945, Invalid=19861, Unknown=0, NotChecked=0, Total=24806 [2018-10-14 16:26:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2018-10-14 16:26:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1295. [2018-10-14 16:26:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2018-10-14 16:26:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1307 transitions. [2018-10-14 16:26:16,623 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1307 transitions. Word has length 1149 [2018-10-14 16:26:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:16,624 INFO L481 AbstractCegarLoop]: Abstraction has 1295 states and 1307 transitions. [2018-10-14 16:26:16,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 16:26:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1307 transitions. [2018-10-14 16:26:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1266 [2018-10-14 16:26:16,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:16,644 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:16,644 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:16,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash 247266203, now seen corresponding path program 23 times [2018-10-14 16:26:16,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 28721 backedges. 43 proven. 26832 refuted. 0 times theorem prover too weak. 1846 trivial. 0 not checked. [2018-10-14 16:26:18,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:18,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 16:26:18,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 16:26:18,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 16:26:18,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:26:18,496 INFO L87 Difference]: Start difference. First operand 1295 states and 1307 transitions. Second operand 35 states. [2018-10-14 16:26:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:22,862 INFO L93 Difference]: Finished difference Result 1431 states and 1444 transitions. [2018-10-14 16:26:22,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-14 16:26:22,862 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1265 [2018-10-14 16:26:22,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:22,869 INFO L225 Difference]: With dead ends: 1431 [2018-10-14 16:26:22,870 INFO L226 Difference]: Without dead ends: 1431 [2018-10-14 16:26:22,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10853 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6033, Invalid=21689, Unknown=0, NotChecked=0, Total=27722 [2018-10-14 16:26:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2018-10-14 16:26:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1411. [2018-10-14 16:26:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-10-14 16:26:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1424 transitions. [2018-10-14 16:26:22,887 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1424 transitions. Word has length 1265 [2018-10-14 16:26:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:22,888 INFO L481 AbstractCegarLoop]: Abstraction has 1411 states and 1424 transitions. [2018-10-14 16:26:22,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 16:26:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1424 transitions. [2018-10-14 16:26:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1382 [2018-10-14 16:26:22,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:22,905 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:22,905 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:22,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:22,906 INFO L82 PathProgramCache]: Analyzing trace with hash -29308370, now seen corresponding path program 24 times [2018-10-14 16:26:22,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 34760 backedges. 27091 proven. 5776 refuted. 0 times theorem prover too weak. 1893 trivial. 0 not checked. [2018-10-14 16:26:25,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:25,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:26:25,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:26:25,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:26:25,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1625, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:26:25,454 INFO L87 Difference]: Start difference. First operand 1411 states and 1424 transitions. Second operand 44 states. [2018-10-14 16:26:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:28,554 INFO L93 Difference]: Finished difference Result 1473 states and 1485 transitions. [2018-10-14 16:26:28,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 16:26:28,554 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1381 [2018-10-14 16:26:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:28,560 INFO L225 Difference]: With dead ends: 1473 [2018-10-14 16:26:28,561 INFO L226 Difference]: Without dead ends: 1473 [2018-10-14 16:26:28,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1626, Invalid=6746, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 16:26:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2018-10-14 16:26:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1441. [2018-10-14 16:26:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-10-14 16:26:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1455 transitions. [2018-10-14 16:26:28,576 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1455 transitions. Word has length 1381 [2018-10-14 16:26:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:28,577 INFO L481 AbstractCegarLoop]: Abstraction has 1441 states and 1455 transitions. [2018-10-14 16:26:28,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:26:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1455 transitions. [2018-10-14 16:26:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1397 [2018-10-14 16:26:28,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:28,593 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:28,593 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:28,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:28,594 INFO L82 PathProgramCache]: Analyzing trace with hash 509279760, now seen corresponding path program 25 times [2018-10-14 16:26:28,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 35751 backedges. 26580 proven. 4003 refuted. 0 times theorem prover too weak. 5168 trivial. 0 not checked. [2018-10-14 16:26:32,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:32,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 16:26:32,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 16:26:32,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 16:26:32,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:26:32,155 INFO L87 Difference]: Start difference. First operand 1441 states and 1455 transitions. Second operand 38 states. [2018-10-14 16:26:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:34,550 INFO L93 Difference]: Finished difference Result 1557 states and 1569 transitions. [2018-10-14 16:26:34,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 16:26:34,551 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1396 [2018-10-14 16:26:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:34,557 INFO L225 Difference]: With dead ends: 1557 [2018-10-14 16:26:34,557 INFO L226 Difference]: Without dead ends: 1557 [2018-10-14 16:26:34,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1206, Invalid=5114, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 16:26:34,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2018-10-14 16:26:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1486. [2018-10-14 16:26:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-10-14 16:26:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1500 transitions. [2018-10-14 16:26:34,572 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1500 transitions. Word has length 1396 [2018-10-14 16:26:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:34,573 INFO L481 AbstractCegarLoop]: Abstraction has 1486 states and 1500 transitions. [2018-10-14 16:26:34,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 16:26:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1500 transitions. [2018-10-14 16:26:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1442 [2018-10-14 16:26:34,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:34,590 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:34,590 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:34,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:34,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1768861730, now seen corresponding path program 26 times [2018-10-14 16:26:34,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 38814 backedges. 0 proven. 36407 refuted. 0 times theorem prover too weak. 2407 trivial. 0 not checked. [2018-10-14 16:26:37,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:37,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:26:37,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:26:37,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:26:37,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:26:37,445 INFO L87 Difference]: Start difference. First operand 1486 states and 1500 transitions. Second operand 39 states. [2018-10-14 16:26:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:45,766 INFO L93 Difference]: Finished difference Result 1637 states and 1652 transitions. [2018-10-14 16:26:45,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-14 16:26:45,766 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1441 [2018-10-14 16:26:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:45,773 INFO L225 Difference]: With dead ends: 1637 [2018-10-14 16:26:45,773 INFO L226 Difference]: Without dead ends: 1637 [2018-10-14 16:26:45,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23266 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=9856, Invalid=45604, Unknown=0, NotChecked=0, Total=55460 [2018-10-14 16:26:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-10-14 16:26:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1617. [2018-10-14 16:26:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2018-10-14 16:26:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 1632 transitions. [2018-10-14 16:26:45,789 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 1632 transitions. Word has length 1441 [2018-10-14 16:26:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:45,790 INFO L481 AbstractCegarLoop]: Abstraction has 1617 states and 1632 transitions. [2018-10-14 16:26:45,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:26:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1632 transitions. [2018-10-14 16:26:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1573 [2018-10-14 16:26:45,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:45,810 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:45,810 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:45,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:45,811 INFO L82 PathProgramCache]: Analyzing trace with hash -316696535, now seen corresponding path program 27 times [2018-10-14 16:26:45,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 46937 backedges. 36509 proven. 6237 refuted. 0 times theorem prover too weak. 4191 trivial. 0 not checked. [2018-10-14 16:26:49,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:49,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:26:49,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:26:49,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:26:49,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1635, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:26:49,026 INFO L87 Difference]: Start difference. First operand 1617 states and 1632 transitions. Second operand 44 states. [2018-10-14 16:26:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:52,196 INFO L93 Difference]: Finished difference Result 1737 states and 1750 transitions. [2018-10-14 16:26:52,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 16:26:52,197 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1572 [2018-10-14 16:26:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:52,204 INFO L225 Difference]: With dead ends: 1737 [2018-10-14 16:26:52,204 INFO L226 Difference]: Without dead ends: 1737 [2018-10-14 16:26:52,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1631, Invalid=6925, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 16:26:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2018-10-14 16:26:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1677. [2018-10-14 16:26:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2018-10-14 16:26:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 1693 transitions. [2018-10-14 16:26:52,219 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 1693 transitions. Word has length 1572 [2018-10-14 16:26:52,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:52,220 INFO L481 AbstractCegarLoop]: Abstraction has 1677 states and 1693 transitions. [2018-10-14 16:26:52,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:26:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 1693 transitions. [2018-10-14 16:26:52,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1618 [2018-10-14 16:26:52,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:52,240 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:52,240 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:52,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1277651717, now seen corresponding path program 28 times [2018-10-14 16:26:52,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 50453 backedges. 0 proven. 47375 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2018-10-14 16:26:55,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:55,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:26:55,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:26:55,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:26:55,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:26:55,075 INFO L87 Difference]: Start difference. First operand 1677 states and 1693 transitions. Second operand 39 states. [2018-10-14 16:27:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:00,581 INFO L93 Difference]: Finished difference Result 1843 states and 1860 transitions. [2018-10-14 16:27:00,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-10-14 16:27:00,582 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1617 [2018-10-14 16:27:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:00,589 INFO L225 Difference]: With dead ends: 1843 [2018-10-14 16:27:00,589 INFO L226 Difference]: Without dead ends: 1843 [2018-10-14 16:27:00,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14667 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7387, Invalid=30055, Unknown=0, NotChecked=0, Total=37442 [2018-10-14 16:27:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2018-10-14 16:27:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1823. [2018-10-14 16:27:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2018-10-14 16:27:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 1840 transitions. [2018-10-14 16:27:00,605 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 1840 transitions. Word has length 1617 [2018-10-14 16:27:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:00,605 INFO L481 AbstractCegarLoop]: Abstraction has 1823 states and 1840 transitions. [2018-10-14 16:27:00,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:27:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 1840 transitions. [2018-10-14 16:27:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1764 [2018-10-14 16:27:00,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:00,625 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:00,625 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:00,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash -936359090, now seen corresponding path program 29 times [2018-10-14 16:27:00,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 60977 backedges. 18214 proven. 877 refuted. 0 times theorem prover too weak. 41886 trivial. 0 not checked. [2018-10-14 16:27:02,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:02,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 16:27:02,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 16:27:02,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 16:27:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:27:02,781 INFO L87 Difference]: Start difference. First operand 1823 states and 1840 transitions. Second operand 24 states. [2018-10-14 16:27:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:04,001 INFO L93 Difference]: Finished difference Result 1838 states and 1855 transitions. [2018-10-14 16:27:04,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 16:27:04,001 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1763 [2018-10-14 16:27:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:04,008 INFO L225 Difference]: With dead ends: 1838 [2018-10-14 16:27:04,008 INFO L226 Difference]: Without dead ends: 1838 [2018-10-14 16:27:04,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:27:04,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-10-14 16:27:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2018-10-14 16:27:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-10-14 16:27:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1855 transitions. [2018-10-14 16:27:04,020 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1855 transitions. Word has length 1763 [2018-10-14 16:27:04,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:04,021 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 1855 transitions. [2018-10-14 16:27:04,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 16:27:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1855 transitions. [2018-10-14 16:27:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1779 [2018-10-14 16:27:04,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:04,042 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:04,042 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:04,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:04,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1554094956, now seen corresponding path program 30 times [2018-10-14 16:27:04,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 62300 backedges. 75 proven. 58687 refuted. 0 times theorem prover too weak. 3538 trivial. 0 not checked. [2018-10-14 16:27:07,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:07,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:27:07,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:27:07,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:27:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:27:07,091 INFO L87 Difference]: Start difference. First operand 1838 states and 1855 transitions. Second operand 43 states. [2018-10-14 16:27:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:14,480 INFO L93 Difference]: Finished difference Result 2004 states and 2022 transitions. [2018-10-14 16:27:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-14 16:27:14,481 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1778 [2018-10-14 16:27:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:14,489 INFO L225 Difference]: With dead ends: 2004 [2018-10-14 16:27:14,489 INFO L226 Difference]: Without dead ends: 2004 [2018-10-14 16:27:14,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26337 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=12454, Invalid=48802, Unknown=0, NotChecked=0, Total=61256 [2018-10-14 16:27:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2018-10-14 16:27:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1984. [2018-10-14 16:27:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1984 states. [2018-10-14 16:27:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2002 transitions. [2018-10-14 16:27:14,506 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2002 transitions. Word has length 1778 [2018-10-14 16:27:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:14,507 INFO L481 AbstractCegarLoop]: Abstraction has 1984 states and 2002 transitions. [2018-10-14 16:27:14,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:27:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2002 transitions. [2018-10-14 16:27:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1925 [2018-10-14 16:27:14,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:14,525 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:14,526 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:14,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:14,526 INFO L82 PathProgramCache]: Analyzing trace with hash 453392039, now seen corresponding path program 31 times [2018-10-14 16:27:14,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 73947 backedges. 32990 proven. 2322 refuted. 0 times theorem prover too weak. 38635 trivial. 0 not checked. [2018-10-14 16:27:17,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:17,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:27:17,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:27:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:27:17,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:27:17,202 INFO L87 Difference]: Start difference. First operand 1984 states and 2002 transitions. Second operand 32 states. [2018-10-14 16:27:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:19,293 INFO L93 Difference]: Finished difference Result 2033 states and 2049 transitions. [2018-10-14 16:27:19,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 16:27:19,294 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1924 [2018-10-14 16:27:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:19,300 INFO L225 Difference]: With dead ends: 2033 [2018-10-14 16:27:19,300 INFO L226 Difference]: Without dead ends: 2033 [2018-10-14 16:27:19,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1044, Invalid=4358, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 16:27:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2018-10-14 16:27:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2029. [2018-10-14 16:27:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-10-14 16:27:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2047 transitions. [2018-10-14 16:27:19,314 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2047 transitions. Word has length 1924 [2018-10-14 16:27:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:19,315 INFO L481 AbstractCegarLoop]: Abstraction has 2029 states and 2047 transitions. [2018-10-14 16:27:19,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:27:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2047 transitions. [2018-10-14 16:27:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1970 [2018-10-14 16:27:19,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:19,337 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:19,337 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:19,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:19,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1345881893, now seen corresponding path program 32 times [2018-10-14 16:27:19,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 78369 backedges. 41282 proven. 3509 refuted. 0 times theorem prover too weak. 33578 trivial. 0 not checked. [2018-10-14 16:27:21,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:21,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:27:21,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:27:21,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:27:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:27:21,929 INFO L87 Difference]: Start difference. First operand 2029 states and 2047 transitions. Second operand 36 states. [2018-10-14 16:27:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:24,541 INFO L93 Difference]: Finished difference Result 2095 states and 2110 transitions. [2018-10-14 16:27:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-14 16:27:24,541 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1969 [2018-10-14 16:27:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:24,550 INFO L225 Difference]: With dead ends: 2095 [2018-10-14 16:27:24,550 INFO L226 Difference]: Without dead ends: 2095 [2018-10-14 16:27:24,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1343, Invalid=5629, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 16:27:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2018-10-14 16:27:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2089. [2018-10-14 16:27:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2018-10-14 16:27:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2107 transitions. [2018-10-14 16:27:24,568 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2107 transitions. Word has length 1969 [2018-10-14 16:27:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:24,569 INFO L481 AbstractCegarLoop]: Abstraction has 2089 states and 2107 transitions. [2018-10-14 16:27:24,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:27:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2107 transitions. [2018-10-14 16:27:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2030 [2018-10-14 16:27:24,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:24,593 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:24,593 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:24,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1252517017, now seen corresponding path program 33 times [2018-10-14 16:27:24,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 84475 backedges. 0 proven. 79783 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-10-14 16:27:28,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:28,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:27:28,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:27:28,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:27:28,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1433, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:27:28,457 INFO L87 Difference]: Start difference. First operand 2089 states and 2107 transitions. Second operand 43 states. [2018-10-14 16:27:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:35,185 INFO L93 Difference]: Finished difference Result 2255 states and 2274 transitions. [2018-10-14 16:27:35,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-14 16:27:35,186 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2029 [2018-10-14 16:27:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:35,194 INFO L225 Difference]: With dead ends: 2255 [2018-10-14 16:27:35,194 INFO L226 Difference]: Without dead ends: 2255 [2018-10-14 16:27:35,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18746 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9285, Invalid=38021, Unknown=0, NotChecked=0, Total=47306 [2018-10-14 16:27:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2018-10-14 16:27:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 2235. [2018-10-14 16:27:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2018-10-14 16:27:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2254 transitions. [2018-10-14 16:27:35,216 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2254 transitions. Word has length 2029 [2018-10-14 16:27:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:35,217 INFO L481 AbstractCegarLoop]: Abstraction has 2235 states and 2254 transitions. [2018-10-14 16:27:35,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:27:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2254 transitions. [2018-10-14 16:27:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2176 [2018-10-14 16:27:35,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:35,245 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:35,245 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:35,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1482215098, now seen corresponding path program 34 times [2018-10-14 16:27:35,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 97971 backedges. 0 proven. 92851 refuted. 0 times theorem prover too weak. 5120 trivial. 0 not checked. [2018-10-14 16:27:39,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:39,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 16:27:39,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 16:27:39,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 16:27:39,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1568, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:27:39,288 INFO L87 Difference]: Start difference. First operand 2235 states and 2254 transitions. Second operand 45 states. [2018-10-14 16:27:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:46,450 INFO L93 Difference]: Finished difference Result 2401 states and 2421 transitions. [2018-10-14 16:27:46,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-10-14 16:27:46,451 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 2175 [2018-10-14 16:27:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:46,457 INFO L225 Difference]: With dead ends: 2401 [2018-10-14 16:27:46,457 INFO L226 Difference]: Without dead ends: 2401 [2018-10-14 16:27:46,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20973 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10315, Invalid=42355, Unknown=0, NotChecked=0, Total=52670 [2018-10-14 16:27:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2018-10-14 16:27:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2381. [2018-10-14 16:27:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2018-10-14 16:27:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2401 transitions. [2018-10-14 16:27:46,478 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2401 transitions. Word has length 2175 [2018-10-14 16:27:46,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:46,479 INFO L481 AbstractCegarLoop]: Abstraction has 2381 states and 2401 transitions. [2018-10-14 16:27:46,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 16:27:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2401 transitions. [2018-10-14 16:27:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2322 [2018-10-14 16:27:46,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:46,507 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:46,507 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:46,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1269546163, now seen corresponding path program 35 times [2018-10-14 16:27:46,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 112469 backedges. 0 proven. 106921 refuted. 0 times theorem prover too weak. 5548 trivial. 0 not checked. [2018-10-14 16:27:50,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:50,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 16:27:50,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 16:27:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 16:27:50,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1709, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:27:50,946 INFO L87 Difference]: Start difference. First operand 2381 states and 2401 transitions. Second operand 47 states. [2018-10-14 16:27:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:59,217 INFO L93 Difference]: Finished difference Result 2547 states and 2568 transitions. [2018-10-14 16:27:59,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-14 16:27:59,217 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2321 [2018-10-14 16:27:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:59,223 INFO L225 Difference]: With dead ends: 2547 [2018-10-14 16:27:59,223 INFO L226 Difference]: Without dead ends: 2547 [2018-10-14 16:27:59,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23325 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11399, Invalid=46923, Unknown=0, NotChecked=0, Total=58322 [2018-10-14 16:27:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2018-10-14 16:27:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2527. [2018-10-14 16:27:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-10-14 16:27:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 2548 transitions. [2018-10-14 16:27:59,241 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 2548 transitions. Word has length 2321 [2018-10-14 16:27:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:59,242 INFO L481 AbstractCegarLoop]: Abstraction has 2527 states and 2548 transitions. [2018-10-14 16:27:59,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 16:27:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 2548 transitions. [2018-10-14 16:27:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2468 [2018-10-14 16:27:59,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:59,274 INFO L375 BasicCegarLoop]: trace histogram [128, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:59,274 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:59,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:59,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1933530848, now seen corresponding path program 36 times [2018-10-14 16:27:59,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 127969 backedges. 0 proven. 121993 refuted. 0 times theorem prover too weak. 5976 trivial. 0 not checked. [2018-10-14 16:28:04,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:04,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 16:28:04,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 16:28:04,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 16:28:04,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=1856, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 16:28:04,034 INFO L87 Difference]: Start difference. First operand 2527 states and 2548 transitions. Second operand 49 states. [2018-10-14 16:28:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:13,142 INFO L93 Difference]: Finished difference Result 2693 states and 2715 transitions. [2018-10-14 16:28:13,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-14 16:28:13,142 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2467 [2018-10-14 16:28:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:13,149 INFO L225 Difference]: With dead ends: 2693 [2018-10-14 16:28:13,149 INFO L226 Difference]: Without dead ends: 2693 [2018-10-14 16:28:13,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25802 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12537, Invalid=51725, Unknown=0, NotChecked=0, Total=64262 [2018-10-14 16:28:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2018-10-14 16:28:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2673. [2018-10-14 16:28:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2673 states. [2018-10-14 16:28:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2695 transitions. [2018-10-14 16:28:13,177 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2695 transitions. Word has length 2467 [2018-10-14 16:28:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:13,178 INFO L481 AbstractCegarLoop]: Abstraction has 2673 states and 2695 transitions. [2018-10-14 16:28:13,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 16:28:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2695 transitions. [2018-10-14 16:28:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2614 [2018-10-14 16:28:13,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:13,226 INFO L375 BasicCegarLoop]: trace histogram [136, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:28:13,226 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:13,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:13,227 INFO L82 PathProgramCache]: Analyzing trace with hash 317206579, now seen corresponding path program 37 times [2018-10-14 16:28:13,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 144471 backedges. 0 proven. 138067 refuted. 0 times theorem prover too weak. 6404 trivial. 0 not checked. [2018-10-14 16:28:19,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:19,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 16:28:19,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 16:28:19,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 16:28:19,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=2009, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:28:19,400 INFO L87 Difference]: Start difference. First operand 2673 states and 2695 transitions. Second operand 51 states. [2018-10-14 16:28:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:28,884 INFO L93 Difference]: Finished difference Result 2839 states and 2862 transitions. [2018-10-14 16:28:28,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-14 16:28:28,885 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2613 [2018-10-14 16:28:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:28,891 INFO L225 Difference]: With dead ends: 2839 [2018-10-14 16:28:28,891 INFO L226 Difference]: Without dead ends: 2839 [2018-10-14 16:28:28,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28404 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13729, Invalid=56761, Unknown=0, NotChecked=0, Total=70490 [2018-10-14 16:28:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2018-10-14 16:28:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2819. [2018-10-14 16:28:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2018-10-14 16:28:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 2842 transitions. [2018-10-14 16:28:28,918 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 2842 transitions. Word has length 2613 [2018-10-14 16:28:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:28,919 INFO L481 AbstractCegarLoop]: Abstraction has 2819 states and 2842 transitions. [2018-10-14 16:28:28,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 16:28:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 2842 transitions. [2018-10-14 16:28:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2760 [2018-10-14 16:28:28,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:28,968 INFO L375 BasicCegarLoop]: trace histogram [144, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:28:28,968 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:28,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1491667078, now seen corresponding path program 38 times [2018-10-14 16:28:28,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 161975 backedges. 0 proven. 155143 refuted. 0 times theorem prover too weak. 6832 trivial. 0 not checked. [2018-10-14 16:28:34,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:34,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 16:28:34,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 16:28:34,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 16:28:34,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2168, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 16:28:34,745 INFO L87 Difference]: Start difference. First operand 2819 states and 2842 transitions. Second operand 53 states. [2018-10-14 16:28:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:45,265 INFO L93 Difference]: Finished difference Result 2985 states and 3009 transitions. [2018-10-14 16:28:45,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-10-14 16:28:45,266 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 2759 [2018-10-14 16:28:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:45,273 INFO L225 Difference]: With dead ends: 2985 [2018-10-14 16:28:45,273 INFO L226 Difference]: Without dead ends: 2985 [2018-10-14 16:28:45,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31131 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14975, Invalid=62031, Unknown=0, NotChecked=0, Total=77006 [2018-10-14 16:28:45,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2018-10-14 16:28:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2965. [2018-10-14 16:28:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2018-10-14 16:28:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 2989 transitions. [2018-10-14 16:28:45,305 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 2989 transitions. Word has length 2759 [2018-10-14 16:28:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:45,307 INFO L481 AbstractCegarLoop]: Abstraction has 2965 states and 2989 transitions. [2018-10-14 16:28:45,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 16:28:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 2989 transitions. [2018-10-14 16:28:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2906 [2018-10-14 16:28:45,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:45,368 INFO L375 BasicCegarLoop]: trace histogram [152, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:28:45,368 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:45,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash 78995993, now seen corresponding path program 39 times [2018-10-14 16:28:45,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 180481 backedges. 9229 proven. 98 refuted. 0 times theorem prover too weak. 171154 trivial. 0 not checked. [2018-10-14 16:28:48,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:48,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 16:28:48,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 16:28:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 16:28:48,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:28:48,954 INFO L87 Difference]: Start difference. First operand 2965 states and 2989 transitions. Second operand 11 states. [2018-10-14 16:28:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:49,351 INFO L93 Difference]: Finished difference Result 3122 states and 3148 transitions. [2018-10-14 16:28:49,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 16:28:49,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 2905 [2018-10-14 16:28:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:49,355 INFO L225 Difference]: With dead ends: 3122 [2018-10-14 16:28:49,355 INFO L226 Difference]: Without dead ends: 3122 [2018-10-14 16:28:49,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:28:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2018-10-14 16:28:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2965. [2018-10-14 16:28:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2018-10-14 16:28:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 2988 transitions. [2018-10-14 16:28:49,379 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 2988 transitions. Word has length 2905 [2018-10-14 16:28:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:49,380 INFO L481 AbstractCegarLoop]: Abstraction has 2965 states and 2988 transitions. [2018-10-14 16:28:49,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 16:28:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 2988 transitions. [2018-10-14 16:28:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2921 [2018-10-14 16:28:49,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:49,449 INFO L375 BasicCegarLoop]: trace histogram [153, 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:28:49,449 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:49,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1686595009, now seen corresponding path program 40 times [2018-10-14 16:28:49,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 182771 backedges. 57 proven. 175404 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2018-10-14 16:28:55,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:55,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 16:28:55,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 16:28:55,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 16:28:55,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=2330, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:28:55,973 INFO L87 Difference]: Start difference. First operand 2965 states and 2988 transitions. Second operand 55 states. [2018-10-14 16:29:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:06,159 INFO L93 Difference]: Finished difference Result 3131 states and 3155 transitions. [2018-10-14 16:29:06,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2018-10-14 16:29:06,160 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 2920 [2018-10-14 16:29:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:06,163 INFO L225 Difference]: With dead ends: 3131 [2018-10-14 16:29:06,163 INFO L226 Difference]: Without dead ends: 3131 [2018-10-14 16:29:06,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33913 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=17438, Invalid=64644, Unknown=0, NotChecked=0, Total=82082 [2018-10-14 16:29:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2018-10-14 16:29:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3111. [2018-10-14 16:29:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3111 states. [2018-10-14 16:29:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 3135 transitions. [2018-10-14 16:29:06,193 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 3135 transitions. Word has length 2920 [2018-10-14 16:29:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:06,195 INFO L481 AbstractCegarLoop]: Abstraction has 3111 states and 3135 transitions. [2018-10-14 16:29:06,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 16:29:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 3135 transitions. [2018-10-14 16:29:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3067 [2018-10-14 16:29:06,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:06,264 INFO L375 BasicCegarLoop]: trace histogram [161, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:29:06,264 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:06,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:06,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1287704820, now seen corresponding path program 41 times [2018-10-14 16:29:06,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 202400 backedges. 0 proven. 194666 refuted. 0 times theorem prover too weak. 7734 trivial. 0 not checked. [2018-10-14 16:29:13,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:13,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-14 16:29:13,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-14 16:29:13,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-14 16:29:13,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=688, Invalid=2504, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 16:29:13,634 INFO L87 Difference]: Start difference. First operand 3111 states and 3135 transitions. Second operand 57 states. [2018-10-14 16:29:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:25,900 INFO L93 Difference]: Finished difference Result 3277 states and 3302 transitions. [2018-10-14 16:29:25,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2018-10-14 16:29:25,900 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 3066 [2018-10-14 16:29:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:25,903 INFO L225 Difference]: With dead ends: 3277 [2018-10-14 16:29:25,903 INFO L226 Difference]: Without dead ends: 3277 [2018-10-14 16:29:25,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36960 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=17629, Invalid=73273, Unknown=0, NotChecked=0, Total=90902 [2018-10-14 16:29:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2018-10-14 16:29:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3257. [2018-10-14 16:29:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3257 states. [2018-10-14 16:29:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 3282 transitions. [2018-10-14 16:29:25,923 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 3282 transitions. Word has length 3066 [2018-10-14 16:29:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:25,924 INFO L481 AbstractCegarLoop]: Abstraction has 3257 states and 3282 transitions. [2018-10-14 16:29:25,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-14 16:29:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 3282 transitions. [2018-10-14 16:29:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3213 [2018-10-14 16:29:25,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:25,976 INFO L375 BasicCegarLoop]: trace histogram [169, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:29:25,977 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:25,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:25,978 INFO L82 PathProgramCache]: Analyzing trace with hash 250821273, now seen corresponding path program 42 times [2018-10-14 16:29:25,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 223031 backedges. 0 proven. 214869 refuted. 0 times theorem prover too weak. 8162 trivial. 0 not checked. [2018-10-14 16:29:33,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:33,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 16:29:33,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 16:29:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 16:29:33,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=2681, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 16:29:33,892 INFO L87 Difference]: Start difference. First operand 3257 states and 3282 transitions. Second operand 59 states. [2018-10-14 16:29:41,531 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-14 16:29:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:46,875 INFO L93 Difference]: Finished difference Result 3423 states and 3449 transitions. [2018-10-14 16:29:46,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2018-10-14 16:29:46,876 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 3212 [2018-10-14 16:29:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:46,880 INFO L225 Difference]: With dead ends: 3423 [2018-10-14 16:29:46,880 INFO L226 Difference]: Without dead ends: 3423 [2018-10-14 16:29:46,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40062 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=19037, Invalid=79245, Unknown=0, NotChecked=0, Total=98282 [2018-10-14 16:29:46,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2018-10-14 16:29:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 3403. [2018-10-14 16:29:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2018-10-14 16:29:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 3429 transitions. [2018-10-14 16:29:46,900 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 3429 transitions. Word has length 3212 [2018-10-14 16:29:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:46,901 INFO L481 AbstractCegarLoop]: Abstraction has 3403 states and 3429 transitions. [2018-10-14 16:29:46,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 16:29:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 3429 transitions. [2018-10-14 16:29:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3359 [2018-10-14 16:29:46,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:46,962 INFO L375 BasicCegarLoop]: trace histogram [177, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:29:46,963 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:46,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash -352285466, now seen corresponding path program 43 times [2018-10-14 16:29:46,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 244664 backedges. 0 proven. 236074 refuted. 0 times theorem prover too weak. 8590 trivial. 0 not checked. [2018-10-14 16:29:55,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:55,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-14 16:29:55,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-14 16:29:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-14 16:29:55,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=796, Invalid=2864, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 16:29:55,480 INFO L87 Difference]: Start difference. First operand 3403 states and 3429 transitions. Second operand 61 states. [2018-10-14 16:30:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:09,045 INFO L93 Difference]: Finished difference Result 3569 states and 3596 transitions. [2018-10-14 16:30:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2018-10-14 16:30:09,047 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 3358 [2018-10-14 16:30:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:09,052 INFO L225 Difference]: With dead ends: 3569 [2018-10-14 16:30:09,053 INFO L226 Difference]: Without dead ends: 3569 [2018-10-14 16:30:09,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43289 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=20499, Invalid=85451, Unknown=0, NotChecked=0, Total=105950 [2018-10-14 16:30:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2018-10-14 16:30:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 3549. [2018-10-14 16:30:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-10-14 16:30:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 3576 transitions. [2018-10-14 16:30:09,080 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 3576 transitions. Word has length 3358 [2018-10-14 16:30:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:09,081 INFO L481 AbstractCegarLoop]: Abstraction has 3549 states and 3576 transitions. [2018-10-14 16:30:09,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-14 16:30:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 3576 transitions. [2018-10-14 16:30:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3505 [2018-10-14 16:30:09,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:09,142 INFO L375 BasicCegarLoop]: trace histogram [185, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:30:09,142 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:09,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2122385933, now seen corresponding path program 44 times [2018-10-14 16:30:09,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 267299 backedges. 0 proven. 258281 refuted. 0 times theorem prover too weak. 9018 trivial. 0 not checked. [2018-10-14 16:30:19,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:19,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-14 16:30:19,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-14 16:30:19,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-14 16:30:19,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=3053, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:30:19,622 INFO L87 Difference]: Start difference. First operand 3549 states and 3576 transitions. Second operand 63 states. [2018-10-14 16:30:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:33,787 INFO L93 Difference]: Finished difference Result 3715 states and 3743 transitions. [2018-10-14 16:30:33,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 280 states. [2018-10-14 16:30:33,788 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 3504 [2018-10-14 16:30:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:33,793 INFO L225 Difference]: With dead ends: 3715 [2018-10-14 16:30:33,793 INFO L226 Difference]: Without dead ends: 3715 [2018-10-14 16:30:33,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46641 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=22015, Invalid=91891, Unknown=0, NotChecked=0, Total=113906 [2018-10-14 16:30:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2018-10-14 16:30:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3695. [2018-10-14 16:30:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3695 states. [2018-10-14 16:30:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 3723 transitions. [2018-10-14 16:30:33,818 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 3723 transitions. Word has length 3504 [2018-10-14 16:30:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:33,819 INFO L481 AbstractCegarLoop]: Abstraction has 3695 states and 3723 transitions. [2018-10-14 16:30:33,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-14 16:30:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 3723 transitions. [2018-10-14 16:30:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3651 [2018-10-14 16:30:33,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:33,890 INFO L375 BasicCegarLoop]: trace histogram [193, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:30:33,890 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:33,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:33,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1221442112, now seen corresponding path program 45 times [2018-10-14 16:30:33,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 290936 backedges. 0 proven. 281490 refuted. 0 times theorem prover too weak. 9446 trivial. 0 not checked. [2018-10-14 16:30:44,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:44,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-14 16:30:44,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-14 16:30:44,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-14 16:30:44,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=912, Invalid=3248, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 16:30:44,337 INFO L87 Difference]: Start difference. First operand 3695 states and 3723 transitions. Second operand 65 states. [2018-10-14 16:30:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:59,124 INFO L93 Difference]: Finished difference Result 3861 states and 3890 transitions. [2018-10-14 16:30:59,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 290 states. [2018-10-14 16:30:59,124 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 3650 [2018-10-14 16:30:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:59,127 INFO L225 Difference]: With dead ends: 3861 [2018-10-14 16:30:59,128 INFO L226 Difference]: Without dead ends: 3861 [2018-10-14 16:30:59,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50118 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=23585, Invalid=98565, Unknown=0, NotChecked=0, Total=122150 [2018-10-14 16:30:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2018-10-14 16:30:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3841. [2018-10-14 16:30:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2018-10-14 16:30:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 3870 transitions. [2018-10-14 16:30:59,156 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 3870 transitions. Word has length 3650 [2018-10-14 16:30:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:59,157 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 3870 transitions. [2018-10-14 16:30:59,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-14 16:30:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 3870 transitions. [2018-10-14 16:30:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3797 [2018-10-14 16:30:59,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:59,226 INFO L375 BasicCegarLoop]: trace histogram [201, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:30:59,227 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:59,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:59,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2004202419, now seen corresponding path program 46 times [2018-10-14 16:30:59,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 315575 backedges. 0 proven. 305701 refuted. 0 times theorem prover too weak. 9874 trivial. 0 not checked. [2018-10-14 16:31:10,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:10,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 16:31:10,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 16:31:10,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 16:31:10,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=3449, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 16:31:10,573 INFO L87 Difference]: Start difference. First operand 3841 states and 3870 transitions. Second operand 67 states. [2018-10-14 16:31:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:26,243 INFO L93 Difference]: Finished difference Result 4007 states and 4037 transitions. [2018-10-14 16:31:26,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 300 states. [2018-10-14 16:31:26,243 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 3796 [2018-10-14 16:31:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:26,248 INFO L225 Difference]: With dead ends: 4007 [2018-10-14 16:31:26,248 INFO L226 Difference]: Without dead ends: 4007 [2018-10-14 16:31:26,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53720 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=25209, Invalid=105473, Unknown=0, NotChecked=0, Total=130682 [2018-10-14 16:31:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4007 states. [2018-10-14 16:31:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4007 to 3987. [2018-10-14 16:31:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3987 states. [2018-10-14 16:31:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 4017 transitions. [2018-10-14 16:31:26,283 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 4017 transitions. Word has length 3796 [2018-10-14 16:31:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:26,284 INFO L481 AbstractCegarLoop]: Abstraction has 3987 states and 4017 transitions. [2018-10-14 16:31:26,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 16:31:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 4017 transitions. [2018-10-14 16:31:26,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3943 [2018-10-14 16:31:26,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:26,367 INFO L375 BasicCegarLoop]: trace histogram [209, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:31:26,367 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:26,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash 916642202, now seen corresponding path program 47 times [2018-10-14 16:31:26,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 341216 backedges. 264501 proven. 15215 refuted. 0 times theorem prover too weak. 61500 trivial. 0 not checked. [2018-10-14 16:31:36,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:36,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 16:31:36,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 16:31:36,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 16:31:36,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=3033, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:31:36,297 INFO L87 Difference]: Start difference. First operand 3987 states and 4017 transitions. Second operand 60 states. [2018-10-14 16:31:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:40,724 INFO L93 Difference]: Finished difference Result 4331 states and 4359 transitions. [2018-10-14 16:31:40,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-14 16:31:40,725 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 3942 [2018-10-14 16:31:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:40,730 INFO L225 Difference]: With dead ends: 4331 [2018-10-14 16:31:40,730 INFO L226 Difference]: Without dead ends: 4331 [2018-10-14 16:31:40,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3678 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3102, Invalid=12648, Unknown=0, NotChecked=0, Total=15750 [2018-10-14 16:31:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2018-10-14 16:31:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 4167. [2018-10-14 16:31:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4167 states. [2018-10-14 16:31:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 4198 transitions. [2018-10-14 16:31:40,755 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 4198 transitions. Word has length 3942 [2018-10-14 16:31:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:40,757 INFO L481 AbstractCegarLoop]: Abstraction has 4167 states and 4198 transitions. [2018-10-14 16:31:40,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 16:31:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 4198 transitions. [2018-10-14 16:31:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4108 [2018-10-14 16:31:40,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:40,845 INFO L375 BasicCegarLoop]: trace histogram [220, 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:31:40,845 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:40,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2122296186, now seen corresponding path program 48 times [2018-10-14 16:31:40,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 376713 backedges. 0 proven. 365080 refuted. 0 times theorem prover too weak. 11633 trivial. 0 not checked. [2018-10-14 16:31:54,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:54,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-14 16:31:54,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-14 16:31:54,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-14 16:31:54,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1036, Invalid=3656, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 16:31:54,627 INFO L87 Difference]: Start difference. First operand 4167 states and 4198 transitions. Second operand 69 states. [2018-10-14 16:32:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:11,567 INFO L93 Difference]: Finished difference Result 4348 states and 4380 transitions. [2018-10-14 16:32:11,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 310 states. [2018-10-14 16:32:11,567 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 4107 [2018-10-14 16:32:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:11,572 INFO L225 Difference]: With dead ends: 4348 [2018-10-14 16:32:11,572 INFO L226 Difference]: Without dead ends: 4348 [2018-10-14 16:32:11,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57447 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=26887, Invalid=112615, Unknown=0, NotChecked=0, Total=139502 [2018-10-14 16:32:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2018-10-14 16:32:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 4328. [2018-10-14 16:32:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4328 states. [2018-10-14 16:32:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4328 states to 4328 states and 4360 transitions. [2018-10-14 16:32:11,600 INFO L78 Accepts]: Start accepts. Automaton has 4328 states and 4360 transitions. Word has length 4107 [2018-10-14 16:32:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:11,601 INFO L481 AbstractCegarLoop]: Abstraction has 4328 states and 4360 transitions. [2018-10-14 16:32:11,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-14 16:32:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4328 states and 4360 transitions. [2018-10-14 16:32:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4269 [2018-10-14 16:32:11,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:11,690 INFO L375 BasicCegarLoop]: trace histogram [229, 228, 228, 228, 228, 228, 228, 228, 228, 228, 228, 228, 228, 228, 228, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:32:11,690 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:11,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash -708811317, now seen corresponding path program 49 times [2018-10-14 16:32:11,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 408125 backedges. 302137 proven. 17080 refuted. 0 times theorem prover too weak. 88908 trivial. 0 not checked. [2018-10-14 16:32:23,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:23,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 16:32:23,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 16:32:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 16:32:23,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=3254, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 16:32:23,134 INFO L87 Difference]: Start difference. First operand 4328 states and 4360 transitions. Second operand 62 states. [2018-10-14 16:32:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:27,884 INFO L93 Difference]: Finished difference Result 4702 states and 4731 transitions. [2018-10-14 16:32:27,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-14 16:32:27,885 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 4268 [2018-10-14 16:32:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:27,889 INFO L225 Difference]: With dead ends: 4702 [2018-10-14 16:32:27,889 INFO L226 Difference]: Without dead ends: 4702 [2018-10-14 16:32:27,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4022 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3306, Invalid=13724, Unknown=0, NotChecked=0, Total=17030 [2018-10-14 16:32:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4702 states. [2018-10-14 16:32:27,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4702 to 4523. [2018-10-14 16:32:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4523 states. [2018-10-14 16:32:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4523 states to 4523 states and 4556 transitions. [2018-10-14 16:32:27,912 INFO L78 Accepts]: Start accepts. Automaton has 4523 states and 4556 transitions. Word has length 4268 [2018-10-14 16:32:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:27,913 INFO L481 AbstractCegarLoop]: Abstraction has 4523 states and 4556 transitions. [2018-10-14 16:32:27,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 16:32:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4523 states and 4556 transitions. [2018-10-14 16:32:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4449 [2018-10-14 16:32:28,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:28,023 INFO L375 BasicCegarLoop]: trace histogram [241, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:32:28,024 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:28,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:28,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1516728615, now seen corresponding path program 50 times [2018-10-14 16:32:28,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 450551 backedges. 57 proven. 436676 refuted. 0 times theorem prover too weak. 13818 trivial. 0 not checked. [2018-10-14 16:32:44,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:44,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-14 16:32:44,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-14 16:32:44,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-14 16:32:44,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1104, Invalid=3866, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 16:32:44,036 INFO L87 Difference]: Start difference. First operand 4523 states and 4556 transitions. Second operand 71 states. [2018-10-14 16:33:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:00,245 INFO L93 Difference]: Finished difference Result 4537 states and 4566 transitions. [2018-10-14 16:33:00,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 315 states. [2018-10-14 16:33:00,246 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 4448 [2018-10-14 16:33:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:00,249 INFO L225 Difference]: With dead ends: 4537 [2018-10-14 16:33:00,249 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 16:33:00,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61577 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=30810, Invalid=115496, Unknown=0, NotChecked=0, Total=146306 [2018-10-14 16:33:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 16:33:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 16:33:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 16:33:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 16:33:00,255 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4448 [2018-10-14 16:33:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:00,256 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 16:33:00,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-14 16:33:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 16:33:00,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 16:33:00,260 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:33:00 BoogieIcfgContainer [2018-10-14 16:33:00,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 16:33:00,261 INFO L168 Benchmark]: Toolchain (without parser) took 467618.91 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -829.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-14 16:33:00,262 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:33:00,263 INFO L168 Benchmark]: Boogie Preprocessor took 59.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:33:00,263 INFO L168 Benchmark]: RCFGBuilder took 567.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-14 16:33:00,264 INFO L168 Benchmark]: TraceAbstraction took 466986.89 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -861.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-14 16:33:00,266 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 567.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 466986.89 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -861.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 144]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 73 locations, 1 error locations. SAFE Result, 466.9s OverallTime, 52 OverallIterations, 241 TraceHistogramMax, 267.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8146 SDtfs, 78669 SDslu, 135481 SDs, 0 SdLazy, 53674 SolverSat, 7230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7580 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 7473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713369 ImplicationChecksByTransitivity, 257.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4523occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 52 MinimizatonAttempts, 1852 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 64.6s InterpolantComputationTime, 83914 NumberOfCodeBlocks, 83914 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 83862 ConstructedInterpolants, 0 QuantifiedInterpolants, 619723540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 1 PerfectInterpolantSequences, 1377444/4833541 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-14_16-33-00-276.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-14_16-33-00-276.csv Received shutdown request...