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/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:21:51,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:21:51,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:21:51,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:21:51,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:21:51,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:21:51,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:21:51,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:21:51,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:21:51,337 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:21:51,338 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:21:51,339 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:21:51,340 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:21:51,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:21:51,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:21:51,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:21:51,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:21:51,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:21:51,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:21:51,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:21:51,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:21:51,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:21:51,355 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:21:51,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:21:51,355 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:21:51,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:21:51,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:21:51,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:21:51,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:21:51,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:21:51,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:21:51,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:21:51,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:21:51,361 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:21:51,362 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:21:51,363 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:21:51,363 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-10 16:21:51,372 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:21:51,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:21:51,373 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:21:51,374 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:21:51,374 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:21:51,374 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:21:51,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:21:51,375 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:21:51,375 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:21:51,375 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:21:51,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:21:51,376 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:21:51,376 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:21:51,377 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:21:51,377 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:21:51,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:21:51,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:21:51,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:21:51,458 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:21:51,458 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:21:51,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl [2018-10-10 16:21:51,459 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl' [2018-10-10 16:21:51,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:21:51,530 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:21:51,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:21:51,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:21:51,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:21:51,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:51" (1/1) ... [2018-10-10 16:21:51,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:51" (1/1) ... [2018-10-10 16:21:51,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:51" (1/1) ... [2018-10-10 16:21:51,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:51" (1/1) ... [2018-10-10 16:21:51,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:51" (1/1) ... [2018-10-10 16:21:51,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:51" (1/1) ... [2018-10-10 16:21:51,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:51" (1/1) ... [2018-10-10 16:21:51,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:21:51,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:21:51,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:21:51,590 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:21:51,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:51" (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-10 16:21:51,666 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:21:51,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:21:51,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:21:52,329 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:21:52,330 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:21:52 BoogieIcfgContainer [2018-10-10 16:21:52,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:21:52,331 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:21:52,332 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:21:52,333 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:21:52,336 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:21:52" (1/1) ... [2018-10-10 16:21:52,343 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:21:52,344 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:21:52,385 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:21:52,431 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:21:52,452 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:21:52,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:22:05,356 INFO L315 AbstractInterpreter]: Visited 74 different actions 263 times. Merged at 43 different actions 179 times. Widened at 4 different actions 7 times. Found 7 fixpoints after 3 different actions. Largest state had 0 variables. [2018-10-10 16:22:05,361 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:22:05,366 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:22:05,397 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_6|) 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-10 16:22:05,401 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-10 16:22:05,401 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-10 16:22:05,403 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:22:05,404 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:05,404 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:05,404 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:05,405 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:05,405 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:05,405 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:05,406 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:05,406 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:05,406 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:05,406 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:05,406 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:05,407 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:05,407 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:05,409 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:05,411 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:22:05,443 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:05 BasicIcfg [2018-10-10 16:22:05,443 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:22:05,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:22:05,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:22:05,450 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:22:05,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:51" (1/3) ... [2018-10-10 16:22:05,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70264d58 and model type ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:22:05, skipping insertion in model container [2018-10-10 16:22:05,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:21:52" (2/3) ... [2018-10-10 16:22:05,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70264d58 and model type ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:22:05, skipping insertion in model container [2018-10-10 16:22:05,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:05" (3/3) ... [2018-10-10 16:22:05,454 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:22:05,465 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:22:05,476 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:22:05,495 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:22:05,531 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:22:05,532 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:22:05,534 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:22:05,534 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:22:05,534 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:22:05,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:22:05,535 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:22:05,535 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:22:05,535 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:22:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-10-10 16:22:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-10 16:22:05,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:05,565 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:05,566 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:05,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:05,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1562935015, now seen corresponding path program 1 times [2018-10-10 16:22:05,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:05,946 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-10 16:22:05,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:22:05,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 16:22:05,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 16:22:05,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 16:22:05,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:22:05,966 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 6 states. [2018-10-10 16:22:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:06,231 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-10-10 16:22:06,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 16:22:06,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-10-10 16:22:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:06,307 INFO L225 Difference]: With dead ends: 102 [2018-10-10 16:22:06,308 INFO L226 Difference]: Without dead ends: 102 [2018-10-10 16:22:06,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-10 16:22:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2018-10-10 16:22:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-10 16:22:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-10-10 16:22:06,358 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 42 [2018-10-10 16:22:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:06,359 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-10-10 16:22:06,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 16:22:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-10-10 16:22:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-10 16:22:06,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:06,362 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:06,362 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:06,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:06,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1068170846, now seen corresponding path program 1 times [2018-10-10 16:22:06,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:22:06,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:06,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 16:22:06,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:22:06,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:22:06,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:22:06,711 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 9 states. [2018-10-10 16:22:07,217 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:22:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:07,934 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2018-10-10 16:22:07,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:22:07,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-10-10 16:22:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:07,939 INFO L225 Difference]: With dead ends: 210 [2018-10-10 16:22:07,939 INFO L226 Difference]: Without dead ends: 210 [2018-10-10 16:22:07,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:22:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-10 16:22:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 84. [2018-10-10 16:22:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-10 16:22:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-10-10 16:22:07,951 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 68 [2018-10-10 16:22:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:07,952 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-10-10 16:22:07,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:22:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-10-10 16:22:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-10 16:22:07,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:07,954 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:07,954 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:07,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:07,955 INFO L82 PathProgramCache]: Analyzing trace with hash 767372902, now seen corresponding path program 1 times [2018-10-10 16:22:07,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:22:08,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:08,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:08,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:08,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:08,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:08,223 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 10 states. [2018-10-10 16:22:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:08,953 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-10-10 16:22:08,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:22:08,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-10-10 16:22:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:08,957 INFO L225 Difference]: With dead ends: 165 [2018-10-10 16:22:08,957 INFO L226 Difference]: Without dead ends: 165 [2018-10-10 16:22:08,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:22:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-10 16:22:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2018-10-10 16:22:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-10 16:22:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-10-10 16:22:08,968 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 83 [2018-10-10 16:22:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:08,969 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-10-10 16:22:08,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-10-10 16:22:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 16:22:08,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:08,975 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:08,976 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:08,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash 815340541, now seen corresponding path program 2 times [2018-10-10 16:22:08,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 39 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 16:22:09,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:09,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:22:09,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:22:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:22:09,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:22:09,169 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 8 states. [2018-10-10 16:22:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:09,518 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-10-10 16:22:09,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:22:09,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-10-10 16:22:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:09,521 INFO L225 Difference]: With dead ends: 145 [2018-10-10 16:22:09,521 INFO L226 Difference]: Without dead ends: 145 [2018-10-10 16:22:09,522 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-10 16:22:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-10 16:22:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2018-10-10 16:22:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-10 16:22:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-10-10 16:22:09,530 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 109 [2018-10-10 16:22:09,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:09,531 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-10-10 16:22:09,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:22:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-10-10 16:22:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-10 16:22:09,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:09,533 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:09,533 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:09,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash 114236345, now seen corresponding path program 3 times [2018-10-10 16:22:09,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-10 16:22:09,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:09,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 16:22:09,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 16:22:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 16:22:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 16:22:09,753 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 5 states. [2018-10-10 16:22:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:09,892 INFO L93 Difference]: Finished difference Result 192 states and 195 transitions. [2018-10-10 16:22:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 16:22:09,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2018-10-10 16:22:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:09,895 INFO L225 Difference]: With dead ends: 192 [2018-10-10 16:22:09,895 INFO L226 Difference]: Without dead ends: 192 [2018-10-10 16:22:09,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:22:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-10 16:22:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 140. [2018-10-10 16:22:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-10 16:22:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2018-10-10 16:22:09,908 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 124 [2018-10-10 16:22:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:09,909 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2018-10-10 16:22:09,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 16:22:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-10-10 16:22:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-10 16:22:09,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:09,911 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:09,912 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:09,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:09,912 INFO L82 PathProgramCache]: Analyzing trace with hash -123288721, now seen corresponding path program 4 times [2018-10-10 16:22:09,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 5 proven. 99 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:22:10,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:10,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:22:10,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:22:10,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:22:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:22:10,183 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 14 states. [2018-10-10 16:22:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:11,058 INFO L93 Difference]: Finished difference Result 236 states and 241 transitions. [2018-10-10 16:22:11,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:22:11,059 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 139 [2018-10-10 16:22:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:11,061 INFO L225 Difference]: With dead ends: 236 [2018-10-10 16:22:11,061 INFO L226 Difference]: Without dead ends: 236 [2018-10-10 16:22:11,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:22:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-10 16:22:11,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 196. [2018-10-10 16:22:11,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-10 16:22:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 201 transitions. [2018-10-10 16:22:11,072 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 201 transitions. Word has length 139 [2018-10-10 16:22:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:11,073 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 201 transitions. [2018-10-10 16:22:11,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:22:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 201 transitions. [2018-10-10 16:22:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-10 16:22:11,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:11,075 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:11,076 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:11,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:11,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1838637384, now seen corresponding path program 5 times [2018-10-10 16:22:11,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 46 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-10 16:22:11,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:11,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:11,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:11,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:11,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:11,234 INFO L87 Difference]: Start difference. First operand 196 states and 201 transitions. Second operand 10 states. [2018-10-10 16:22:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:11,811 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-10-10 16:22:11,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:22:11,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2018-10-10 16:22:11,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:11,815 INFO L225 Difference]: With dead ends: 196 [2018-10-10 16:22:11,815 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 16:22:11,816 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-10 16:22:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 16:22:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-10 16:22:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-10 16:22:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2018-10-10 16:22:11,824 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 199 transitions. Word has length 165 [2018-10-10 16:22:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:11,824 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 199 transitions. [2018-10-10 16:22:11,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 199 transitions. [2018-10-10 16:22:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 16:22:11,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:11,827 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:11,828 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:11,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:11,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1509123134, now seen corresponding path program 6 times [2018-10-10 16:22:11,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 137 proven. 64 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-10 16:22:12,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:12,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:22:12,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:22:12,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:22:12,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:22:12,803 INFO L87 Difference]: Start difference. First operand 196 states and 199 transitions. Second operand 12 states. [2018-10-10 16:22:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:13,243 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2018-10-10 16:22:13,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 16:22:13,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2018-10-10 16:22:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:13,245 INFO L225 Difference]: With dead ends: 196 [2018-10-10 16:22:13,246 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 16:22:13,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:22:13,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 16:22:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-10 16:22:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-10 16:22:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-10-10 16:22:13,251 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 180 [2018-10-10 16:22:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:13,252 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-10-10 16:22:13,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:22:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-10-10 16:22:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-10 16:22:13,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:13,255 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:13,255 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:13,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1879157112, now seen corresponding path program 7 times [2018-10-10 16:22:13,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 2 proven. 266 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 16:22:13,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:13,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 16:22:13,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 16:22:13,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 16:22:13,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:22:13,536 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 17 states. [2018-10-10 16:22:14,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:14,682 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2018-10-10 16:22:14,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:22:14,683 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 195 [2018-10-10 16:22:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:14,685 INFO L225 Difference]: With dead ends: 285 [2018-10-10 16:22:14,686 INFO L226 Difference]: Without dead ends: 285 [2018-10-10 16:22:14,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=533, Invalid=2223, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:22:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-10 16:22:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 252. [2018-10-10 16:22:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 16:22:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 254 transitions. [2018-10-10 16:22:14,693 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 254 transitions. Word has length 195 [2018-10-10 16:22:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:14,694 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 254 transitions. [2018-10-10 16:22:14,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 16:22:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 254 transitions. [2018-10-10 16:22:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-10 16:22:14,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:14,697 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:14,698 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:14,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:14,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1671880833, now seen corresponding path program 8 times [2018-10-10 16:22:14,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 324 proven. 196 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-10 16:22:15,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:15,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:22:15,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:22:15,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:22:15,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:22:15,066 INFO L87 Difference]: Start difference. First operand 252 states and 254 transitions. Second operand 16 states. [2018-10-10 16:22:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:15,731 INFO L93 Difference]: Finished difference Result 281 states and 283 transitions. [2018-10-10 16:22:15,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:22:15,732 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 251 [2018-10-10 16:22:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:15,735 INFO L225 Difference]: With dead ends: 281 [2018-10-10 16:22:15,735 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 16:22:15,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:22:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 16:22:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-10-10 16:22:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-10 16:22:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 283 transitions. [2018-10-10 16:22:15,742 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 283 transitions. Word has length 251 [2018-10-10 16:22:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:15,742 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 283 transitions. [2018-10-10 16:22:15,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:22:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 283 transitions. [2018-10-10 16:22:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-10 16:22:15,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:15,746 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:15,746 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:15,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:15,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1779732775, now seen corresponding path program 9 times [2018-10-10 16:22:15,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 204 proven. 19 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-10-10 16:22:16,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:16,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 16:22:16,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 16:22:16,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 16:22:16,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:22:16,130 INFO L87 Difference]: Start difference. First operand 281 states and 283 transitions. Second operand 7 states. [2018-10-10 16:22:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:16,312 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-10-10 16:22:16,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 16:22:16,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 266 [2018-10-10 16:22:16,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:16,314 INFO L225 Difference]: With dead ends: 307 [2018-10-10 16:22:16,314 INFO L226 Difference]: Without dead ends: 307 [2018-10-10 16:22:16,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:22:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-10 16:22:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 282. [2018-10-10 16:22:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-10 16:22:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 284 transitions. [2018-10-10 16:22:16,320 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 284 transitions. Word has length 266 [2018-10-10 16:22:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:16,320 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 284 transitions. [2018-10-10 16:22:16,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 16:22:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 284 transitions. [2018-10-10 16:22:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-10 16:22:16,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:16,322 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:16,323 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:16,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1261816911, now seen corresponding path program 10 times [2018-10-10 16:22:16,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 298 proven. 51 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-10-10 16:22:16,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:16,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 16:22:16,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:22:16,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:22:16,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:22:16,559 INFO L87 Difference]: Start difference. First operand 282 states and 284 transitions. Second operand 9 states. [2018-10-10 16:22:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:16,958 INFO L93 Difference]: Finished difference Result 357 states and 361 transitions. [2018-10-10 16:22:16,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:22:16,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2018-10-10 16:22:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:16,962 INFO L225 Difference]: With dead ends: 357 [2018-10-10 16:22:16,962 INFO L226 Difference]: Without dead ends: 357 [2018-10-10 16:22:16,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:22:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-10 16:22:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 297. [2018-10-10 16:22:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-10 16:22:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 300 transitions. [2018-10-10 16:22:16,970 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 300 transitions. Word has length 281 [2018-10-10 16:22:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:16,971 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 300 transitions. [2018-10-10 16:22:16,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:22:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 300 transitions. [2018-10-10 16:22:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-10 16:22:16,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:16,974 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:16,974 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:16,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash 260183065, now seen corresponding path program 11 times [2018-10-10 16:22:16,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 0 proven. 821 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-10 16:22:18,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:18,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 16:22:18,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 16:22:18,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 16:22:18,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:22:18,104 INFO L87 Difference]: Start difference. First operand 297 states and 300 transitions. Second operand 17 states. [2018-10-10 16:22:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:19,558 INFO L93 Difference]: Finished difference Result 404 states and 409 transitions. [2018-10-10 16:22:19,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 16:22:19,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 296 [2018-10-10 16:22:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:19,561 INFO L225 Difference]: With dead ends: 404 [2018-10-10 16:22:19,561 INFO L226 Difference]: Without dead ends: 404 [2018-10-10 16:22:19,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=809, Invalid=2973, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:22:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-10 16:22:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 368. [2018-10-10 16:22:19,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-10 16:22:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 372 transitions. [2018-10-10 16:22:19,569 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 372 transitions. Word has length 296 [2018-10-10 16:22:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:19,569 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 372 transitions. [2018-10-10 16:22:19,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 16:22:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 372 transitions. [2018-10-10 16:22:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-10 16:22:19,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:19,572 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:19,572 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:19,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1122807976, now seen corresponding path program 12 times [2018-10-10 16:22:19,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 960 proven. 452 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-10 16:22:19,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:19,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:22:19,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:22:19,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:22:19,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:22:19,973 INFO L87 Difference]: Start difference. First operand 368 states and 372 transitions. Second operand 20 states. [2018-10-10 16:22:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:20,908 INFO L93 Difference]: Finished difference Result 383 states and 386 transitions. [2018-10-10 16:22:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:22:20,909 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 367 [2018-10-10 16:22:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:20,912 INFO L225 Difference]: With dead ends: 383 [2018-10-10 16:22:20,913 INFO L226 Difference]: Without dead ends: 383 [2018-10-10 16:22:20,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=1517, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:22:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-10 16:22:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-10-10 16:22:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-10 16:22:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 386 transitions. [2018-10-10 16:22:20,920 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 386 transitions. Word has length 367 [2018-10-10 16:22:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:20,921 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 386 transitions. [2018-10-10 16:22:20,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:22:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 386 transitions. [2018-10-10 16:22:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-10 16:22:20,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:20,923 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:20,924 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:20,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:20,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1287386018, now seen corresponding path program 13 times [2018-10-10 16:22:20,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1778 backedges. 0 proven. 1601 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-10-10 16:22:22,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:22,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:22:22,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:22:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:22:22,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:22:22,635 INFO L87 Difference]: Start difference. First operand 383 states and 386 transitions. Second operand 21 states. [2018-10-10 16:22:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:25,515 INFO L93 Difference]: Finished difference Result 490 states and 494 transitions. [2018-10-10 16:22:25,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 16:22:25,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 382 [2018-10-10 16:22:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:25,521 INFO L225 Difference]: With dead ends: 490 [2018-10-10 16:22:25,521 INFO L226 Difference]: Without dead ends: 490 [2018-10-10 16:22:25,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2845 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1522, Invalid=6850, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 16:22:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-10 16:22:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 469. [2018-10-10 16:22:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-10 16:22:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 473 transitions. [2018-10-10 16:22:25,531 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 473 transitions. Word has length 382 [2018-10-10 16:22:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:25,532 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 473 transitions. [2018-10-10 16:22:25,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:22:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 473 transitions. [2018-10-10 16:22:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-10-10 16:22:25,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:25,535 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:25,535 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:25,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1870974571, now seen corresponding path program 14 times [2018-10-10 16:22:25,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2895 backedges. 0 proven. 2593 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-10-10 16:22:27,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:27,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:22:27,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:22:27,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:22:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:22:27,408 INFO L87 Difference]: Start difference. First operand 469 states and 473 transitions. Second operand 21 states. [2018-10-10 16:22:28,269 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:22:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:29,849 INFO L93 Difference]: Finished difference Result 576 states and 581 transitions. [2018-10-10 16:22:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 16:22:29,849 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 468 [2018-10-10 16:22:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:29,854 INFO L225 Difference]: With dead ends: 576 [2018-10-10 16:22:29,854 INFO L226 Difference]: Without dead ends: 576 [2018-10-10 16:22:29,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2499 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1519, Invalid=5791, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 16:22:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-10-10 16:22:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 555. [2018-10-10 16:22:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-10 16:22:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 560 transitions. [2018-10-10 16:22:29,865 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 560 transitions. Word has length 468 [2018-10-10 16:22:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:29,866 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 560 transitions. [2018-10-10 16:22:29,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:22:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 560 transitions. [2018-10-10 16:22:29,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2018-10-10 16:22:29,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:29,870 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:29,870 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:29,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:29,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1493873780, now seen corresponding path program 15 times [2018-10-10 16:22:29,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4286 backedges. 0 proven. 3921 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-10-10 16:22:33,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:33,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:22:33,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:22:33,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:22:33,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:22:33,082 INFO L87 Difference]: Start difference. First operand 555 states and 560 transitions. Second operand 25 states. [2018-10-10 16:22:34,864 WARN L178 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-10-10 16:22:35,593 WARN L178 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-10-10 16:22:37,164 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-10-10 16:22:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:38,461 INFO L93 Difference]: Finished difference Result 662 states and 668 transitions. [2018-10-10 16:22:38,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-10 16:22:38,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 554 [2018-10-10 16:22:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:38,466 INFO L225 Difference]: With dead ends: 662 [2018-10-10 16:22:38,466 INFO L226 Difference]: Without dead ends: 662 [2018-10-10 16:22:38,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5668 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2751, Invalid=12501, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 16:22:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-10-10 16:22:38,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 641. [2018-10-10 16:22:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-10-10 16:22:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 647 transitions. [2018-10-10 16:22:38,479 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 647 transitions. Word has length 554 [2018-10-10 16:22:38,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:38,480 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 647 transitions. [2018-10-10 16:22:38,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:22:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 647 transitions. [2018-10-10 16:22:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-10-10 16:22:38,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:38,485 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:38,486 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:38,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:38,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1257261635, now seen corresponding path program 16 times [2018-10-10 16:22:38,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5951 backedges. 4058 proven. 1447 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-10-10 16:22:40,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:40,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:22:40,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:22:40,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:22:40,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:22:40,448 INFO L87 Difference]: Start difference. First operand 641 states and 647 transitions. Second operand 28 states. [2018-10-10 16:22:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:42,037 INFO L93 Difference]: Finished difference Result 698 states and 704 transitions. [2018-10-10 16:22:42,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:22:42,037 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 640 [2018-10-10 16:22:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:42,041 INFO L225 Difference]: With dead ends: 698 [2018-10-10 16:22:42,042 INFO L226 Difference]: Without dead ends: 698 [2018-10-10 16:22:42,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=638, Invalid=2668, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:22:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-10-10 16:22:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 670. [2018-10-10 16:22:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-10-10 16:22:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 676 transitions. [2018-10-10 16:22:42,052 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 676 transitions. Word has length 640 [2018-10-10 16:22:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:42,052 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 676 transitions. [2018-10-10 16:22:42,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:22:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 676 transitions. [2018-10-10 16:22:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2018-10-10 16:22:42,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:42,057 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:42,058 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:42,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:42,058 INFO L82 PathProgramCache]: Analyzing trace with hash -97298787, now seen corresponding path program 17 times [2018-10-10 16:22:42,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6351 backedges. 0 proven. 5831 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-10-10 16:22:43,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:43,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:22:43,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:22:43,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:22:43,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:22:43,197 INFO L87 Difference]: Start difference. First operand 670 states and 676 transitions. Second operand 27 states. [2018-10-10 16:22:43,808 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-10 16:22:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:47,492 INFO L93 Difference]: Finished difference Result 791 states and 798 transitions. [2018-10-10 16:22:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-10 16:22:47,493 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 655 [2018-10-10 16:22:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:47,497 INFO L225 Difference]: With dead ends: 791 [2018-10-10 16:22:47,497 INFO L226 Difference]: Without dead ends: 791 [2018-10-10 16:22:47,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7447 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3499, Invalid=15961, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 16:22:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-10-10 16:22:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 771. [2018-10-10 16:22:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-10-10 16:22:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 778 transitions. [2018-10-10 16:22:47,511 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 778 transitions. Word has length 655 [2018-10-10 16:22:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:47,512 INFO L481 AbstractCegarLoop]: Abstraction has 771 states and 778 transitions. [2018-10-10 16:22:47,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:22:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 778 transitions. [2018-10-10 16:22:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2018-10-10 16:22:47,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:47,518 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:47,518 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:47,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1548472852, now seen corresponding path program 18 times [2018-10-10 16:22:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8827 backedges. 6101 proven. 1785 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2018-10-10 16:22:49,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:49,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:22:49,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:22:49,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:22:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:22:49,448 INFO L87 Difference]: Start difference. First operand 771 states and 778 transitions. Second operand 30 states. [2018-10-10 16:22:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:51,274 INFO L93 Difference]: Finished difference Result 859 states and 866 transitions. [2018-10-10 16:22:51,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:22:51,274 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 756 [2018-10-10 16:22:51,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:51,279 INFO L225 Difference]: With dead ends: 859 [2018-10-10 16:22:51,279 INFO L226 Difference]: Without dead ends: 859 [2018-10-10 16:22:51,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=750, Invalid=3156, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:22:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-10-10 16:22:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 816. [2018-10-10 16:22:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2018-10-10 16:22:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 824 transitions. [2018-10-10 16:22:51,290 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 824 transitions. Word has length 756 [2018-10-10 16:22:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:51,291 INFO L481 AbstractCegarLoop]: Abstraction has 816 states and 824 transitions. [2018-10-10 16:22:51,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:22:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 824 transitions. [2018-10-10 16:22:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2018-10-10 16:22:51,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:51,297 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:51,297 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:51,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2132432006, now seen corresponding path program 19 times [2018-10-10 16:22:51,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9824 backedges. 6607 proven. 2138 refuted. 0 times theorem prover too weak. 1079 trivial. 0 not checked. [2018-10-10 16:22:53,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:53,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:22:53,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:22:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:22:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:22:53,290 INFO L87 Difference]: Start difference. First operand 816 states and 824 transitions. Second operand 32 states. [2018-10-10 16:22:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:55,656 INFO L93 Difference]: Finished difference Result 865 states and 872 transitions. [2018-10-10 16:22:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:22:55,656 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 786 [2018-10-10 16:22:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:55,661 INFO L225 Difference]: With dead ends: 865 [2018-10-10 16:22:55,661 INFO L226 Difference]: Without dead ends: 865 [2018-10-10 16:22:55,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1044, Invalid=4358, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 16:22:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-10-10 16:22:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 861. [2018-10-10 16:22:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-10-10 16:22:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 870 transitions. [2018-10-10 16:22:55,672 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 870 transitions. Word has length 786 [2018-10-10 16:22:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:55,673 INFO L481 AbstractCegarLoop]: Abstraction has 861 states and 870 transitions. [2018-10-10 16:22:55,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:22:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 870 transitions. [2018-10-10 16:22:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2018-10-10 16:22:55,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:55,680 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:55,680 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:55,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:55,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1009395668, now seen corresponding path program 20 times [2018-10-10 16:22:55,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10881 backedges. 75 proven. 9795 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2018-10-10 16:22:57,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:57,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:22:57,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:22:57,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:22:57,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:22:57,547 INFO L87 Difference]: Start difference. First operand 861 states and 870 transitions. Second operand 29 states. [2018-10-10 16:23:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:01,108 INFO L93 Difference]: Finished difference Result 1012 states and 1022 transitions. [2018-10-10 16:23:01,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-10 16:23:01,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 816 [2018-10-10 16:23:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:01,116 INFO L225 Difference]: With dead ends: 1012 [2018-10-10 16:23:01,116 INFO L226 Difference]: Without dead ends: 1012 [2018-10-10 16:23:01,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7990 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4208, Invalid=16098, Unknown=0, NotChecked=0, Total=20306 [2018-10-10 16:23:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2018-10-10 16:23:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 992. [2018-10-10 16:23:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-10 16:23:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1002 transitions. [2018-10-10 16:23:01,128 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1002 transitions. Word has length 816 [2018-10-10 16:23:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:01,129 INFO L481 AbstractCegarLoop]: Abstraction has 992 states and 1002 transitions. [2018-10-10 16:23:01,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:23:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1002 transitions. [2018-10-10 16:23:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2018-10-10 16:23:01,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:01,137 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:01,137 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:01,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:01,138 INFO L82 PathProgramCache]: Analyzing trace with hash -16645315, now seen corresponding path program 21 times [2018-10-10 16:23:01,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15341 backedges. 43 proven. 13933 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2018-10-10 16:23:02,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:02,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:23:02,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:23:02,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:23:02,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:23:02,195 INFO L87 Difference]: Start difference. First operand 992 states and 1002 transitions. Second operand 29 states. [2018-10-10 16:23:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:04,930 INFO L93 Difference]: Finished difference Result 1143 states and 1154 transitions. [2018-10-10 16:23:04,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-10 16:23:04,931 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 947 [2018-10-10 16:23:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:04,936 INFO L225 Difference]: With dead ends: 1143 [2018-10-10 16:23:04,936 INFO L226 Difference]: Without dead ends: 1143 [2018-10-10 16:23:04,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6431 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3762, Invalid=13268, Unknown=0, NotChecked=0, Total=17030 [2018-10-10 16:23:04,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-10-10 16:23:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1123. [2018-10-10 16:23:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2018-10-10 16:23:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1134 transitions. [2018-10-10 16:23:04,950 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1134 transitions. Word has length 947 [2018-10-10 16:23:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:04,951 INFO L481 AbstractCegarLoop]: Abstraction has 1123 states and 1134 transitions. [2018-10-10 16:23:04,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:23:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1134 transitions. [2018-10-10 16:23:04,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2018-10-10 16:23:04,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:04,961 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:04,962 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:04,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:04,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1160670412, now seen corresponding path program 22 times [2018-10-10 16:23:04,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20576 backedges. 14166 proven. 3295 refuted. 0 times theorem prover too weak. 3115 trivial. 0 not checked. [2018-10-10 16:23:06,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:06,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:23:06,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:23:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:23:06,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:23:06,941 INFO L87 Difference]: Start difference. First operand 1123 states and 1134 transitions. Second operand 36 states. [2018-10-10 16:23:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:09,662 INFO L93 Difference]: Finished difference Result 1189 states and 1198 transitions. [2018-10-10 16:23:09,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 16:23:09,666 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1078 [2018-10-10 16:23:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:09,669 INFO L225 Difference]: With dead ends: 1189 [2018-10-10 16:23:09,669 INFO L226 Difference]: Without dead ends: 1189 [2018-10-10 16:23:09,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1343, Invalid=5629, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 16:23:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2018-10-10 16:23:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1183. [2018-10-10 16:23:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-10-10 16:23:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1195 transitions. [2018-10-10 16:23:09,683 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1195 transitions. Word has length 1078 [2018-10-10 16:23:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:09,683 INFO L481 AbstractCegarLoop]: Abstraction has 1183 states and 1195 transitions. [2018-10-10 16:23:09,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:23:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1195 transitions. [2018-10-10 16:23:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1124 [2018-10-10 16:23:09,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:09,694 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:09,695 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:09,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:09,695 INFO L82 PathProgramCache]: Analyzing trace with hash -20200200, now seen corresponding path program 23 times [2018-10-10 16:23:09,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 22910 backedges. 15959 proven. 4801 refuted. 0 times theorem prover too weak. 2150 trivial. 0 not checked. [2018-10-10 16:23:11,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:11,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:23:11,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:23:11,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:23:11,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:23:11,515 INFO L87 Difference]: Start difference. First operand 1183 states and 1195 transitions. Second operand 40 states. [2018-10-10 16:23:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:14,763 INFO L93 Difference]: Finished difference Result 1236 states and 1245 transitions. [2018-10-10 16:23:14,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 16:23:14,764 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1123 [2018-10-10 16:23:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:14,769 INFO L225 Difference]: With dead ends: 1236 [2018-10-10 16:23:14,770 INFO L226 Difference]: Without dead ends: 1236 [2018-10-10 16:23:14,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1680, Invalid=7062, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 16:23:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-10-10 16:23:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1228. [2018-10-10 16:23:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2018-10-10 16:23:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1241 transitions. [2018-10-10 16:23:14,783 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1241 transitions. Word has length 1123 [2018-10-10 16:23:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:14,784 INFO L481 AbstractCegarLoop]: Abstraction has 1228 states and 1241 transitions. [2018-10-10 16:23:14,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:23:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1241 transitions. [2018-10-10 16:23:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1154 [2018-10-10 16:23:14,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:14,795 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:14,796 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:14,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:14,796 INFO L82 PathProgramCache]: Analyzing trace with hash 885061702, now seen corresponding path program 24 times [2018-10-10 16:23:14,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 24541 backedges. 0 proven. 22297 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-10-10 16:23:16,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:16,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:23:16,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:23:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:23:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:23:16,633 INFO L87 Difference]: Start difference. First operand 1228 states and 1241 transitions. Second operand 31 states. [2018-10-10 16:23:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:20,212 INFO L93 Difference]: Finished difference Result 1409 states and 1423 transitions. [2018-10-10 16:23:20,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-10 16:23:20,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1153 [2018-10-10 16:23:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:20,219 INFO L225 Difference]: With dead ends: 1409 [2018-10-10 16:23:20,219 INFO L226 Difference]: Without dead ends: 1409 [2018-10-10 16:23:20,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8009 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4239, Invalid=16931, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 16:23:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2018-10-10 16:23:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1389. [2018-10-10 16:23:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2018-10-10 16:23:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1403 transitions. [2018-10-10 16:23:20,235 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1403 transitions. Word has length 1153 [2018-10-10 16:23:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:20,236 INFO L481 AbstractCegarLoop]: Abstraction has 1389 states and 1403 transitions. [2018-10-10 16:23:20,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:23:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1403 transitions. [2018-10-10 16:23:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1315 [2018-10-10 16:23:20,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:20,250 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:20,250 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:20,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash 873278731, now seen corresponding path program 25 times [2018-10-10 16:23:20,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 32984 backedges. 15331 proven. 1162 refuted. 0 times theorem prover too weak. 16491 trivial. 0 not checked. [2018-10-10 16:23:21,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:21,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:23:21,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:23:21,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:23:21,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:23:21,747 INFO L87 Difference]: Start difference. First operand 1389 states and 1403 transitions. Second operand 26 states. [2018-10-10 16:23:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:23,101 INFO L93 Difference]: Finished difference Result 1419 states and 1432 transitions. [2018-10-10 16:23:23,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:23:23,102 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1314 [2018-10-10 16:23:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:23,108 INFO L225 Difference]: With dead ends: 1419 [2018-10-10 16:23:23,108 INFO L226 Difference]: Without dead ends: 1419 [2018-10-10 16:23:23,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=554, Invalid=2308, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:23:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-10-10 16:23:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1404. [2018-10-10 16:23:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2018-10-10 16:23:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1418 transitions. [2018-10-10 16:23:23,120 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1418 transitions. Word has length 1314 [2018-10-10 16:23:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:23,121 INFO L481 AbstractCegarLoop]: Abstraction has 1404 states and 1418 transitions. [2018-10-10 16:23:23,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:23:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1418 transitions. [2018-10-10 16:23:23,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1330 [2018-10-10 16:23:23,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:23,136 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:23,136 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:23,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash 15375773, now seen corresponding path program 26 times [2018-10-10 16:23:23,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 33958 backedges. 43 proven. 31058 refuted. 0 times theorem prover too weak. 2857 trivial. 0 not checked. [2018-10-10 16:23:24,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:24,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 16:23:24,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 16:23:24,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 16:23:24,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:23:24,995 INFO L87 Difference]: Start difference. First operand 1404 states and 1418 transitions. Second operand 33 states. [2018-10-10 16:23:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:28,845 INFO L93 Difference]: Finished difference Result 1585 states and 1600 transitions. [2018-10-10 16:23:28,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-10 16:23:28,845 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1329 [2018-10-10 16:23:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:28,852 INFO L225 Difference]: With dead ends: 1585 [2018-10-10 16:23:28,852 INFO L226 Difference]: Without dead ends: 1585 [2018-10-10 16:23:28,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9251 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5217, Invalid=18653, Unknown=0, NotChecked=0, Total=23870 [2018-10-10 16:23:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2018-10-10 16:23:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1565. [2018-10-10 16:23:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2018-10-10 16:23:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1580 transitions. [2018-10-10 16:23:28,866 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1580 transitions. Word has length 1329 [2018-10-10 16:23:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:28,867 INFO L481 AbstractCegarLoop]: Abstraction has 1565 states and 1580 transitions. [2018-10-10 16:23:28,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 16:23:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1580 transitions. [2018-10-10 16:23:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1491 [2018-10-10 16:23:28,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:28,884 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:28,884 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:28,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:28,884 INFO L82 PathProgramCache]: Analyzing trace with hash -430555500, now seen corresponding path program 27 times [2018-10-10 16:23:28,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 43796 backedges. 18842 proven. 1439 refuted. 0 times theorem prover too weak. 23515 trivial. 0 not checked. [2018-10-10 16:23:30,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:23:30,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:23:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:23:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:23:30,920 INFO L87 Difference]: Start difference. First operand 1565 states and 1580 transitions. Second operand 28 states. [2018-10-10 16:23:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:32,415 INFO L93 Difference]: Finished difference Result 1582 states and 1596 transitions. [2018-10-10 16:23:32,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:23:32,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1490 [2018-10-10 16:23:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:32,421 INFO L225 Difference]: With dead ends: 1582 [2018-10-10 16:23:32,421 INFO L226 Difference]: Without dead ends: 1582 [2018-10-10 16:23:32,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=783, Invalid=3249, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:23:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-10-10 16:23:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1580. [2018-10-10 16:23:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2018-10-10 16:23:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 1595 transitions. [2018-10-10 16:23:32,436 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 1595 transitions. Word has length 1490 [2018-10-10 16:23:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:32,436 INFO L481 AbstractCegarLoop]: Abstraction has 1580 states and 1595 transitions. [2018-10-10 16:23:32,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:23:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1595 transitions. [2018-10-10 16:23:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1506 [2018-10-10 16:23:32,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:32,453 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:32,454 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:32,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:32,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1078828250, now seen corresponding path program 28 times [2018-10-10 16:23:32,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 44921 backedges. 15157 proven. 877 refuted. 0 times theorem prover too weak. 28887 trivial. 0 not checked. [2018-10-10 16:23:34,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:34,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:23:34,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:23:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:23:34,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:23:34,672 INFO L87 Difference]: Start difference. First operand 1580 states and 1595 transitions. Second operand 24 states. [2018-10-10 16:23:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:35,796 INFO L93 Difference]: Finished difference Result 1595 states and 1610 transitions. [2018-10-10 16:23:35,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 16:23:35,799 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1505 [2018-10-10 16:23:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:35,805 INFO L225 Difference]: With dead ends: 1595 [2018-10-10 16:23:35,805 INFO L226 Difference]: Without dead ends: 1595 [2018-10-10 16:23:35,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:23:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-10-10 16:23:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1595. [2018-10-10 16:23:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2018-10-10 16:23:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 1610 transitions. [2018-10-10 16:23:35,817 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 1610 transitions. Word has length 1505 [2018-10-10 16:23:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:35,818 INFO L481 AbstractCegarLoop]: Abstraction has 1595 states and 1610 transitions. [2018-10-10 16:23:35,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:23:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 1610 transitions. [2018-10-10 16:23:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1521 [2018-10-10 16:23:35,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:35,835 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:35,835 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:35,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1667062814, now seen corresponding path program 29 times [2018-10-10 16:23:35,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 46061 backedges. 33358 proven. 9662 refuted. 0 times theorem prover too weak. 3041 trivial. 0 not checked. [2018-10-10 16:23:38,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:38,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:23:38,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:23:38,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:23:38,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1959, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:23:38,495 INFO L87 Difference]: Start difference. First operand 1595 states and 1610 transitions. Second operand 48 states. [2018-10-10 16:23:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:42,517 INFO L93 Difference]: Finished difference Result 1663 states and 1674 transitions. [2018-10-10 16:23:42,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 16:23:42,518 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1520 [2018-10-10 16:23:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:42,524 INFO L225 Difference]: With dead ends: 1663 [2018-10-10 16:23:42,525 INFO L226 Difference]: Without dead ends: 1663 [2018-10-10 16:23:42,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1983, Invalid=8523, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 16:23:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2018-10-10 16:23:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1625. [2018-10-10 16:23:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2018-10-10 16:23:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1641 transitions. [2018-10-10 16:23:42,538 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1641 transitions. Word has length 1520 [2018-10-10 16:23:42,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:42,538 INFO L481 AbstractCegarLoop]: Abstraction has 1625 states and 1641 transitions. [2018-10-10 16:23:42,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:23:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1641 transitions. [2018-10-10 16:23:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1536 [2018-10-10 16:23:42,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:42,555 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:42,555 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:42,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:42,556 INFO L82 PathProgramCache]: Analyzing trace with hash -222578216, now seen corresponding path program 30 times [2018-10-10 16:23:42,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 47216 backedges. 4591 proven. 98 refuted. 0 times theorem prover too weak. 42527 trivial. 0 not checked. [2018-10-10 16:23:44,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:44,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 16:23:44,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 16:23:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 16:23:44,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:23:44,161 INFO L87 Difference]: Start difference. First operand 1625 states and 1641 transitions. Second operand 11 states. [2018-10-10 16:23:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:44,559 INFO L93 Difference]: Finished difference Result 1769 states and 1787 transitions. [2018-10-10 16:23:44,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 16:23:44,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1535 [2018-10-10 16:23:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:44,565 INFO L225 Difference]: With dead ends: 1769 [2018-10-10 16:23:44,565 INFO L226 Difference]: Without dead ends: 1769 [2018-10-10 16:23:44,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:23:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2018-10-10 16:23:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1625. [2018-10-10 16:23:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2018-10-10 16:23:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1640 transitions. [2018-10-10 16:23:44,577 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1640 transitions. Word has length 1535 [2018-10-10 16:23:44,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:44,578 INFO L481 AbstractCegarLoop]: Abstraction has 1625 states and 1640 transitions. [2018-10-10 16:23:44,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 16:23:44,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1640 transitions. [2018-10-10 16:23:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1551 [2018-10-10 16:23:44,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:44,590 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:44,590 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:44,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:44,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1898691728, now seen corresponding path program 31 times [2018-10-10 16:23:44,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 48386 backedges. 34528 proven. 10755 refuted. 0 times theorem prover too weak. 3103 trivial. 0 not checked. [2018-10-10 16:23:48,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:48,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:23:48,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:23:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:23:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2130, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:23:48,465 INFO L87 Difference]: Start difference. First operand 1625 states and 1640 transitions. Second operand 50 states. [2018-10-10 16:23:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:52,921 INFO L93 Difference]: Finished difference Result 1693 states and 1704 transitions. [2018-10-10 16:23:52,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 16:23:52,921 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1550 [2018-10-10 16:23:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:52,928 INFO L225 Difference]: With dead ends: 1693 [2018-10-10 16:23:52,928 INFO L226 Difference]: Without dead ends: 1693 [2018-10-10 16:23:52,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2180, Invalid=9376, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 16:23:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2018-10-10 16:23:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1655. [2018-10-10 16:23:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2018-10-10 16:23:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 1671 transitions. [2018-10-10 16:23:52,943 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 1671 transitions. Word has length 1550 [2018-10-10 16:23:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:52,944 INFO L481 AbstractCegarLoop]: Abstraction has 1655 states and 1671 transitions. [2018-10-10 16:23:52,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:23:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 1671 transitions. [2018-10-10 16:23:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1566 [2018-10-10 16:23:52,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:52,958 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:52,958 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:52,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:52,958 INFO L82 PathProgramCache]: Analyzing trace with hash 592119526, now seen corresponding path program 32 times [2018-10-10 16:23:52,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 49571 backedges. 36916 proven. 8387 refuted. 0 times theorem prover too weak. 4268 trivial. 0 not checked. [2018-10-10 16:23:55,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:55,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:23:55,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:23:55,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:23:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:23:55,579 INFO L87 Difference]: Start difference. First operand 1655 states and 1671 transitions. Second operand 46 states. [2018-10-10 16:23:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:59,346 INFO L93 Difference]: Finished difference Result 1693 states and 1704 transitions. [2018-10-10 16:23:59,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 16:23:59,346 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1565 [2018-10-10 16:23:59,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:59,353 INFO L225 Difference]: With dead ends: 1693 [2018-10-10 16:23:59,353 INFO L226 Difference]: Without dead ends: 1693 [2018-10-10 16:23:59,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2246 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1834, Invalid=7868, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 16:23:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2018-10-10 16:23:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1670. [2018-10-10 16:23:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1670 states. [2018-10-10 16:23:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 1686 transitions. [2018-10-10 16:23:59,365 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 1686 transitions. Word has length 1565 [2018-10-10 16:23:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:59,366 INFO L481 AbstractCegarLoop]: Abstraction has 1670 states and 1686 transitions. [2018-10-10 16:23:59,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:23:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 1686 transitions. [2018-10-10 16:23:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1581 [2018-10-10 16:23:59,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:59,380 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:59,380 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:59,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:59,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1371631902, now seen corresponding path program 33 times [2018-10-10 16:23:59,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 50771 backedges. 37159 proven. 9344 refuted. 0 times theorem prover too weak. 4268 trivial. 0 not checked. [2018-10-10 16:24:02,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:02,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:24:02,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:24:02,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:24:02,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:24:02,157 INFO L87 Difference]: Start difference. First operand 1670 states and 1686 transitions. Second operand 48 states. [2018-10-10 16:24:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:06,964 INFO L93 Difference]: Finished difference Result 1695 states and 1706 transitions. [2018-10-10 16:24:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 16:24:06,964 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1580 [2018-10-10 16:24:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:06,970 INFO L225 Difference]: With dead ends: 1695 [2018-10-10 16:24:06,971 INFO L226 Difference]: Without dead ends: 1695 [2018-10-10 16:24:06,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2903 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2468, Invalid=10414, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 16:24:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2018-10-10 16:24:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1685. [2018-10-10 16:24:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2018-10-10 16:24:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1701 transitions. [2018-10-10 16:24:06,982 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1701 transitions. Word has length 1580 [2018-10-10 16:24:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:06,983 INFO L481 AbstractCegarLoop]: Abstraction has 1685 states and 1701 transitions. [2018-10-10 16:24:06,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:24:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1701 transitions. [2018-10-10 16:24:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1596 [2018-10-10 16:24:06,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:06,995 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:06,995 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:06,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:06,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1988267878, now seen corresponding path program 34 times [2018-10-10 16:24:06,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 51986 backedges. 98 proven. 47822 refuted. 0 times theorem prover too weak. 4066 trivial. 0 not checked. [2018-10-10 16:24:09,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:09,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:24:09,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:24:09,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:24:09,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:24:09,887 INFO L87 Difference]: Start difference. First operand 1685 states and 1701 transitions. Second operand 43 states. [2018-10-10 16:24:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:19,364 INFO L93 Difference]: Finished difference Result 2040 states and 2060 transitions. [2018-10-10 16:24:19,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 275 states. [2018-10-10 16:24:19,364 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1595 [2018-10-10 16:24:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:19,373 INFO L225 Difference]: With dead ends: 2040 [2018-10-10 16:24:19,373 INFO L226 Difference]: Without dead ends: 2040 [2018-10-10 16:24:19,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44577 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=15820, Invalid=82462, Unknown=0, NotChecked=0, Total=98282 [2018-10-10 16:24:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2018-10-10 16:24:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1876. [2018-10-10 16:24:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2018-10-10 16:24:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 1893 transitions. [2018-10-10 16:24:19,401 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 1893 transitions. Word has length 1595 [2018-10-10 16:24:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:19,402 INFO L481 AbstractCegarLoop]: Abstraction has 1876 states and 1893 transitions. [2018-10-10 16:24:19,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:24:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 1893 transitions. [2018-10-10 16:24:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1787 [2018-10-10 16:24:19,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:19,420 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:19,420 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:19,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:19,421 INFO L82 PathProgramCache]: Analyzing trace with hash 260776889, now seen corresponding path program 35 times [2018-10-10 16:24:19,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 66782 backedges. 0 proven. 61786 refuted. 0 times theorem prover too weak. 4996 trivial. 0 not checked. [2018-10-10 16:24:22,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:22,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:24:22,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:24:22,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:24:22,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1064, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:24:22,423 INFO L87 Difference]: Start difference. First operand 1876 states and 1893 transitions. Second operand 37 states. [2018-10-10 16:24:27,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:27,630 INFO L93 Difference]: Finished difference Result 2087 states and 2105 transitions. [2018-10-10 16:24:27,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-10 16:24:27,631 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1786 [2018-10-10 16:24:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:27,638 INFO L225 Difference]: With dead ends: 2087 [2018-10-10 16:24:27,639 INFO L226 Difference]: Without dead ends: 2087 [2018-10-10 16:24:27,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12815 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6519, Invalid=26423, Unknown=0, NotChecked=0, Total=32942 [2018-10-10 16:24:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-10-10 16:24:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2067. [2018-10-10 16:24:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2018-10-10 16:24:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2085 transitions. [2018-10-10 16:24:27,657 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2085 transitions. Word has length 1786 [2018-10-10 16:24:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:27,658 INFO L481 AbstractCegarLoop]: Abstraction has 2067 states and 2085 transitions. [2018-10-10 16:24:27,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:24:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2085 transitions. [2018-10-10 16:24:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1978 [2018-10-10 16:24:27,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:27,679 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:27,679 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:27,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:27,680 INFO L82 PathProgramCache]: Analyzing trace with hash 97681670, now seen corresponding path program 36 times [2018-10-10 16:24:27,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 83441 backedges. 0 proven. 77655 refuted. 0 times theorem prover too weak. 5786 trivial. 0 not checked. [2018-10-10 16:24:31,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:31,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 16:24:31,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 16:24:31,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 16:24:31,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1335, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:24:31,511 INFO L87 Difference]: Start difference. First operand 2067 states and 2085 transitions. Second operand 41 states. [2018-10-10 16:24:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:40,950 INFO L93 Difference]: Finished difference Result 2278 states and 2297 transitions. [2018-10-10 16:24:40,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-10-10 16:24:40,951 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1977 [2018-10-10 16:24:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:40,957 INFO L225 Difference]: With dead ends: 2278 [2018-10-10 16:24:40,957 INFO L226 Difference]: Without dead ends: 2278 [2018-10-10 16:24:40,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26760 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=11227, Invalid=52025, Unknown=0, NotChecked=0, Total=63252 [2018-10-10 16:24:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2018-10-10 16:24:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2258. [2018-10-10 16:24:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2018-10-10 16:24:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 2277 transitions. [2018-10-10 16:24:40,978 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 2277 transitions. Word has length 1977 [2018-10-10 16:24:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:40,979 INFO L481 AbstractCegarLoop]: Abstraction has 2258 states and 2277 transitions. [2018-10-10 16:24:40,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 16:24:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2277 transitions. [2018-10-10 16:24:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2169 [2018-10-10 16:24:41,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:41,003 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:41,003 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:41,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:41,004 INFO L82 PathProgramCache]: Analyzing trace with hash 731741721, now seen corresponding path program 37 times [2018-10-10 16:24:41,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 101963 backedges. 8489 proven. 160 refuted. 0 times theorem prover too weak. 93314 trivial. 0 not checked. [2018-10-10 16:24:43,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:43,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 16:24:43,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 16:24:43,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 16:24:43,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-10 16:24:43,237 INFO L87 Difference]: Start difference. First operand 2258 states and 2277 transitions. Second operand 13 states. [2018-10-10 16:24:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:43,792 INFO L93 Difference]: Finished difference Result 2520 states and 2544 transitions. [2018-10-10 16:24:43,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 16:24:43,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 2168 [2018-10-10 16:24:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:43,798 INFO L225 Difference]: With dead ends: 2520 [2018-10-10 16:24:43,798 INFO L226 Difference]: Without dead ends: 2520 [2018-10-10 16:24:43,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:24:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2018-10-10 16:24:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2258. [2018-10-10 16:24:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2018-10-10 16:24:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 2276 transitions. [2018-10-10 16:24:43,811 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 2276 transitions. Word has length 2168 [2018-10-10 16:24:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:43,812 INFO L481 AbstractCegarLoop]: Abstraction has 2258 states and 2276 transitions. [2018-10-10 16:24:43,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 16:24:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2276 transitions. [2018-10-10 16:24:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2184 [2018-10-10 16:24:43,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:43,835 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:43,836 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:43,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1270568207, now seen corresponding path program 38 times [2018-10-10 16:24:43,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 103691 backedges. 10140 proven. 237 refuted. 0 times theorem prover too weak. 93314 trivial. 0 not checked. [2018-10-10 16:24:46,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:46,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:24:46,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:24:46,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:24:46,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:24:46,333 INFO L87 Difference]: Start difference. First operand 2258 states and 2276 transitions. Second operand 15 states. [2018-10-10 16:24:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:47,079 INFO L93 Difference]: Finished difference Result 2673 states and 2700 transitions. [2018-10-10 16:24:47,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:24:47,079 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 2183 [2018-10-10 16:24:47,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:47,084 INFO L225 Difference]: With dead ends: 2673 [2018-10-10 16:24:47,084 INFO L226 Difference]: Without dead ends: 2673 [2018-10-10 16:24:47,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:24:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2018-10-10 16:24:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2258. [2018-10-10 16:24:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2018-10-10 16:24:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 2275 transitions. [2018-10-10 16:24:47,103 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 2275 transitions. Word has length 2183 [2018-10-10 16:24:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:47,104 INFO L481 AbstractCegarLoop]: Abstraction has 2258 states and 2275 transitions. [2018-10-10 16:24:47,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:24:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2275 transitions. [2018-10-10 16:24:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2199 [2018-10-10 16:24:47,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:47,142 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:47,143 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:47,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:47,143 INFO L82 PathProgramCache]: Analyzing trace with hash -6163623, now seen corresponding path program 39 times [2018-10-10 16:24:47,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 105434 backedges. 11791 proven. 329 refuted. 0 times theorem prover too weak. 93314 trivial. 0 not checked. [2018-10-10 16:24:49,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:49,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 16:24:49,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 16:24:49,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 16:24:49,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:24:49,775 INFO L87 Difference]: Start difference. First operand 2258 states and 2275 transitions. Second operand 17 states. [2018-10-10 16:24:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:50,725 INFO L93 Difference]: Finished difference Result 2861 states and 2892 transitions. [2018-10-10 16:24:50,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:24:50,726 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 2198 [2018-10-10 16:24:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:50,731 INFO L225 Difference]: With dead ends: 2861 [2018-10-10 16:24:50,731 INFO L226 Difference]: Without dead ends: 2861 [2018-10-10 16:24:50,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:24:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2018-10-10 16:24:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2258. [2018-10-10 16:24:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2018-10-10 16:24:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 2274 transitions. [2018-10-10 16:24:50,750 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 2274 transitions. Word has length 2198 [2018-10-10 16:24:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:50,752 INFO L481 AbstractCegarLoop]: Abstraction has 2258 states and 2274 transitions. [2018-10-10 16:24:50,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 16:24:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2274 transitions. [2018-10-10 16:24:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2214 [2018-10-10 16:24:50,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:50,789 INFO L375 BasicCegarLoop]: trace histogram [118, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:50,789 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:50,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:50,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2115352527, now seen corresponding path program 40 times [2018-10-10 16:24:50,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 107192 backedges. 13442 proven. 436 refuted. 0 times theorem prover too weak. 93314 trivial. 0 not checked. [2018-10-10 16:24:53,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:53,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:24:53,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:24:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:24:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:24:53,248 INFO L87 Difference]: Start difference. First operand 2258 states and 2274 transitions. Second operand 19 states. [2018-10-10 16:24:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:54,457 INFO L93 Difference]: Finished difference Result 3097 states and 3133 transitions. [2018-10-10 16:24:54,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:24:54,457 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 2213 [2018-10-10 16:24:54,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:54,464 INFO L225 Difference]: With dead ends: 3097 [2018-10-10 16:24:54,464 INFO L226 Difference]: Without dead ends: 3097 [2018-10-10 16:24:54,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:24:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2018-10-10 16:24:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 2258. [2018-10-10 16:24:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2018-10-10 16:24:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 2273 transitions. [2018-10-10 16:24:54,483 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 2273 transitions. Word has length 2213 [2018-10-10 16:24:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:54,485 INFO L481 AbstractCegarLoop]: Abstraction has 2258 states and 2273 transitions. [2018-10-10 16:24:54,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:24:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2273 transitions. [2018-10-10 16:24:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2229 [2018-10-10 16:24:54,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:54,523 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:54,524 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:54,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1839351655, now seen corresponding path program 41 times [2018-10-10 16:24:54,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 108965 backedges. 15093 proven. 558 refuted. 0 times theorem prover too weak. 93314 trivial. 0 not checked. [2018-10-10 16:24:57,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:57,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:24:57,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:24:57,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:24:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:24:57,005 INFO L87 Difference]: Start difference. First operand 2258 states and 2273 transitions. Second operand 21 states. [2018-10-10 16:24:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:58,678 INFO L93 Difference]: Finished difference Result 3377 states and 3420 transitions. [2018-10-10 16:24:58,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 16:24:58,678 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2228 [2018-10-10 16:24:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:58,683 INFO L225 Difference]: With dead ends: 3377 [2018-10-10 16:24:58,683 INFO L226 Difference]: Without dead ends: 3377 [2018-10-10 16:24:58,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:24:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2018-10-10 16:24:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 2258. [2018-10-10 16:24:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2018-10-10 16:24:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 2272 transitions. [2018-10-10 16:24:58,704 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 2272 transitions. Word has length 2228 [2018-10-10 16:24:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:58,705 INFO L481 AbstractCegarLoop]: Abstraction has 2258 states and 2272 transitions. [2018-10-10 16:24:58,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:24:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2272 transitions. [2018-10-10 16:24:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2244 [2018-10-10 16:24:58,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:58,740 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:58,740 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:58,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:58,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1647233679, now seen corresponding path program 42 times [2018-10-10 16:24:58,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 110753 backedges. 16744 proven. 695 refuted. 0 times theorem prover too weak. 93314 trivial. 0 not checked. [2018-10-10 16:25:01,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:01,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:25:01,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:25:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:25:01,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:25:01,377 INFO L87 Difference]: Start difference. First operand 2258 states and 2272 transitions. Second operand 23 states. [2018-10-10 16:25:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:03,358 INFO L93 Difference]: Finished difference Result 3735 states and 3786 transitions. [2018-10-10 16:25:03,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 16:25:03,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 2243 [2018-10-10 16:25:03,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:03,364 INFO L225 Difference]: With dead ends: 3735 [2018-10-10 16:25:03,364 INFO L226 Difference]: Without dead ends: 3735 [2018-10-10 16:25:03,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:25:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2018-10-10 16:25:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 2259. [2018-10-10 16:25:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2018-10-10 16:25:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 2273 transitions. [2018-10-10 16:25:03,386 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 2273 transitions. Word has length 2243 [2018-10-10 16:25:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:03,387 INFO L481 AbstractCegarLoop]: Abstraction has 2259 states and 2273 transitions. [2018-10-10 16:25:03,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:25:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 2273 transitions. [2018-10-10 16:25:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2259 [2018-10-10 16:25:03,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:03,422 INFO L375 BasicCegarLoop]: trace histogram [121, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:03,423 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:03,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:03,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1210371545, now seen corresponding path program 43 times [2018-10-10 16:25:03,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 112556 backedges. 18395 proven. 847 refuted. 0 times theorem prover too weak. 93314 trivial. 0 not checked. [2018-10-10 16:25:06,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:06,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:25:06,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:25:06,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:25:06,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:25:06,064 INFO L87 Difference]: Start difference. First operand 2259 states and 2273 transitions. Second operand 25 states. [2018-10-10 16:25:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:08,337 INFO L93 Difference]: Finished difference Result 4205 states and 4270 transitions. [2018-10-10 16:25:08,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 16:25:08,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 2258 [2018-10-10 16:25:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:08,342 INFO L225 Difference]: With dead ends: 4205 [2018-10-10 16:25:08,342 INFO L226 Difference]: Without dead ends: 4205 [2018-10-10 16:25:08,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:25:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4205 states. [2018-10-10 16:25:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4205 to 2274. [2018-10-10 16:25:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2274 states. [2018-10-10 16:25:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 2289 transitions. [2018-10-10 16:25:08,364 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 2289 transitions. Word has length 2258 [2018-10-10 16:25:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:08,366 INFO L481 AbstractCegarLoop]: Abstraction has 2274 states and 2289 transitions. [2018-10-10 16:25:08,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:25:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2289 transitions. [2018-10-10 16:25:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2274 [2018-10-10 16:25:08,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:08,407 INFO L375 BasicCegarLoop]: trace histogram [122, 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:08,407 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:08,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:08,408 INFO L82 PathProgramCache]: Analyzing trace with hash -516780721, now seen corresponding path program 44 times [2018-10-10 16:25:08,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 114374 backedges. 444 proven. 106798 refuted. 0 times theorem prover too weak. 7132 trivial. 0 not checked. [2018-10-10 16:25:13,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:13,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 16:25:13,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 16:25:13,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 16:25:13,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:25:13,167 INFO L87 Difference]: Start difference. First operand 2274 states and 2289 transitions. Second operand 45 states. [2018-10-10 16:25:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:22,232 INFO L93 Difference]: Finished difference Result 2514 states and 2531 transitions. [2018-10-10 16:25:22,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 251 states. [2018-10-10 16:25:22,233 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 2273 [2018-10-10 16:25:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:22,236 INFO L225 Difference]: With dead ends: 2514 [2018-10-10 16:25:22,236 INFO L226 Difference]: Without dead ends: 2514 [2018-10-10 16:25:22,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38453 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=16712, Invalid=68260, Unknown=0, NotChecked=0, Total=84972 [2018-10-10 16:25:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2018-10-10 16:25:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2465. [2018-10-10 16:25:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2018-10-10 16:25:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 2481 transitions. [2018-10-10 16:25:22,254 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 2481 transitions. Word has length 2273 [2018-10-10 16:25:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:22,254 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 2481 transitions. [2018-10-10 16:25:22,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 16:25:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 2481 transitions. [2018-10-10 16:25:22,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2465 [2018-10-10 16:25:22,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:22,284 INFO L375 BasicCegarLoop]: trace histogram [133, 132, 132, 132, 132, 132, 132, 132, 132, 132, 132, 132, 132, 132, 132, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:22,284 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:22,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash -285779102, now seen corresponding path program 45 times [2018-10-10 16:25:22,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 135921 backedges. 0 proven. 127675 refuted. 0 times theorem prover too weak. 8246 trivial. 0 not checked. [2018-10-10 16:25:27,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:27,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:25:27,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:25:27,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:25:27,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1433, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:25:27,311 INFO L87 Difference]: Start difference. First operand 2465 states and 2481 transitions. Second operand 43 states. [2018-10-10 16:25:34,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:34,484 INFO L93 Difference]: Finished difference Result 2692 states and 2710 transitions. [2018-10-10 16:25:34,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-10 16:25:34,484 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2464 [2018-10-10 16:25:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:34,487 INFO L225 Difference]: With dead ends: 2692 [2018-10-10 16:25:34,487 INFO L226 Difference]: Without dead ends: 2692 [2018-10-10 16:25:34,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18746 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9285, Invalid=38021, Unknown=0, NotChecked=0, Total=47306 [2018-10-10 16:25:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2018-10-10 16:25:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2656. [2018-10-10 16:25:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2018-10-10 16:25:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 2673 transitions. [2018-10-10 16:25:34,505 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 2673 transitions. Word has length 2464 [2018-10-10 16:25:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:34,506 INFO L481 AbstractCegarLoop]: Abstraction has 2656 states and 2673 transitions. [2018-10-10 16:25:34,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:25:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 2673 transitions. [2018-10-10 16:25:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2656 [2018-10-10 16:25:34,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:34,545 INFO L375 BasicCegarLoop]: trace histogram [144, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:34,546 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:34,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:34,546 INFO L82 PathProgramCache]: Analyzing trace with hash -729921809, now seen corresponding path program 46 times [2018-10-10 16:25:34,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 159331 backedges. 129305 proven. 21602 refuted. 0 times theorem prover too weak. 8424 trivial. 0 not checked. [2018-10-10 16:25:40,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:40,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 16:25:40,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 16:25:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 16:25:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=3282, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:25:40,475 INFO L87 Difference]: Start difference. First operand 2656 states and 2673 transitions. Second operand 62 states. [2018-10-10 16:25:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:46,691 INFO L93 Difference]: Finished difference Result 2696 states and 2712 transitions. [2018-10-10 16:25:46,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 16:25:46,691 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 2655 [2018-10-10 16:25:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:46,695 INFO L225 Difference]: With dead ends: 2696 [2018-10-10 16:25:46,695 INFO L226 Difference]: Without dead ends: 2696 [2018-10-10 16:25:46,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4214 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3316, Invalid=14240, Unknown=0, NotChecked=0, Total=17556 [2018-10-10 16:25:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2018-10-10 16:25:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2671. [2018-10-10 16:25:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2018-10-10 16:25:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 2687 transitions. [2018-10-10 16:25:46,708 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 2687 transitions. Word has length 2655 [2018-10-10 16:25:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:46,709 INFO L481 AbstractCegarLoop]: Abstraction has 2671 states and 2687 transitions. [2018-10-10 16:25:46,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 16:25:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 2687 transitions. [2018-10-10 16:25:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2671 [2018-10-10 16:25:46,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:46,746 INFO L375 BasicCegarLoop]: trace histogram [145, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:46,747 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:46,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:46,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1448956629, now seen corresponding path program 47 times [2018-10-10 16:25:46,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 161496 backedges. 249 proven. 152399 refuted. 0 times theorem prover too weak. 8848 trivial. 0 not checked. [2018-10-10 16:25:52,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:52,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 16:25:52,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 16:25:52,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 16:25:52,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=2118, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:25:52,606 INFO L87 Difference]: Start difference. First operand 2671 states and 2687 transitions. Second operand 51 states. [2018-10-10 16:26:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:11,034 INFO L93 Difference]: Finished difference Result 2959 states and 2977 transitions. [2018-10-10 16:26:11,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 365 states. [2018-10-10 16:26:11,034 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2670 [2018-10-10 16:26:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:11,038 INFO L225 Difference]: With dead ends: 2959 [2018-10-10 16:26:11,038 INFO L226 Difference]: Without dead ends: 2959 [2018-10-10 16:26:11,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81326 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=30969, Invalid=139187, Unknown=0, NotChecked=0, Total=170156 [2018-10-10 16:26:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2018-10-10 16:26:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2877. [2018-10-10 16:26:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2877 states. [2018-10-10 16:26:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 2894 transitions. [2018-10-10 16:26:11,063 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 2894 transitions. Word has length 2670 [2018-10-10 16:26:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:11,064 INFO L481 AbstractCegarLoop]: Abstraction has 2877 states and 2894 transitions. [2018-10-10 16:26:11,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 16:26:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 2894 transitions. [2018-10-10 16:26:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2877 [2018-10-10 16:26:11,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:11,106 INFO L375 BasicCegarLoop]: trace histogram [157, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:11,106 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:11,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash 739529524, now seen corresponding path program 48 times [2018-10-10 16:26:11,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 189281 backedges. 0 proven. 179031 refuted. 0 times theorem prover too weak. 10250 trivial. 0 not checked. [2018-10-10 16:26:17,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:17,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 16:26:17,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 16:26:17,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 16:26:17,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1709, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:26:17,530 INFO L87 Difference]: Start difference. First operand 2877 states and 2894 transitions. Second operand 47 states. [2018-10-10 16:26:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:25,728 INFO L93 Difference]: Finished difference Result 3104 states and 3122 transitions. [2018-10-10 16:26:25,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-10 16:26:25,728 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2876 [2018-10-10 16:26:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:25,733 INFO L225 Difference]: With dead ends: 3104 [2018-10-10 16:26:25,733 INFO L226 Difference]: Without dead ends: 3104 [2018-10-10 16:26:25,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23325 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11399, Invalid=46923, Unknown=0, NotChecked=0, Total=58322 [2018-10-10 16:26:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2018-10-10 16:26:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 3083. [2018-10-10 16:26:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3083 states. [2018-10-10 16:26:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 3101 transitions. [2018-10-10 16:26:25,754 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 3101 transitions. Word has length 2876 [2018-10-10 16:26:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:25,755 INFO L481 AbstractCegarLoop]: Abstraction has 3083 states and 3101 transitions. [2018-10-10 16:26:25,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 16:26:25,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3101 transitions. [2018-10-10 16:26:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3083 [2018-10-10 16:26:25,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:25,807 INFO L375 BasicCegarLoop]: trace histogram [169, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:25,807 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:25,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:25,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1245848195, now seen corresponding path program 49 times [2018-10-10 16:26:25,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 219276 backedges. 0 proven. 208175 refuted. 0 times theorem prover too weak. 11101 trivial. 0 not checked. [2018-10-10 16:26:32,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:32,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 16:26:32,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 16:26:32,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 16:26:32,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:26:32,901 INFO L87 Difference]: Start difference. First operand 3083 states and 3101 transitions. Second operand 51 states. [2018-10-10 16:26:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:47,275 INFO L93 Difference]: Finished difference Result 3310 states and 3329 transitions. [2018-10-10 16:26:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2018-10-10 16:26:47,276 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 3082 [2018-10-10 16:26:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:47,280 INFO L225 Difference]: With dead ends: 3310 [2018-10-10 16:26:47,280 INFO L226 Difference]: Without dead ends: 3310 [2018-10-10 16:26:47,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47905 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19417, Invalid=90475, Unknown=0, NotChecked=0, Total=109892 [2018-10-10 16:26:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2018-10-10 16:26:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3289. [2018-10-10 16:26:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3289 states. [2018-10-10 16:26:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 3308 transitions. [2018-10-10 16:26:47,304 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 3308 transitions. Word has length 3082 [2018-10-10 16:26:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:47,305 INFO L481 AbstractCegarLoop]: Abstraction has 3289 states and 3308 transitions. [2018-10-10 16:26:47,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 16:26:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 3308 transitions. [2018-10-10 16:26:47,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3289 [2018-10-10 16:26:47,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:47,360 INFO L375 BasicCegarLoop]: trace histogram [181, 180, 180, 180, 180, 180, 180, 180, 180, 180, 180, 180, 180, 180, 180, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:47,360 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:47,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:47,360 INFO L82 PathProgramCache]: Analyzing trace with hash 982834182, now seen corresponding path program 50 times [2018-10-10 16:26:47,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 251481 backedges. 198016 proven. 19721 refuted. 0 times theorem prover too weak. 33744 trivial. 0 not checked. [2018-10-10 16:26:54,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:54,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 16:26:54,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 16:26:54,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 16:26:54,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=3075, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:26:54,964 INFO L87 Difference]: Start difference. First operand 3289 states and 3308 transitions. Second operand 60 states. [2018-10-10 16:26:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:59,258 INFO L93 Difference]: Finished difference Result 3381 states and 3400 transitions. [2018-10-10 16:26:59,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 16:26:59,259 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 3288 [2018-10-10 16:26:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:59,262 INFO L225 Difference]: With dead ends: 3381 [2018-10-10 16:26:59,263 INFO L226 Difference]: Without dead ends: 3381 [2018-10-10 16:26:59,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3957 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3111, Invalid=13401, Unknown=0, NotChecked=0, Total=16512 [2018-10-10 16:26:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2018-10-10 16:26:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3304. [2018-10-10 16:26:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3304 states. [2018-10-10 16:26:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 3323 transitions. [2018-10-10 16:26:59,281 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 3323 transitions. Word has length 3288 [2018-10-10 16:26:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:59,282 INFO L481 AbstractCegarLoop]: Abstraction has 3304 states and 3323 transitions. [2018-10-10 16:26:59,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 16:26:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 3323 transitions. [2018-10-10 16:26:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3304 [2018-10-10 16:26:59,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:59,337 INFO L375 BasicCegarLoop]: trace histogram [182, 181, 181, 181, 181, 181, 181, 181, 181, 181, 181, 181, 181, 181, 181, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:59,338 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:59,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1693734148, now seen corresponding path program 51 times [2018-10-10 16:26:59,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 254204 backedges. 0 proven. 241935 refuted. 0 times theorem prover too weak. 12269 trivial. 0 not checked. [2018-10-10 16:27:07,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:07,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 16:27:07,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 16:27:07,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 16:27:07,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=2211, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:27:07,694 INFO L87 Difference]: Start difference. First operand 3304 states and 3323 transitions. Second operand 53 states. [2018-10-10 16:27:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:22,935 INFO L93 Difference]: Finished difference Result 3531 states and 3551 transitions. [2018-10-10 16:27:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 301 states. [2018-10-10 16:27:22,943 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 3303 [2018-10-10 16:27:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:22,947 INFO L225 Difference]: With dead ends: 3531 [2018-10-10 16:27:22,947 INFO L226 Difference]: Without dead ends: 3531 [2018-10-10 16:27:22,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52869 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=21322, Invalid=99434, Unknown=0, NotChecked=0, Total=120756 [2018-10-10 16:27:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2018-10-10 16:27:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3510. [2018-10-10 16:27:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3510 states. [2018-10-10 16:27:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 3530 transitions. [2018-10-10 16:27:22,979 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 3530 transitions. Word has length 3303 [2018-10-10 16:27:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:22,981 INFO L481 AbstractCegarLoop]: Abstraction has 3510 states and 3530 transitions. [2018-10-10 16:27:22,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 16:27:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 3530 transitions. [2018-10-10 16:27:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3510 [2018-10-10 16:27:23,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:23,077 INFO L375 BasicCegarLoop]: trace histogram [194, 193, 193, 193, 193, 193, 193, 193, 193, 193, 193, 193, 193, 193, 193, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:23,077 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:23,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130107, now seen corresponding path program 52 times [2018-10-10 16:27:23,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 288800 backedges. 243519 proven. 32683 refuted. 0 times theorem prover too weak. 12598 trivial. 0 not checked. [2018-10-10 16:27:32,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:32,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 16:27:32,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 16:27:32,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 16:27:32,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=687, Invalid=4425, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:27:32,874 INFO L87 Difference]: Start difference. First operand 3510 states and 3530 transitions. Second operand 72 states. [2018-10-10 16:27:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:36,937 INFO L93 Difference]: Finished difference Result 3567 states and 3587 transitions. [2018-10-10 16:27:36,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-10 16:27:36,937 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 3509 [2018-10-10 16:27:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:36,942 INFO L225 Difference]: With dead ends: 3567 [2018-10-10 16:27:36,942 INFO L226 Difference]: Without dead ends: 3567 [2018-10-10 16:27:36,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5708 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4488, Invalid=19074, Unknown=0, NotChecked=0, Total=23562 [2018-10-10 16:27:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2018-10-10 16:27:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3539. [2018-10-10 16:27:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3539 states. [2018-10-10 16:27:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 3559 transitions. [2018-10-10 16:27:36,962 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 3559 transitions. Word has length 3509 [2018-10-10 16:27:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:36,963 INFO L481 AbstractCegarLoop]: Abstraction has 3539 states and 3559 transitions. [2018-10-10 16:27:36,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 16:27:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 3559 transitions. [2018-10-10 16:27:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3525 [2018-10-10 16:27:37,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:37,021 INFO L375 BasicCegarLoop]: trace histogram [195, 194, 194, 194, 194, 194, 194, 194, 194, 194, 194, 194, 194, 194, 194, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:37,022 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:37,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash 142493205, now seen corresponding path program 53 times [2018-10-10 16:27:37,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 291719 backedges. 246082 proven. 30454 refuted. 0 times theorem prover too weak. 15183 trivial. 0 not checked. [2018-10-10 16:27:48,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:48,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 16:27:48,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 16:27:48,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 16:27:48,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=4186, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 16:27:48,093 INFO L87 Difference]: Start difference. First operand 3539 states and 3559 transitions. Second operand 70 states. [2018-10-10 16:27:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:54,066 INFO L93 Difference]: Finished difference Result 3595 states and 3615 transitions. [2018-10-10 16:27:54,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-10 16:27:54,067 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 3524 [2018-10-10 16:27:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:54,071 INFO L225 Difference]: With dead ends: 3595 [2018-10-10 16:27:54,071 INFO L226 Difference]: Without dead ends: 3595 [2018-10-10 16:27:54,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5414 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4240, Invalid=18110, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 16:27:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2018-10-10 16:27:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 3554. [2018-10-10 16:27:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3554 states. [2018-10-10 16:27:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 3574 transitions. [2018-10-10 16:27:54,088 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 3574 transitions. Word has length 3524 [2018-10-10 16:27:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:54,089 INFO L481 AbstractCegarLoop]: Abstraction has 3554 states and 3574 transitions. [2018-10-10 16:27:54,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 16:27:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 3574 transitions. [2018-10-10 16:27:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3540 [2018-10-10 16:27:54,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:54,147 INFO L375 BasicCegarLoop]: trace histogram [196, 195, 195, 195, 195, 195, 195, 195, 195, 195, 195, 195, 195, 195, 195, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:54,147 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:54,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash -134972717, now seen corresponding path program 54 times [2018-10-10 16:27:54,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 294653 backedges. 241298 proven. 25996 refuted. 0 times theorem prover too weak. 27359 trivial. 0 not checked. [2018-10-10 16:28:03,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:03,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 16:28:03,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 16:28:03,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 16:28:03,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=3726, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 16:28:03,111 INFO L87 Difference]: Start difference. First operand 3554 states and 3574 transitions. Second operand 66 states. [2018-10-10 16:28:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:08,701 INFO L93 Difference]: Finished difference Result 3651 states and 3671 transitions. [2018-10-10 16:28:08,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 16:28:08,702 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 3539 [2018-10-10 16:28:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:08,706 INFO L225 Difference]: With dead ends: 3651 [2018-10-10 16:28:08,706 INFO L226 Difference]: Without dead ends: 3651 [2018-10-10 16:28:08,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4844 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3774, Invalid=16248, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 16:28:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2018-10-10 16:28:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3584. [2018-10-10 16:28:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2018-10-10 16:28:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 3604 transitions. [2018-10-10 16:28:08,722 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 3604 transitions. Word has length 3539 [2018-10-10 16:28:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:08,723 INFO L481 AbstractCegarLoop]: Abstraction has 3584 states and 3604 transitions. [2018-10-10 16:28:08,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 16:28:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 3604 transitions. [2018-10-10 16:28:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3570 [2018-10-10 16:28:08,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:08,784 INFO L375 BasicCegarLoop]: trace histogram [198, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:08,784 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:08,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2115081119, now seen corresponding path program 55 times [2018-10-10 16:28:08,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 300566 backedges. 356 proven. 286571 refuted. 0 times theorem prover too weak. 13639 trivial. 0 not checked. [2018-10-10 16:28:19,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:19,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 16:28:19,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 16:28:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 16:28:19,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=3041, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 16:28:19,427 INFO L87 Difference]: Start difference. First operand 3584 states and 3604 transitions. Second operand 61 states. [2018-10-10 16:28:36,425 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:28:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:47,236 INFO L93 Difference]: Finished difference Result 3969 states and 3993 transitions. [2018-10-10 16:28:47,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 513 states. [2018-10-10 16:28:47,237 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 3569 [2018-10-10 16:28:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:47,242 INFO L225 Difference]: With dead ends: 3969 [2018-10-10 16:28:47,242 INFO L226 Difference]: Without dead ends: 3969 [2018-10-10 16:28:47,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 569 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163765 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=58942, Invalid=266528, Unknown=0, NotChecked=0, Total=325470 [2018-10-10 16:28:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3969 states. [2018-10-10 16:28:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3969 to 3805. [2018-10-10 16:28:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3805 states. [2018-10-10 16:28:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 3826 transitions. [2018-10-10 16:28:47,268 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 3826 transitions. Word has length 3569 [2018-10-10 16:28:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:47,269 INFO L481 AbstractCegarLoop]: Abstraction has 3805 states and 3826 transitions. [2018-10-10 16:28:47,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 16:28:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 3826 transitions. [2018-10-10 16:28:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3791 [2018-10-10 16:28:47,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:47,337 INFO L375 BasicCegarLoop]: trace histogram [211, 210, 210, 210, 210, 210, 210, 210, 210, 210, 210, 210, 210, 210, 210, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:47,337 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:47,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:47,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1621830960, now seen corresponding path program 56 times [2018-10-10 16:28:47,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 341256 backedges. 265094 proven. 23767 refuted. 0 times theorem prover too weak. 52395 trivial. 0 not checked. [2018-10-10 16:28:56,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:56,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 16:28:57,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 16:28:57,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 16:28:57,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=3505, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:28:57,000 INFO L87 Difference]: Start difference. First operand 3805 states and 3826 transitions. Second operand 64 states. [2018-10-10 16:29:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:02,368 INFO L93 Difference]: Finished difference Result 3913 states and 3934 transitions. [2018-10-10 16:29:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 16:29:02,369 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 3790 [2018-10-10 16:29:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:02,373 INFO L225 Difference]: With dead ends: 3913 [2018-10-10 16:29:02,373 INFO L226 Difference]: Without dead ends: 3913 [2018-10-10 16:29:02,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4568 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3556, Invalid=15350, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 16:29:02,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2018-10-10 16:29:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3820. [2018-10-10 16:29:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3820 states. [2018-10-10 16:29:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 3841 transitions. [2018-10-10 16:29:02,397 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 3841 transitions. Word has length 3790 [2018-10-10 16:29:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:02,399 INFO L481 AbstractCegarLoop]: Abstraction has 3820 states and 3841 transitions. [2018-10-10 16:29:02,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 16:29:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 3841 transitions. [2018-10-10 16:29:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3806 [2018-10-10 16:29:02,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:02,474 INFO L375 BasicCegarLoop]: trace histogram [212, 211, 211, 211, 211, 211, 211, 211, 211, 211, 211, 211, 211, 211, 211, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:02,475 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:02,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:02,475 INFO L82 PathProgramCache]: Analyzing trace with hash -272164040, now seen corresponding path program 57 times [2018-10-10 16:29:02,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 344431 backedges. 0 proven. 328921 refuted. 0 times theorem prover too weak. 15510 trivial. 0 not checked. [2018-10-10 16:29:13,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:13,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 16:29:13,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 16:29:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 16:29:13,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=2333, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:29:13,058 INFO L87 Difference]: Start difference. First operand 3820 states and 3841 transitions. Second operand 55 states. [2018-10-10 16:29:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:24,367 INFO L93 Difference]: Finished difference Result 4061 states and 4083 transitions. [2018-10-10 16:29:24,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2018-10-10 16:29:24,367 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 3805 [2018-10-10 16:29:24,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:24,372 INFO L225 Difference]: With dead ends: 4061 [2018-10-10 16:29:24,372 INFO L226 Difference]: Without dead ends: 4061 [2018-10-10 16:29:24,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33983 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=16275, Invalid=67535, Unknown=0, NotChecked=0, Total=83810 [2018-10-10 16:29:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2018-10-10 16:29:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 4041. [2018-10-10 16:29:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4041 states. [2018-10-10 16:29:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 4041 states and 4063 transitions. [2018-10-10 16:29:24,400 INFO L78 Accepts]: Start accepts. Automaton has 4041 states and 4063 transitions. Word has length 3805 [2018-10-10 16:29:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:24,401 INFO L481 AbstractCegarLoop]: Abstraction has 4041 states and 4063 transitions. [2018-10-10 16:29:24,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 16:29:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4041 states and 4063 transitions. [2018-10-10 16:29:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4027 [2018-10-10 16:29:24,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:24,476 INFO L375 BasicCegarLoop]: trace histogram [225, 224, 224, 224, 224, 224, 224, 224, 224, 224, 224, 224, 224, 224, 224, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:24,476 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:24,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash -596856999, now seen corresponding path program 58 times [2018-10-10 16:29:24,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 387904 backedges. 0 proven. 371211 refuted. 0 times theorem prover too weak. 16693 trivial. 0 not checked. [2018-10-10 16:29:36,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:36,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 16:29:36,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 16:29:36,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 16:29:36,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=688, Invalid=2504, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 16:29:36,472 INFO L87 Difference]: Start difference. First operand 4041 states and 4063 transitions. Second operand 57 states. [2018-10-10 16:29:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:48,368 INFO L93 Difference]: Finished difference Result 4282 states and 4305 transitions. [2018-10-10 16:29:48,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2018-10-10 16:29:48,369 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 4026 [2018-10-10 16:29:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:48,372 INFO L225 Difference]: With dead ends: 4282 [2018-10-10 16:29:48,372 INFO L226 Difference]: Without dead ends: 4282 [2018-10-10 16:29:48,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36960 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=17629, Invalid=73273, Unknown=0, NotChecked=0, Total=90902 [2018-10-10 16:29:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2018-10-10 16:29:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 4262. [2018-10-10 16:29:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4262 states. [2018-10-10 16:29:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 4285 transitions. [2018-10-10 16:29:48,403 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 4285 transitions. Word has length 4026 [2018-10-10 16:29:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:48,405 INFO L481 AbstractCegarLoop]: Abstraction has 4262 states and 4285 transitions. [2018-10-10 16:29:48,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 16:29:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 4285 transitions. [2018-10-10 16:29:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4248 [2018-10-10 16:29:48,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:48,498 INFO L375 BasicCegarLoop]: trace histogram [238, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:48,498 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:48,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:48,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1425059112, now seen corresponding path program 59 times [2018-10-10 16:29:48,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 433964 backedges. 444 proven. 415922 refuted. 0 times theorem prover too weak. 17598 trivial. 0 not checked. [2018-10-10 16:30:01,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:01,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 16:30:01,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 16:30:01,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 16:30:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=764, Invalid=3142, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:30:01,522 INFO L87 Difference]: Start difference. First operand 4262 states and 4285 transitions. Second operand 63 states.