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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 18:13:20,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 18:13:20,208 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 18:13:20,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 18:13:20,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 18:13:20,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 18:13:20,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 18:13:20,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 18:13:20,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 18:13:20,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 18:13:20,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 18:13:20,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 18:13:20,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 18:13:20,238 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 18:13:20,240 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 18:13:20,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 18:13:20,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 18:13:20,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 18:13:20,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 18:13:20,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 18:13:20,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 18:13:20,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 18:13:20,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 18:13:20,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 18:13:20,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 18:13:20,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 18:13:20,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 18:13:20,268 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 18:13:20,271 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 18:13:20,272 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 18:13:20,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 18:13:20,273 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 18:13:20,273 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 18:13:20,273 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 18:13:20,274 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 18:13:20,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 18:13:20,275 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 18:13:20,285 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 18:13:20,286 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 18:13:20,286 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 18:13:20,287 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 18:13:20,287 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 18:13:20,287 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 18:13:20,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 18:13:20,290 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 18:13:20,290 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 18:13:20,291 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 18:13:20,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 18:13:20,291 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 18:13:20,291 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 18:13:20,292 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 18:13:20,292 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 18:13:20,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 18:13:20,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 18:13:20,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 18:13:20,365 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 18:13:20,366 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 18:13:20,367 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl [2018-10-14 18:13:20,367 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl' [2018-10-14 18:13:20,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 18:13:20,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 18:13:20,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 18:13:20,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 18:13:20,437 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 18:13:20,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:13:20" (1/1) ... [2018-10-14 18:13:20,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:13:20" (1/1) ... [2018-10-14 18:13:20,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:13:20" (1/1) ... [2018-10-14 18:13:20,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:13:20" (1/1) ... [2018-10-14 18:13:20,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:13:20" (1/1) ... [2018-10-14 18:13:20,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:13:20" (1/1) ... [2018-10-14 18:13:20,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:13:20" (1/1) ... [2018-10-14 18:13:20,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 18:13:20,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 18:13:20,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 18:13:20,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 18:13:20,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:13:20" (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 18:13:20,578 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 18:13:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 18:13:20,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 18:13:21,073 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 18:13:21,074 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:13:21 BoogieIcfgContainer [2018-10-14 18:13:21,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 18:13:21,074 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 18:13:21,075 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 18:13:21,076 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 18:13:21,080 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:13:21" (1/1) ... [2018-10-14 18:13:21,089 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 18:13:21,089 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 18:13:21,129 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 18:13:21,212 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 18:13:21,239 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 18:13:21,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 18:13:33,651 INFO L315 AbstractInterpreter]: Visited 71 different actions 252 times. Merged at 42 different actions 172 times. Widened at 3 different actions 5 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-10-14 18:13:33,654 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 18:13:33,658 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 18:13:33,668 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:13:33,670 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_6|) |v_ULTIMATE.start_read~int_#ptr.offset_4|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:13:33,697 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_7|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-14 18:13:33,699 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 18:13:33,700 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:13:33,700 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:13:33,700 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:13:33,700 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:13:33,701 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:13:33,701 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:13:33,701 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:13:33,701 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:13:33,702 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:13:33,702 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:13:33,702 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:13:33,702 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:13:33,703 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:13:33,703 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:13:33,705 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 18:13:33,731 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:13:33 BasicIcfg [2018-10-14 18:13:33,731 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 18:13:33,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 18:13:33,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 18:13:33,736 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 18:13:33,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:13:20" (1/3) ... [2018-10-14 18:13:33,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6326568a and model type ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:13:33, skipping insertion in model container [2018-10-14 18:13:33,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:13:21" (2/3) ... [2018-10-14 18:13:33,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6326568a and model type ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:13:33, skipping insertion in model container [2018-10-14 18:13:33,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:13:33" (3/3) ... [2018-10-14 18:13:33,742 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 18:13:33,753 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 18:13:33,764 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 18:13:33,783 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 18:13:33,818 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 18:13:33,819 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 18:13:33,819 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 18:13:33,819 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 18:13:33,820 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 18:13:33,820 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 18:13:33,820 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 18:13:33,820 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 18:13:33,821 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 18:13:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-14 18:13:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-14 18:13:33,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:33,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:33,849 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:33,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1737293029, now seen corresponding path program 1 times [2018-10-14 18:13:33,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:34,548 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 18:13:34,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:13:34,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-14 18:13:34,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 18:13:34,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 18:13:34,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-14 18:13:34,574 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 6 states. [2018-10-14 18:13:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:35,530 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-10-14 18:13:35,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 18:13:35,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-10-14 18:13:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:35,544 INFO L225 Difference]: With dead ends: 127 [2018-10-14 18:13:35,545 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 18:13:35,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:13:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 18:13:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 78. [2018-10-14 18:13:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-14 18:13:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-14 18:13:35,591 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 45 [2018-10-14 18:13:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:35,592 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-14 18:13:35,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 18:13:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-14 18:13:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-14 18:13:35,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:35,594 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:35,595 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:35,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:35,595 INFO L82 PathProgramCache]: Analyzing trace with hash 415592299, now seen corresponding path program 1 times [2018-10-14 18:13:35,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 18:13:36,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:13:36,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-14 18:13:36,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 18:13:36,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 18:13:36,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:13:36,318 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 12 states. [2018-10-14 18:13:36,855 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-14 18:13:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:37,291 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-10-14 18:13:37,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 18:13:37,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-10-14 18:13:37,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:37,298 INFO L225 Difference]: With dead ends: 137 [2018-10-14 18:13:37,299 INFO L226 Difference]: Without dead ends: 137 [2018-10-14 18:13:37,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:13:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-14 18:13:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 100. [2018-10-14 18:13:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-14 18:13:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-10-14 18:13:37,310 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 60 [2018-10-14 18:13:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:37,311 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-10-14 18:13:37,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 18:13:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-10-14 18:13:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-14 18:13:37,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:37,314 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:37,314 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:37,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:37,315 INFO L82 PathProgramCache]: Analyzing trace with hash 357808003, now seen corresponding path program 1 times [2018-10-14 18:13:37,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 18:13:37,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:37,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 18:13:37,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 18:13:37,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 18:13:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 18:13:37,524 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 8 states. [2018-10-14 18:13:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:37,871 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2018-10-14 18:13:37,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 18:13:37,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2018-10-14 18:13:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:37,874 INFO L225 Difference]: With dead ends: 167 [2018-10-14 18:13:37,874 INFO L226 Difference]: Without dead ends: 167 [2018-10-14 18:13:37,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-14 18:13:37,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-14 18:13:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 118. [2018-10-14 18:13:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-14 18:13:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-10-14 18:13:37,884 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 85 [2018-10-14 18:13:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:37,885 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-10-14 18:13:37,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 18:13:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-10-14 18:13:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-14 18:13:37,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:37,889 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-14 18:13:37,889 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:37,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:37,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1932025347, now seen corresponding path program 2 times [2018-10-14 18:13:37,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 18:13:38,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:38,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 18:13:38,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 18:13:38,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 18:13:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:13:38,109 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 10 states. [2018-10-14 18:13:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:38,485 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-10-14 18:13:38,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 18:13:38,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2018-10-14 18:13:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:38,489 INFO L225 Difference]: With dead ends: 169 [2018-10-14 18:13:38,489 INFO L226 Difference]: Without dead ends: 169 [2018-10-14 18:13:38,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-10-14 18:13:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-14 18:13:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 133. [2018-10-14 18:13:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-14 18:13:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-10-14 18:13:38,499 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 100 [2018-10-14 18:13:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:38,500 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-10-14 18:13:38,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 18:13:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-10-14 18:13:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-14 18:13:38,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:38,502 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:38,502 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:38,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:38,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1851660413, now seen corresponding path program 3 times [2018-10-14 18:13:38,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 18:13:38,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:38,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 18:13:38,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 18:13:38,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 18:13:38,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:13:38,936 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 15 states. [2018-10-14 18:13:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:40,243 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2018-10-14 18:13:40,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 18:13:40,244 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-10-14 18:13:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:40,246 INFO L225 Difference]: With dead ends: 192 [2018-10-14 18:13:40,247 INFO L226 Difference]: Without dead ends: 192 [2018-10-14 18:13:40,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:13:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-14 18:13:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 155. [2018-10-14 18:13:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-14 18:13:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2018-10-14 18:13:40,259 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 115 [2018-10-14 18:13:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:40,259 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2018-10-14 18:13:40,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 18:13:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2018-10-14 18:13:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-14 18:13:40,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:40,262 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-14 18:13:40,262 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:40,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash 390990443, now seen corresponding path program 4 times [2018-10-14 18:13:40,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 17 proven. 78 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 18:13:40,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:40,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 18:13:40,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 18:13:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 18:13:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:13:40,456 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand 10 states. [2018-10-14 18:13:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:40,790 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-10-14 18:13:40,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 18:13:40,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2018-10-14 18:13:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:40,796 INFO L225 Difference]: With dead ends: 181 [2018-10-14 18:13:40,796 INFO L226 Difference]: Without dead ends: 181 [2018-10-14 18:13:40,796 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 18:13:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-14 18:13:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2018-10-14 18:13:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-14 18:13:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2018-10-14 18:13:40,804 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 140 [2018-10-14 18:13:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:40,805 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2018-10-14 18:13:40,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 18:13:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2018-10-14 18:13:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-14 18:13:40,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:40,807 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-14 18:13:40,808 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:40,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:40,808 INFO L82 PathProgramCache]: Analyzing trace with hash 590405147, now seen corresponding path program 5 times [2018-10-14 18:13:40,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 17 proven. 126 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 18:13:41,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:41,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 18:13:41,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 18:13:41,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 18:13:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:13:41,681 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 12 states. [2018-10-14 18:13:42,152 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 18:13:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:42,262 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-10-14 18:13:42,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 18:13:42,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 155 [2018-10-14 18:13:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:42,265 INFO L225 Difference]: With dead ends: 196 [2018-10-14 18:13:42,265 INFO L226 Difference]: Without dead ends: 196 [2018-10-14 18:13:42,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:13:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-14 18:13:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2018-10-14 18:13:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-14 18:13:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 174 transitions. [2018-10-14 18:13:42,273 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 174 transitions. Word has length 155 [2018-10-14 18:13:42,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:42,273 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 174 transitions. [2018-10-14 18:13:42,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 18:13:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2018-10-14 18:13:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-14 18:13:42,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:42,276 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 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 18:13:42,277 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:42,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:42,277 INFO L82 PathProgramCache]: Analyzing trace with hash -449432469, now seen corresponding path program 6 times [2018-10-14 18:13:42,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 17 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 18:13:43,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:43,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 18:13:43,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 18:13:43,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 18:13:43,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-14 18:13:43,092 INFO L87 Difference]: Start difference. First operand 171 states and 174 transitions. Second operand 14 states. [2018-10-14 18:13:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:43,738 INFO L93 Difference]: Finished difference Result 198 states and 201 transitions. [2018-10-14 18:13:43,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 18:13:43,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 170 [2018-10-14 18:13:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:43,745 INFO L225 Difference]: With dead ends: 198 [2018-10-14 18:13:43,745 INFO L226 Difference]: Without dead ends: 198 [2018-10-14 18:13:43,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-14 18:13:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-14 18:13:43,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2018-10-14 18:13:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-14 18:13:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2018-10-14 18:13:43,751 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 170 [2018-10-14 18:13:43,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:43,751 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2018-10-14 18:13:43,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 18:13:43,751 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2018-10-14 18:13:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-14 18:13:43,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:43,755 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 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 18:13:43,755 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:43,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:43,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1230015461, now seen corresponding path program 7 times [2018-10-14 18:13:43,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-14 18:13:44,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:44,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 18:13:44,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 18:13:44,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 18:13:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-14 18:13:44,405 INFO L87 Difference]: Start difference. First operand 186 states and 189 transitions. Second operand 18 states. [2018-10-14 18:13:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:45,665 INFO L93 Difference]: Finished difference Result 324 states and 329 transitions. [2018-10-14 18:13:45,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 18:13:45,667 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 185 [2018-10-14 18:13:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:45,669 INFO L225 Difference]: With dead ends: 324 [2018-10-14 18:13:45,669 INFO L226 Difference]: Without dead ends: 324 [2018-10-14 18:13:45,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 18:13:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-14 18:13:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 256. [2018-10-14 18:13:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-14 18:13:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 260 transitions. [2018-10-14 18:13:45,676 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 260 transitions. Word has length 185 [2018-10-14 18:13:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:45,676 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 260 transitions. [2018-10-14 18:13:45,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 18:13:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 260 transitions. [2018-10-14 18:13:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-14 18:13:45,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:45,680 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 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 18:13:45,681 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:45,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:45,681 INFO L82 PathProgramCache]: Analyzing trace with hash -34181453, now seen corresponding path program 8 times [2018-10-14 18:13:45,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 147 proven. 489 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-14 18:13:46,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:46,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 18:13:46,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 18:13:46,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 18:13:46,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-10-14 18:13:46,054 INFO L87 Difference]: Start difference. First operand 256 states and 260 transitions. Second operand 18 states. [2018-10-14 18:13:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:47,117 INFO L93 Difference]: Finished difference Result 283 states and 287 transitions. [2018-10-14 18:13:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 18:13:47,117 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 255 [2018-10-14 18:13:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:47,120 INFO L225 Difference]: With dead ends: 283 [2018-10-14 18:13:47,120 INFO L226 Difference]: Without dead ends: 283 [2018-10-14 18:13:47,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 18:13:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-14 18:13:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 271. [2018-10-14 18:13:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-14 18:13:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 275 transitions. [2018-10-14 18:13:47,129 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 275 transitions. Word has length 255 [2018-10-14 18:13:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:47,129 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 275 transitions. [2018-10-14 18:13:47,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 18:13:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 275 transitions. [2018-10-14 18:13:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-14 18:13:47,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:47,133 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 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 18:13:47,133 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:47,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:47,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2093326125, now seen corresponding path program 9 times [2018-10-14 18:13:47,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 681 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-10-14 18:13:47,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:47,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 18:13:47,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 18:13:47,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 18:13:47,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:13:47,794 INFO L87 Difference]: Start difference. First operand 271 states and 275 transitions. Second operand 22 states. [2018-10-14 18:13:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:49,473 INFO L93 Difference]: Finished difference Result 439 states and 445 transitions. [2018-10-14 18:13:49,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 18:13:49,474 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 270 [2018-10-14 18:13:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:49,476 INFO L225 Difference]: With dead ends: 439 [2018-10-14 18:13:49,476 INFO L226 Difference]: Without dead ends: 439 [2018-10-14 18:13:49,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=390, Invalid=1590, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 18:13:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-10-14 18:13:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 356. [2018-10-14 18:13:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-14 18:13:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 361 transitions. [2018-10-14 18:13:49,487 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 361 transitions. Word has length 270 [2018-10-14 18:13:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:49,487 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 361 transitions. [2018-10-14 18:13:49,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 18:13:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 361 transitions. [2018-10-14 18:13:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-14 18:13:49,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:49,490 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-14 18:13:49,490 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:49,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:49,492 INFO L82 PathProgramCache]: Analyzing trace with hash -700262629, now seen corresponding path program 10 times [2018-10-14 18:13:49,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:50,018 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 18:13:51,260 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-14 18:13:51,540 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 18:13:52,523 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-14 18:13:52,887 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 18:13:53,262 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 18:13:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1399 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-10-14 18:13:55,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:55,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 18:13:55,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 18:13:55,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 18:13:55,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:13:55,989 INFO L87 Difference]: Start difference. First operand 356 states and 361 transitions. Second operand 22 states. [2018-10-14 18:13:56,690 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 18:13:57,207 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-14 18:13:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:59,198 INFO L93 Difference]: Finished difference Result 524 states and 531 transitions. [2018-10-14 18:13:59,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 18:13:59,199 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 355 [2018-10-14 18:13:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:59,201 INFO L225 Difference]: With dead ends: 524 [2018-10-14 18:13:59,202 INFO L226 Difference]: Without dead ends: 524 [2018-10-14 18:13:59,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:13:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-10-14 18:13:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 441. [2018-10-14 18:13:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-10-14 18:13:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 447 transitions. [2018-10-14 18:13:59,212 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 447 transitions. Word has length 355 [2018-10-14 18:13:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:59,212 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 447 transitions. [2018-10-14 18:13:59,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 18:13:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 447 transitions. [2018-10-14 18:13:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-14 18:13:59,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:59,216 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-14 18:13:59,217 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:59,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1649073619, now seen corresponding path program 11 times [2018-10-14 18:13:59,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2390 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-10-14 18:14:00,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:00,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 18:14:00,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 18:14:00,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 18:14:00,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:14:00,676 INFO L87 Difference]: Start difference. First operand 441 states and 447 transitions. Second operand 24 states. [2018-10-14 18:14:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:03,953 INFO L93 Difference]: Finished difference Result 609 states and 617 transitions. [2018-10-14 18:14:03,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 18:14:03,955 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 440 [2018-10-14 18:14:03,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:03,960 INFO L225 Difference]: With dead ends: 609 [2018-10-14 18:14:03,960 INFO L226 Difference]: Without dead ends: 609 [2018-10-14 18:14:03,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=371, Invalid=2281, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 18:14:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-10-14 18:14:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 526. [2018-10-14 18:14:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-10-14 18:14:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 533 transitions. [2018-10-14 18:14:03,970 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 533 transitions. Word has length 440 [2018-10-14 18:14:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:03,971 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 533 transitions. [2018-10-14 18:14:03,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 18:14:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 533 transitions. [2018-10-14 18:14:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2018-10-14 18:14:03,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:03,975 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-14 18:14:03,975 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:03,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:03,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1052408347, now seen corresponding path program 12 times [2018-10-14 18:14:03,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 3654 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-10-14 18:14:05,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:05,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 18:14:05,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 18:14:05,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 18:14:05,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-10-14 18:14:05,747 INFO L87 Difference]: Start difference. First operand 526 states and 533 transitions. Second operand 26 states. [2018-10-14 18:14:07,020 WARN L179 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-10-14 18:14:09,035 WARN L179 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-10-14 18:14:11,509 WARN L179 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-14 18:14:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:11,847 INFO L93 Difference]: Finished difference Result 694 states and 703 transitions. [2018-10-14 18:14:11,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 18:14:11,847 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 525 [2018-10-14 18:14:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:11,851 INFO L225 Difference]: With dead ends: 694 [2018-10-14 18:14:11,852 INFO L226 Difference]: Without dead ends: 694 [2018-10-14 18:14:11,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=414, Invalid=2778, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 18:14:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-10-14 18:14:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 611. [2018-10-14 18:14:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-10-14 18:14:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 619 transitions. [2018-10-14 18:14:11,863 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 619 transitions. Word has length 525 [2018-10-14 18:14:11,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:11,863 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 619 transitions. [2018-10-14 18:14:11,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 18:14:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 619 transitions. [2018-10-14 18:14:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2018-10-14 18:14:11,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:11,868 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-14 18:14:11,868 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:11,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1616962861, now seen corresponding path program 13 times [2018-10-14 18:14:11,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5727 backedges. 0 proven. 5191 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2018-10-14 18:14:14,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:14,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 18:14:14,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 18:14:14,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 18:14:14,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-10-14 18:14:14,519 INFO L87 Difference]: Start difference. First operand 611 states and 619 transitions. Second operand 28 states. [2018-10-14 18:14:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:18,387 INFO L93 Difference]: Finished difference Result 779 states and 789 transitions. [2018-10-14 18:14:18,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 18:14:18,388 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 610 [2018-10-14 18:14:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:18,391 INFO L225 Difference]: With dead ends: 779 [2018-10-14 18:14:18,391 INFO L226 Difference]: Without dead ends: 779 [2018-10-14 18:14:18,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=457, Invalid=3325, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 18:14:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-14 18:14:18,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 696. [2018-10-14 18:14:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-10-14 18:14:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 705 transitions. [2018-10-14 18:14:18,404 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 705 transitions. Word has length 610 [2018-10-14 18:14:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:18,405 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 705 transitions. [2018-10-14 18:14:18,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 18:14:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 705 transitions. [2018-10-14 18:14:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2018-10-14 18:14:18,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:18,411 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-14 18:14:18,411 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:18,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1791384859, now seen corresponding path program 14 times [2018-10-14 18:14:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:19,054 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 18:14:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7631 backedges. 0 proven. 7001 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-10-14 18:14:21,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:21,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 18:14:21,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 18:14:21,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 18:14:21,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-10-14 18:14:21,218 INFO L87 Difference]: Start difference. First operand 696 states and 705 transitions. Second operand 30 states. [2018-10-14 18:14:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:25,744 INFO L93 Difference]: Finished difference Result 864 states and 875 transitions. [2018-10-14 18:14:25,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 18:14:25,745 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 695 [2018-10-14 18:14:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:25,750 INFO L225 Difference]: With dead ends: 864 [2018-10-14 18:14:25,750 INFO L226 Difference]: Without dead ends: 864 [2018-10-14 18:14:25,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=500, Invalid=3922, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:14:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-10-14 18:14:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 781. [2018-10-14 18:14:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-10-14 18:14:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 791 transitions. [2018-10-14 18:14:25,764 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 791 transitions. Word has length 695 [2018-10-14 18:14:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:25,765 INFO L481 AbstractCegarLoop]: Abstraction has 781 states and 791 transitions. [2018-10-14 18:14:25,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 18:14:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 791 transitions. [2018-10-14 18:14:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-10-14 18:14:25,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:25,772 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2018-10-14 18:14:25,773 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:25,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:25,773 INFO L82 PathProgramCache]: Analyzing trace with hash -830007341, now seen corresponding path program 15 times [2018-10-14 18:14:25,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9808 backedges. 0 proven. 9084 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2018-10-14 18:14:29,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:29,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 18:14:29,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 18:14:29,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 18:14:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2018-10-14 18:14:29,479 INFO L87 Difference]: Start difference. First operand 781 states and 791 transitions. Second operand 32 states. [2018-10-14 18:14:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:34,688 INFO L93 Difference]: Finished difference Result 949 states and 961 transitions. [2018-10-14 18:14:34,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 18:14:34,689 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 780 [2018-10-14 18:14:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:34,692 INFO L225 Difference]: With dead ends: 949 [2018-10-14 18:14:34,692 INFO L226 Difference]: Without dead ends: 949 [2018-10-14 18:14:34,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=543, Invalid=4569, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 18:14:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-10-14 18:14:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 866. [2018-10-14 18:14:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-10-14 18:14:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 877 transitions. [2018-10-14 18:14:34,705 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 877 transitions. Word has length 780 [2018-10-14 18:14:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:34,705 INFO L481 AbstractCegarLoop]: Abstraction has 866 states and 877 transitions. [2018-10-14 18:14:34,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 18:14:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 877 transitions. [2018-10-14 18:14:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2018-10-14 18:14:34,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:34,713 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2018-10-14 18:14:34,713 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:34,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2031517723, now seen corresponding path program 16 times [2018-10-14 18:14:34,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:35,409 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 18:14:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12258 backedges. 0 proven. 11440 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2018-10-14 18:14:38,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:38,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 18:14:38,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 18:14:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 18:14:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 18:14:38,644 INFO L87 Difference]: Start difference. First operand 866 states and 877 transitions. Second operand 34 states. [2018-10-14 18:14:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:44,372 INFO L93 Difference]: Finished difference Result 1034 states and 1047 transitions. [2018-10-14 18:14:44,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 18:14:44,372 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 865 [2018-10-14 18:14:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:44,377 INFO L225 Difference]: With dead ends: 1034 [2018-10-14 18:14:44,377 INFO L226 Difference]: Without dead ends: 1034 [2018-10-14 18:14:44,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=586, Invalid=5266, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 18:14:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2018-10-14 18:14:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 951. [2018-10-14 18:14:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-10-14 18:14:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 963 transitions. [2018-10-14 18:14:44,391 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 963 transitions. Word has length 865 [2018-10-14 18:14:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:44,392 INFO L481 AbstractCegarLoop]: Abstraction has 951 states and 963 transitions. [2018-10-14 18:14:44,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 18:14:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 963 transitions. [2018-10-14 18:14:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2018-10-14 18:14:44,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:44,401 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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] [2018-10-14 18:14:44,401 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:44,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:44,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1582486739, now seen corresponding path program 17 times [2018-10-14 18:14:44,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14981 backedges. 10489 proven. 2008 refuted. 0 times theorem prover too weak. 2484 trivial. 0 not checked. [2018-10-14 18:14:45,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:45,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 18:14:45,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 18:14:45,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 18:14:45,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-10-14 18:14:45,704 INFO L87 Difference]: Start difference. First operand 951 states and 963 transitions. Second operand 28 states. [2018-10-14 18:14:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:47,048 INFO L93 Difference]: Finished difference Result 1091 states and 1103 transitions. [2018-10-14 18:14:47,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 18:14:47,048 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 950 [2018-10-14 18:14:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:47,052 INFO L225 Difference]: With dead ends: 1091 [2018-10-14 18:14:47,052 INFO L226 Difference]: Without dead ends: 1091 [2018-10-14 18:14:47,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=638, Invalid=2668, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 18:14:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2018-10-14 18:14:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1026. [2018-10-14 18:14:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-10-14 18:14:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1038 transitions. [2018-10-14 18:14:47,065 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1038 transitions. Word has length 950 [2018-10-14 18:14:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:47,065 INFO L481 AbstractCegarLoop]: Abstraction has 1026 states and 1038 transitions. [2018-10-14 18:14:47,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 18:14:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1038 transitions. [2018-10-14 18:14:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2018-10-14 18:14:47,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:47,075 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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] [2018-10-14 18:14:47,075 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:47,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1950084333, now seen corresponding path program 18 times [2018-10-14 18:14:47,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18341 backedges. 0 proven. 17124 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2018-10-14 18:14:51,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:51,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 18:14:51,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 18:14:51,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 18:14:51,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 18:14:51,906 INFO L87 Difference]: Start difference. First operand 1026 states and 1038 transitions. Second operand 36 states. [2018-10-14 18:14:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:58,775 INFO L93 Difference]: Finished difference Result 1224 states and 1238 transitions. [2018-10-14 18:14:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 18:14:58,775 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1025 [2018-10-14 18:14:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:58,780 INFO L225 Difference]: With dead ends: 1224 [2018-10-14 18:14:58,780 INFO L226 Difference]: Without dead ends: 1224 [2018-10-14 18:14:58,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=629, Invalid=6013, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 18:14:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2018-10-14 18:14:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1126. [2018-10-14 18:14:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2018-10-14 18:14:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1139 transitions. [2018-10-14 18:14:58,795 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1139 transitions. Word has length 1025 [2018-10-14 18:14:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:58,796 INFO L481 AbstractCegarLoop]: Abstraction has 1126 states and 1139 transitions. [2018-10-14 18:14:58,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 18:14:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1139 transitions. [2018-10-14 18:14:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1126 [2018-10-14 18:14:58,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:58,808 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-14 18:14:58,808 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:58,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash -64049749, now seen corresponding path program 19 times [2018-10-14 18:14:58,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:15:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 22420 backedges. 0 proven. 21048 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2018-10-14 18:15:04,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:15:04,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 18:15:04,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 18:15:04,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 18:15:04,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 18:15:04,527 INFO L87 Difference]: Start difference. First operand 1126 states and 1139 transitions. Second operand 38 states. [2018-10-14 18:15:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:15:12,089 INFO L93 Difference]: Finished difference Result 1324 states and 1339 transitions. [2018-10-14 18:15:12,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 18:15:12,090 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1125 [2018-10-14 18:15:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:15:12,094 INFO L225 Difference]: With dead ends: 1324 [2018-10-14 18:15:12,094 INFO L226 Difference]: Without dead ends: 1324 [2018-10-14 18:15:12,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=672, Invalid=6810, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:15:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2018-10-14 18:15:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1226. [2018-10-14 18:15:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-10-14 18:15:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1240 transitions. [2018-10-14 18:15:12,110 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1240 transitions. Word has length 1125 [2018-10-14 18:15:12,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:15:12,111 INFO L481 AbstractCegarLoop]: Abstraction has 1226 states and 1240 transitions. [2018-10-14 18:15:12,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 18:15:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1240 transitions. [2018-10-14 18:15:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1226 [2018-10-14 18:15:12,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:15:12,125 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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] [2018-10-14 18:15:12,125 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:15:12,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:15:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1505303619, now seen corresponding path program 20 times [2018-10-14 18:15:12,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:15:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:15:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 26909 backedges. 0 proven. 25382 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2018-10-14 18:15:18,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:15:18,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 18:15:18,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 18:15:18,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 18:15:18,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 18:15:18,897 INFO L87 Difference]: Start difference. First operand 1226 states and 1240 transitions. Second operand 40 states. [2018-10-14 18:15:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:15:27,347 INFO L93 Difference]: Finished difference Result 1424 states and 1440 transitions. [2018-10-14 18:15:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 18:15:27,349 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1225 [2018-10-14 18:15:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:15:27,354 INFO L225 Difference]: With dead ends: 1424 [2018-10-14 18:15:27,354 INFO L226 Difference]: Without dead ends: 1424 [2018-10-14 18:15:27,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=715, Invalid=7657, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 18:15:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2018-10-14 18:15:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1326. [2018-10-14 18:15:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2018-10-14 18:15:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1341 transitions. [2018-10-14 18:15:27,367 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1341 transitions. Word has length 1225 [2018-10-14 18:15:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:15:27,368 INFO L481 AbstractCegarLoop]: Abstraction has 1326 states and 1341 transitions. [2018-10-14 18:15:27,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 18:15:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1341 transitions. [2018-10-14 18:15:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1326 [2018-10-14 18:15:27,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:15:27,383 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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] [2018-10-14 18:15:27,383 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:15:27,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:15:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1553375525, now seen corresponding path program 21 times [2018-10-14 18:15:27,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:15:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:15:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 31808 backedges. 0 proven. 30126 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-10-14 18:15:34,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:15:34,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 18:15:34,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 18:15:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 18:15:34,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1604, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 18:15:34,383 INFO L87 Difference]: Start difference. First operand 1326 states and 1341 transitions. Second operand 42 states. [2018-10-14 18:15:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:15:44,212 INFO L93 Difference]: Finished difference Result 1524 states and 1541 transitions. [2018-10-14 18:15:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 18:15:44,212 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1325 [2018-10-14 18:15:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:15:44,216 INFO L225 Difference]: With dead ends: 1524 [2018-10-14 18:15:44,217 INFO L226 Difference]: Without dead ends: 1524 [2018-10-14 18:15:44,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=758, Invalid=8554, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 18:15:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2018-10-14 18:15:44,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1426. [2018-10-14 18:15:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1426 states. [2018-10-14 18:15:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1442 transitions. [2018-10-14 18:15:44,230 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1442 transitions. Word has length 1325 [2018-10-14 18:15:44,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:15:44,231 INFO L481 AbstractCegarLoop]: Abstraction has 1426 states and 1442 transitions. [2018-10-14 18:15:44,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 18:15:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1442 transitions. [2018-10-14 18:15:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1426 [2018-10-14 18:15:44,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:15:44,247 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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] [2018-10-14 18:15:44,247 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:15:44,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:15:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash 491091315, now seen corresponding path program 22 times [2018-10-14 18:15:44,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:15:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:15:45,137 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 18:15:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 37117 backedges. 0 proven. 35280 refuted. 0 times theorem prover too weak. 1837 trivial. 0 not checked. [2018-10-14 18:15:52,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:15:52,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 18:15:52,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 18:15:52,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 18:15:52,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:15:52,655 INFO L87 Difference]: Start difference. First operand 1426 states and 1442 transitions. Second operand 44 states. [2018-10-14 18:16:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:16:03,005 INFO L93 Difference]: Finished difference Result 1624 states and 1642 transitions. [2018-10-14 18:16:03,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 18:16:03,005 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1425 [2018-10-14 18:16:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:16:03,010 INFO L225 Difference]: With dead ends: 1624 [2018-10-14 18:16:03,010 INFO L226 Difference]: Without dead ends: 1624 [2018-10-14 18:16:03,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=801, Invalid=9501, Unknown=0, NotChecked=0, Total=10302 [2018-10-14 18:16:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2018-10-14 18:16:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1526. [2018-10-14 18:16:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1526 states. [2018-10-14 18:16:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1543 transitions. [2018-10-14 18:16:03,024 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1543 transitions. Word has length 1425 [2018-10-14 18:16:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:16:03,025 INFO L481 AbstractCegarLoop]: Abstraction has 1526 states and 1543 transitions. [2018-10-14 18:16:03,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 18:16:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1543 transitions. [2018-10-14 18:16:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1526 [2018-10-14 18:16:03,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:16:03,045 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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] [2018-10-14 18:16:03,045 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:16:03,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:16:03,046 INFO L82 PathProgramCache]: Analyzing trace with hash -799842293, now seen corresponding path program 23 times [2018-10-14 18:16:03,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:16:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:16:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 42836 backedges. 0 proven. 40844 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2018-10-14 18:16:12,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:16:12,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 18:16:12,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 18:16:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 18:16:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 18:16:12,354 INFO L87 Difference]: Start difference. First operand 1526 states and 1543 transitions. Second operand 46 states. [2018-10-14 18:16:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:16:24,149 INFO L93 Difference]: Finished difference Result 1724 states and 1743 transitions. [2018-10-14 18:16:24,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-14 18:16:24,150 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1525 [2018-10-14 18:16:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:16:24,155 INFO L225 Difference]: With dead ends: 1724 [2018-10-14 18:16:24,155 INFO L226 Difference]: Without dead ends: 1724 [2018-10-14 18:16:24,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2174 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=844, Invalid=10498, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 18:16:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2018-10-14 18:16:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1626. [2018-10-14 18:16:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2018-10-14 18:16:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 1644 transitions. [2018-10-14 18:16:24,173 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 1644 transitions. Word has length 1525 [2018-10-14 18:16:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:16:24,174 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 1644 transitions. [2018-10-14 18:16:24,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 18:16:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 1644 transitions. [2018-10-14 18:16:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1626 [2018-10-14 18:16:24,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:16:24,198 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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] [2018-10-14 18:16:24,198 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:16:24,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:16:24,199 INFO L82 PathProgramCache]: Analyzing trace with hash 177807011, now seen corresponding path program 24 times [2018-10-14 18:16:24,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:16:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:16:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 48965 backedges. 0 proven. 46818 refuted. 0 times theorem prover too weak. 2147 trivial. 0 not checked. [2018-10-14 18:16:34,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:16:34,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 18:16:34,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 18:16:34,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 18:16:34,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 18:16:34,156 INFO L87 Difference]: Start difference. First operand 1626 states and 1644 transitions. Second operand 48 states. [2018-10-14 18:16:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:16:46,835 INFO L93 Difference]: Finished difference Result 1824 states and 1844 transitions. [2018-10-14 18:16:46,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 18:16:46,836 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1625 [2018-10-14 18:16:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:16:46,843 INFO L225 Difference]: With dead ends: 1824 [2018-10-14 18:16:46,843 INFO L226 Difference]: Without dead ends: 1824 [2018-10-14 18:16:46,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=887, Invalid=11545, Unknown=0, NotChecked=0, Total=12432 [2018-10-14 18:16:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2018-10-14 18:16:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1726. [2018-10-14 18:16:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-10-14 18:16:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 1745 transitions. [2018-10-14 18:16:46,861 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 1745 transitions. Word has length 1625 [2018-10-14 18:16:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:16:46,862 INFO L481 AbstractCegarLoop]: Abstraction has 1726 states and 1745 transitions. [2018-10-14 18:16:46,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 18:16:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 1745 transitions. [2018-10-14 18:16:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1726 [2018-10-14 18:16:46,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:16:46,884 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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] [2018-10-14 18:16:46,884 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:16:46,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:16:46,885 INFO L82 PathProgramCache]: Analyzing trace with hash -551767749, now seen corresponding path program 25 times [2018-10-14 18:16:46,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:16:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:16:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 55504 backedges. 20819 proven. 1318 refuted. 0 times theorem prover too weak. 33367 trivial. 0 not checked. [2018-10-14 18:16:49,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:16:49,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 18:16:49,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 18:16:49,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 18:16:49,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:16:49,138 INFO L87 Difference]: Start difference. First operand 1726 states and 1745 transitions. Second operand 24 states. [2018-10-14 18:16:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:16:50,065 INFO L93 Difference]: Finished difference Result 1938 states and 1957 transitions. [2018-10-14 18:16:50,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 18:16:50,065 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1725 [2018-10-14 18:16:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:16:50,070 INFO L225 Difference]: With dead ends: 1938 [2018-10-14 18:16:50,070 INFO L226 Difference]: Without dead ends: 1938 [2018-10-14 18:16:50,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=480, Invalid=1970, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 18:16:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2018-10-14 18:16:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1756. [2018-10-14 18:16:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1756 states. [2018-10-14 18:16:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 1775 transitions. [2018-10-14 18:16:50,083 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 1775 transitions. Word has length 1725 [2018-10-14 18:16:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:16:50,084 INFO L481 AbstractCegarLoop]: Abstraction has 1756 states and 1775 transitions. [2018-10-14 18:16:50,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 18:16:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 1775 transitions. [2018-10-14 18:16:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1756 [2018-10-14 18:16:50,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:16:50,105 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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] [2018-10-14 18:16:50,105 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:16:50,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:16:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash -851792021, now seen corresponding path program 26 times [2018-10-14 18:16:50,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:16:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:16:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 58017 backedges. 22083 proven. 1594 refuted. 0 times theorem prover too weak. 34340 trivial. 0 not checked. [2018-10-14 18:16:52,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:16:52,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 18:16:52,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 18:16:52,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 18:16:52,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-14 18:16:52,509 INFO L87 Difference]: Start difference. First operand 1756 states and 1775 transitions. Second operand 26 states. [2018-10-14 18:16:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:16:53,982 INFO L93 Difference]: Finished difference Result 1966 states and 1985 transitions. [2018-10-14 18:16:53,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 18:16:53,982 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1755 [2018-10-14 18:16:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:16:53,988 INFO L225 Difference]: With dead ends: 1966 [2018-10-14 18:16:53,988 INFO L226 Difference]: Without dead ends: 1966 [2018-10-14 18:16:53,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=682, Invalid=2858, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 18:16:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2018-10-14 18:16:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1966. [2018-10-14 18:16:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2018-10-14 18:16:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 1985 transitions. [2018-10-14 18:16:54,003 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 1985 transitions. Word has length 1755 [2018-10-14 18:16:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:16:54,003 INFO L481 AbstractCegarLoop]: Abstraction has 1966 states and 1985 transitions. [2018-10-14 18:16:54,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 18:16:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 1985 transitions. [2018-10-14 18:16:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1966 [2018-10-14 18:16:54,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:16:54,028 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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] [2018-10-14 18:16:54,028 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:16:54,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:16:54,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1802810853, now seen corresponding path program 27 times [2018-10-14 18:16:54,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:16:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:17:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 77288 backedges. 0 proven. 73800 refuted. 0 times theorem prover too weak. 3488 trivial. 0 not checked. [2018-10-14 18:17:08,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:17:08,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 18:17:08,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 18:17:08,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 18:17:08,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2308, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 18:17:08,009 INFO L87 Difference]: Start difference. First operand 1966 states and 1985 transitions. Second operand 50 states. [2018-10-14 18:17:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:17:22,019 INFO L93 Difference]: Finished difference Result 2194 states and 2215 transitions. [2018-10-14 18:17:22,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-14 18:17:22,020 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1965 [2018-10-14 18:17:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:17:22,026 INFO L225 Difference]: With dead ends: 2194 [2018-10-14 18:17:22,026 INFO L226 Difference]: Without dead ends: 2194 [2018-10-14 18:17:22,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2593 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=930, Invalid=12642, Unknown=0, NotChecked=0, Total=13572 [2018-10-14 18:17:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2018-10-14 18:17:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2081. [2018-10-14 18:17:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-10-14 18:17:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2101 transitions. [2018-10-14 18:17:22,043 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2101 transitions. Word has length 1965 [2018-10-14 18:17:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:17:22,044 INFO L481 AbstractCegarLoop]: Abstraction has 2081 states and 2101 transitions. [2018-10-14 18:17:22,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 18:17:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2101 transitions. [2018-10-14 18:17:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2081 [2018-10-14 18:17:22,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:17:22,067 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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] [2018-10-14 18:17:22,067 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:17:22,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:17:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1224330963, now seen corresponding path program 28 times [2018-10-14 18:17:22,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:17:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:17:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 87018 backedges. 0 proven. 83299 refuted. 0 times theorem prover too weak. 3719 trivial. 0 not checked. [2018-10-14 18:17:37,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:17:37,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 18:17:37,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 18:17:37,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 18:17:37,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2504, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 18:17:37,271 INFO L87 Difference]: Start difference. First operand 2081 states and 2101 transitions. Second operand 52 states. [2018-10-14 18:17:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:17:52,736 INFO L93 Difference]: Finished difference Result 2309 states and 2331 transitions. [2018-10-14 18:17:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-14 18:17:52,737 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2080 [2018-10-14 18:17:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:17:52,743 INFO L225 Difference]: With dead ends: 2309 [2018-10-14 18:17:52,744 INFO L226 Difference]: Without dead ends: 2309 [2018-10-14 18:17:52,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2816 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=973, Invalid=13789, Unknown=0, NotChecked=0, Total=14762 [2018-10-14 18:17:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-10-14 18:17:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2196. [2018-10-14 18:17:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2018-10-14 18:17:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 2217 transitions. [2018-10-14 18:17:52,766 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 2217 transitions. Word has length 2080 [2018-10-14 18:17:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:17:52,767 INFO L481 AbstractCegarLoop]: Abstraction has 2196 states and 2217 transitions. [2018-10-14 18:17:52,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 18:17:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2217 transitions. [2018-10-14 18:17:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2196 [2018-10-14 18:17:52,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:17:52,802 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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] [2018-10-14 18:17:52,802 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:17:52,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:17:52,803 INFO L82 PathProgramCache]: Analyzing trace with hash 594378523, now seen corresponding path program 29 times [2018-10-14 18:17:52,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:17:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:18:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 97325 backedges. 0 proven. 93375 refuted. 0 times theorem prover too weak. 3950 trivial. 0 not checked. [2018-10-14 18:18:09,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:18:09,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 18:18:09,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 18:18:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 18:18:09,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2708, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 18:18:09,480 INFO L87 Difference]: Start difference. First operand 2196 states and 2217 transitions. Second operand 54 states. [2018-10-14 18:18:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:18:26,225 INFO L93 Difference]: Finished difference Result 2424 states and 2447 transitions. [2018-10-14 18:18:26,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-14 18:18:26,226 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2195 [2018-10-14 18:18:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:18:26,234 INFO L225 Difference]: With dead ends: 2424 [2018-10-14 18:18:26,234 INFO L226 Difference]: Without dead ends: 2424 [2018-10-14 18:18:26,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1016, Invalid=14986, Unknown=0, NotChecked=0, Total=16002 [2018-10-14 18:18:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2018-10-14 18:18:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2311. [2018-10-14 18:18:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2018-10-14 18:18:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 2333 transitions. [2018-10-14 18:18:26,252 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 2333 transitions. Word has length 2195 [2018-10-14 18:18:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:18:26,253 INFO L481 AbstractCegarLoop]: Abstraction has 2311 states and 2333 transitions. [2018-10-14 18:18:26,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 18:18:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2333 transitions. [2018-10-14 18:18:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2311 [2018-10-14 18:18:26,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:18:26,283 INFO L375 BasicCegarLoop]: trace histogram [116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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] [2018-10-14 18:18:26,283 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:18:26,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:18:26,284 INFO L82 PathProgramCache]: Analyzing trace with hash -403342893, now seen corresponding path program 30 times [2018-10-14 18:18:26,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:18:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:18:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 108209 backedges. 0 proven. 104028 refuted. 0 times theorem prover too weak. 4181 trivial. 0 not checked. [2018-10-14 18:18:45,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:18:45,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 18:18:45,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 18:18:45,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 18:18:45,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2920, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 18:18:45,098 INFO L87 Difference]: Start difference. First operand 2311 states and 2333 transitions. Second operand 56 states. [2018-10-14 18:19:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:19:03,363 INFO L93 Difference]: Finished difference Result 2539 states and 2563 transitions. [2018-10-14 18:19:03,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 18:19:03,363 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2310 [2018-10-14 18:19:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:19:03,368 INFO L225 Difference]: With dead ends: 2539 [2018-10-14 18:19:03,368 INFO L226 Difference]: Without dead ends: 2539 [2018-10-14 18:19:03,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1059, Invalid=16233, Unknown=0, NotChecked=0, Total=17292 [2018-10-14 18:19:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2018-10-14 18:19:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2426. [2018-10-14 18:19:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2018-10-14 18:19:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 2449 transitions. [2018-10-14 18:19:03,390 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 2449 transitions. Word has length 2310 [2018-10-14 18:19:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:19:03,391 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 2449 transitions. [2018-10-14 18:19:03,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 18:19:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2449 transitions. [2018-10-14 18:19:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2426 [2018-10-14 18:19:03,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:19:03,424 INFO L375 BasicCegarLoop]: trace histogram [122, 122, 122, 122, 122, 122, 122, 122, 122, 122, 122, 122, 122, 122, 122, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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] [2018-10-14 18:19:03,425 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:19:03,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:19:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1099428891, now seen corresponding path program 31 times [2018-10-14 18:19:03,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:19:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:19:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 119670 backedges. 0 proven. 115258 refuted. 0 times theorem prover too weak. 4412 trivial. 0 not checked. [2018-10-14 18:19:23,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:19:23,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 18:19:23,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 18:19:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 18:19:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=3140, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 18:19:23,774 INFO L87 Difference]: Start difference. First operand 2426 states and 2449 transitions. Second operand 58 states. [2018-10-14 18:19:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:19:43,519 INFO L93 Difference]: Finished difference Result 2654 states and 2679 transitions. [2018-10-14 18:19:43,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-14 18:19:43,520 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2425 [2018-10-14 18:19:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:19:43,524 INFO L225 Difference]: With dead ends: 2654 [2018-10-14 18:19:43,524 INFO L226 Difference]: Without dead ends: 2654 [2018-10-14 18:19:43,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3539 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1102, Invalid=17530, Unknown=0, NotChecked=0, Total=18632 [2018-10-14 18:19:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2018-10-14 18:19:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2541. [2018-10-14 18:19:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2018-10-14 18:19:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 2565 transitions. [2018-10-14 18:19:43,546 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 2565 transitions. Word has length 2425 [2018-10-14 18:19:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:19:43,547 INFO L481 AbstractCegarLoop]: Abstraction has 2541 states and 2565 transitions. [2018-10-14 18:19:43,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 18:19:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 2565 transitions. [2018-10-14 18:19:43,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2541 [2018-10-14 18:19:43,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:19:43,581 INFO L375 BasicCegarLoop]: trace histogram [128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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] [2018-10-14 18:19:43,581 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:19:43,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:19:43,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1521425197, now seen corresponding path program 32 times [2018-10-14 18:19:43,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:19:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:20:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 131708 backedges. 0 proven. 127065 refuted. 0 times theorem prover too weak. 4643 trivial. 0 not checked. [2018-10-14 18:20:06,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:20:06,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 18:20:06,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 18:20:06,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 18:20:06,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3368, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 18:20:06,095 INFO L87 Difference]: Start difference. First operand 2541 states and 2565 transitions. Second operand 60 states. [2018-10-14 18:20:06,392 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 18:20:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:20:28,232 INFO L93 Difference]: Finished difference Result 2769 states and 2795 transitions. [2018-10-14 18:20:28,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-14 18:20:28,232 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2540 [2018-10-14 18:20:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:20:28,236 INFO L225 Difference]: With dead ends: 2769 [2018-10-14 18:20:28,236 INFO L226 Difference]: Without dead ends: 2769 [2018-10-14 18:20:28,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3798 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1145, Invalid=18877, Unknown=0, NotChecked=0, Total=20022 [2018-10-14 18:20:28,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2018-10-14 18:20:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 2656. [2018-10-14 18:20:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2018-10-14 18:20:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 2681 transitions. [2018-10-14 18:20:28,260 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 2681 transitions. Word has length 2540 [2018-10-14 18:20:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:20:28,262 INFO L481 AbstractCegarLoop]: Abstraction has 2656 states and 2681 transitions. [2018-10-14 18:20:28,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 18:20:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 2681 transitions. [2018-10-14 18:20:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2656 [2018-10-14 18:20:28,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:20:28,320 INFO L375 BasicCegarLoop]: trace histogram [134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 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] [2018-10-14 18:20:28,321 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:20:28,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:20:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash -592795365, now seen corresponding path program 33 times [2018-10-14 18:20:28,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:20:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:20:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 144323 backedges. 0 proven. 139449 refuted. 0 times theorem prover too weak. 4874 trivial. 0 not checked. [2018-10-14 18:20:52,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:20:52,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 18:20:52,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 18:20:52,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 18:20:52,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3604, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 18:20:52,822 INFO L87 Difference]: Start difference. First operand 2656 states and 2681 transitions. Second operand 62 states. [2018-10-14 18:21:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:21:18,249 INFO L93 Difference]: Finished difference Result 2884 states and 2911 transitions. [2018-10-14 18:21:18,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-14 18:21:18,249 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 2655 [2018-10-14 18:21:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:21:18,255 INFO L225 Difference]: With dead ends: 2884 [2018-10-14 18:21:18,255 INFO L226 Difference]: Without dead ends: 2884 [2018-10-14 18:21:18,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4066 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1188, Invalid=20274, Unknown=0, NotChecked=0, Total=21462 [2018-10-14 18:21:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2018-10-14 18:21:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2771. [2018-10-14 18:21:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2771 states. [2018-10-14 18:21:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 2797 transitions. [2018-10-14 18:21:18,281 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 2797 transitions. Word has length 2655 [2018-10-14 18:21:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:21:18,282 INFO L481 AbstractCegarLoop]: Abstraction has 2771 states and 2797 transitions. [2018-10-14 18:21:18,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 18:21:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 2797 transitions. [2018-10-14 18:21:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2771 [2018-10-14 18:21:18,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:21:18,343 INFO L375 BasicCegarLoop]: trace histogram [140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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] [2018-10-14 18:21:18,343 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:21:18,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:21:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1631326163, now seen corresponding path program 34 times [2018-10-14 18:21:18,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:21:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:21:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 157515 backedges. 0 proven. 152410 refuted. 0 times theorem prover too weak. 5105 trivial. 0 not checked. [2018-10-14 18:21:44,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:21:44,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 18:21:44,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 18:21:44,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 18:21:44,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3848, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 18:21:44,272 INFO L87 Difference]: Start difference. First operand 2771 states and 2797 transitions. Second operand 64 states.