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/20181015-LoopsPathprograms/array_true-unreach-call4_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:21,582 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:21,585 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:21,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:21,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:21,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:21,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:21,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:21,603 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:21,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:21,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:21,605 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:21,606 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:21,607 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:21,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:21,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:21,610 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:21,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:21,615 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:21,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:21,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:21,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:21,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:21,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:21,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:21,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:21,624 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:21,625 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:21,626 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:21,628 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:21,628 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:21,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:21,629 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:21,629 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:21,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:21,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:21,632 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 12:55:21,642 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:21,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:21,643 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:21,643 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:21,643 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:21,644 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:21,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:21,645 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:21,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:21,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:21,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:21,645 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:21,646 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:21,647 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:21,647 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:21,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:21,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:21,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:21,709 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:21,710 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:21,711 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call4_true-termination.i_3.bpl [2018-10-15 12:55:21,711 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call4_true-termination.i_3.bpl' [2018-10-15 12:55:21,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:21,776 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:21,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:21,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:21,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:21,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:21,846 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:21,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 12:55:21,931 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:21,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:21,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:22,488 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:22,489 INFO L202 PluginConnector]: Adding new model array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22 BoogieIcfgContainer [2018-10-15 12:55:22,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:22,490 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:22,490 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:22,491 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:22,494 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22" (1/1) ... [2018-10-15 12:55:22,501 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-15 12:55:22,501 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-15 12:55:22,534 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-15 12:55:22,584 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-15 12:55:22,602 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-15 12:55:22,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-15 12:55:25,244 INFO L315 AbstractInterpreter]: Visited 39 different actions 66 times. Merged at 21 different actions 25 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-10-15 12:55:25,247 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-15 12:55:25,251 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-15 12:55:25,292 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_#memory_int_5_1_1| |v_ULTIMATE.start_main_~#A~0.base_5|) at (#memory_int := #memory_int[main_~#A~0.base := #memory_int[main_~#A~0.base][main_~#A~0.offset + 4 * main_~i~0 := main_#t~nondet1]];) [2018-10-15 12:55:25,302 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_2|) |v_ULTIMATE.start_read~int_#ptr.offset_2|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-15 12:55:25,331 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_#memory_int_2_1_1| |v_ULTIMATE.start_main_~#A~0.base_3|) at (#memory_int := #memory_int[main_~#A~0.base := #memory_int[main_~#A~0.base][main_~#A~0.offset + 4092 := 0]];) [2018-10-15 12:55:25,334 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-15 12:55:25,334 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-10-15 12:55:25,334 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:25,336 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-15 12:55:25,336 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,336 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:25,337 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-15 12:55:25,337 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,338 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-15 12:55:25,358 INFO L202 PluginConnector]: Adding new model array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:25 BasicIcfg [2018-10-15 12:55:25,358 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:25,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:25,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:25,365 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:25,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/3) ... [2018-10-15 12:55:25,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c29d0a and model type array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:55:25, skipping insertion in model container [2018-10-15 12:55:25,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22" (2/3) ... [2018-10-15 12:55:25,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c29d0a and model type array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:55:25, skipping insertion in model container [2018-10-15 12:55:25,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call4_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:25" (3/3) ... [2018-10-15 12:55:25,372 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-15 12:55:25,384 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:25,394 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:25,414 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:25,442 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:25,442 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:25,443 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:25,443 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:25,443 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:25,443 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:25,443 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:25,444 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:25,446 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-10-15 12:55:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:55:25,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:25,476 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] [2018-10-15 12:55:25,477 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:25,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1466848372, now seen corresponding path program 1 times [2018-10-15 12:55:25,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:25,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:25,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:25,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:25,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:25,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:25,766 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-10-15 12:55:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:25,911 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-15 12:55:25,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:25,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-15 12:55:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:25,922 INFO L225 Difference]: With dead ends: 43 [2018-10-15 12:55:25,922 INFO L226 Difference]: Without dead ends: 43 [2018-10-15 12:55:25,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-15 12:55:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-10-15 12:55:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 12:55:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 12:55:26,021 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 30 [2018-10-15 12:55:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:26,024 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 12:55:26,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 12:55:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 12:55:26,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,026 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] [2018-10-15 12:55:26,026 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1027533067, now seen corresponding path program 1 times [2018-10-15 12:55:26,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:26,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:26,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:26,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:26,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:26,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:26,162 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 5 states. [2018-10-15 12:55:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:26,531 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-15 12:55:26,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:55:26,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-15 12:55:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:26,534 INFO L225 Difference]: With dead ends: 50 [2018-10-15 12:55:26,534 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 12:55:26,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 12:55:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2018-10-15 12:55:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 12:55:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 12:55:26,546 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 37 [2018-10-15 12:55:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:26,547 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 12:55:26,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 12:55:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 12:55:26,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,550 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:26,550 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1403498836, now seen corresponding path program 2 times [2018-10-15 12:55:26,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:26,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:26,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:55:26,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:55:26,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:55:26,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:26,753 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 7 states. [2018-10-15 12:55:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,206 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 12:55:27,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:55:27,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-10-15 12:55:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,210 INFO L225 Difference]: With dead ends: 57 [2018-10-15 12:55:27,210 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 12:55:27,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 12:55:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-10-15 12:55:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-15 12:55:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-15 12:55:27,226 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2018-10-15 12:55:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,226 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-15 12:55:27,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:55:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-15 12:55:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-15 12:55:27,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,228 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:27,229 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash 361725461, now seen corresponding path program 3 times [2018-10-15 12:55:27,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:27,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:27,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:27,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:27,419 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 9 states. [2018-10-15 12:55:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,623 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 12:55:27,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:55:27,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-10-15 12:55:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,627 INFO L225 Difference]: With dead ends: 64 [2018-10-15 12:55:27,627 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 12:55:27,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 12:55:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-10-15 12:55:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 12:55:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 12:55:27,635 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 51 [2018-10-15 12:55:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,636 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 12:55:27,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 12:55:27,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 12:55:27,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,638 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:27,638 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1917650484, now seen corresponding path program 4 times [2018-10-15 12:55:27,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:28,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:28,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:28,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:28,127 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 11 states. [2018-10-15 12:55:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:28,617 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-15 12:55:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:55:28,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-10-15 12:55:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:28,619 INFO L225 Difference]: With dead ends: 71 [2018-10-15 12:55:28,620 INFO L226 Difference]: Without dead ends: 71 [2018-10-15 12:55:28,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:28,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-15 12:55:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2018-10-15 12:55:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-15 12:55:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-15 12:55:28,626 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 58 [2018-10-15 12:55:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:28,627 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-15 12:55:28,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-15 12:55:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 12:55:28,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:28,629 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:28,629 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:28,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:28,629 INFO L82 PathProgramCache]: Analyzing trace with hash -351605451, now seen corresponding path program 5 times [2018-10-15 12:55:28,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:28,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:28,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:28,885 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 13 states. [2018-10-15 12:55:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,142 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 12:55:29,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:55:29,144 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-10-15 12:55:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,145 INFO L225 Difference]: With dead ends: 78 [2018-10-15 12:55:29,145 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 12:55:29,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 12:55:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2018-10-15 12:55:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 12:55:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 12:55:29,152 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 65 [2018-10-15 12:55:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,152 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 12:55:29,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:29,152 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 12:55:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 12:55:29,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,154 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:29,154 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash 722227988, now seen corresponding path program 6 times [2018-10-15 12:55:29,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:29,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:29,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:29,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:29,374 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 15 states. [2018-10-15 12:55:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,668 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-15 12:55:29,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:55:29,669 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-10-15 12:55:29,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,671 INFO L225 Difference]: With dead ends: 85 [2018-10-15 12:55:29,671 INFO L226 Difference]: Without dead ends: 85 [2018-10-15 12:55:29,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-15 12:55:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-10-15 12:55:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 12:55:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-15 12:55:29,677 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 72 [2018-10-15 12:55:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,677 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-15 12:55:29,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-15 12:55:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:55:29,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,679 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:29,679 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1808098389, now seen corresponding path program 7 times [2018-10-15 12:55:29,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:29,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:29,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:29,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:29,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:29,916 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 17 states. [2018-10-15 12:55:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:30,269 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-15 12:55:30,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:55:30,269 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2018-10-15 12:55:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:30,271 INFO L225 Difference]: With dead ends: 92 [2018-10-15 12:55:30,271 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 12:55:30,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 12:55:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-10-15 12:55:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 12:55:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-15 12:55:30,278 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 79 [2018-10-15 12:55:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:30,278 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-15 12:55:30,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-15 12:55:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 12:55:30,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:30,280 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:30,280 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:30,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash -317483020, now seen corresponding path program 8 times [2018-10-15 12:55:30,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:30,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:30,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:30,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:30,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:30,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:30,624 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 19 states. [2018-10-15 12:55:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:31,195 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 12:55:31,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:55:31,196 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-10-15 12:55:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:31,197 INFO L225 Difference]: With dead ends: 99 [2018-10-15 12:55:31,197 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 12:55:31,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 12:55:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2018-10-15 12:55:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-15 12:55:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-15 12:55:31,204 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 86 [2018-10-15 12:55:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:31,205 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-15 12:55:31,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-15 12:55:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-15 12:55:31,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:31,206 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:31,207 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:31,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:31,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1490084725, now seen corresponding path program 9 times [2018-10-15 12:55:31,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:31,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:31,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:31,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:31,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:31,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:31,540 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 21 states. [2018-10-15 12:55:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:32,105 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-15 12:55:32,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:55:32,105 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2018-10-15 12:55:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:32,106 INFO L225 Difference]: With dead ends: 106 [2018-10-15 12:55:32,107 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 12:55:32,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 12:55:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2018-10-15 12:55:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 12:55:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 12:55:32,115 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 93 [2018-10-15 12:55:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:32,115 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 12:55:32,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 12:55:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:55:32,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:32,117 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:32,118 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:32,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:32,118 INFO L82 PathProgramCache]: Analyzing trace with hash -15674156, now seen corresponding path program 10 times [2018-10-15 12:55:32,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:33,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:33,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:33,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:33,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:33,158 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 23 states. [2018-10-15 12:55:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:33,646 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-15 12:55:33,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:55:33,646 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2018-10-15 12:55:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:33,648 INFO L225 Difference]: With dead ends: 113 [2018-10-15 12:55:33,648 INFO L226 Difference]: Without dead ends: 113 [2018-10-15 12:55:33,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-15 12:55:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-10-15 12:55:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-15 12:55:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-15 12:55:33,655 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 100 [2018-10-15 12:55:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:33,656 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-15 12:55:33,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-15 12:55:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 12:55:33,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:33,658 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:33,658 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:33,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:33,659 INFO L82 PathProgramCache]: Analyzing trace with hash 733964949, now seen corresponding path program 11 times [2018-10-15 12:55:33,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:34,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:34,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:34,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:34,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:34,021 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 25 states. [2018-10-15 12:55:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:34,701 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-15 12:55:34,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:55:34,702 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 107 [2018-10-15 12:55:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:34,704 INFO L225 Difference]: With dead ends: 120 [2018-10-15 12:55:34,704 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 12:55:34,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 12:55:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2018-10-15 12:55:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:55:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 12:55:34,709 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 107 [2018-10-15 12:55:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:34,710 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 12:55:34,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 12:55:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:55:34,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:34,712 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:34,713 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:34,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1597114804, now seen corresponding path program 12 times [2018-10-15 12:55:34,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:35,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:35,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:35,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:35,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:35,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:35,075 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 27 states. [2018-10-15 12:55:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:35,663 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-15 12:55:35,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:55:35,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 114 [2018-10-15 12:55:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:35,666 INFO L225 Difference]: With dead ends: 127 [2018-10-15 12:55:35,666 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 12:55:35,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 12:55:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-10-15 12:55:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 12:55:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-15 12:55:35,670 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 114 [2018-10-15 12:55:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:35,670 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-15 12:55:35,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-15 12:55:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 12:55:35,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:35,672 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:35,672 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:35,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash 916650421, now seen corresponding path program 13 times [2018-10-15 12:55:35,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:36,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:36,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:36,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:36,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:36,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:36,294 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 29 states. [2018-10-15 12:55:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,537 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 12:55:37,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:55:37,538 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 121 [2018-10-15 12:55:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,539 INFO L225 Difference]: With dead ends: 134 [2018-10-15 12:55:37,539 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 12:55:37,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:55:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 12:55:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2018-10-15 12:55:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 12:55:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-15 12:55:37,544 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 121 [2018-10-15 12:55:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,544 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-15 12:55:37,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-15 12:55:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 12:55:37,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,546 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:37,546 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1557842284, now seen corresponding path program 14 times [2018-10-15 12:55:37,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:37,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:37,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:37,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:37,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:37,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:37,995 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 31 states. [2018-10-15 12:55:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,801 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-15 12:55:38,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:55:38,802 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2018-10-15 12:55:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,803 INFO L225 Difference]: With dead ends: 141 [2018-10-15 12:55:38,803 INFO L226 Difference]: Without dead ends: 141 [2018-10-15 12:55:38,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:55:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-15 12:55:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2018-10-15 12:55:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-15 12:55:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-15 12:55:38,809 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 128 [2018-10-15 12:55:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,809 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-15 12:55:38,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-15 12:55:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 12:55:38,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,810 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:38,810 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1005743915, now seen corresponding path program 15 times [2018-10-15 12:55:38,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:39,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:39,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:39,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:39,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:39,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:39,276 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 33 states. [2018-10-15 12:55:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:40,038 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 12:55:40,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:55:40,039 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 135 [2018-10-15 12:55:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:40,041 INFO L225 Difference]: With dead ends: 148 [2018-10-15 12:55:40,042 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 12:55:40,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:55:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 12:55:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-10-15 12:55:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 12:55:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-15 12:55:40,049 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 135 [2018-10-15 12:55:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:40,049 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-15 12:55:40,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-15 12:55:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:55:40,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:40,051 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:40,051 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:40,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:40,051 INFO L82 PathProgramCache]: Analyzing trace with hash -669492364, now seen corresponding path program 16 times [2018-10-15 12:55:40,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:40,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:40,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:40,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:40,743 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 35 states. [2018-10-15 12:55:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:41,603 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-15 12:55:41,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:55:41,603 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-10-15 12:55:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:41,605 INFO L225 Difference]: With dead ends: 155 [2018-10-15 12:55:41,605 INFO L226 Difference]: Without dead ends: 155 [2018-10-15 12:55:41,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:55:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-15 12:55:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2018-10-15 12:55:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 12:55:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-15 12:55:41,611 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 142 [2018-10-15 12:55:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,611 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-15 12:55:41,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:55:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-15 12:55:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:55:41,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,613 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:41,613 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,613 INFO L82 PathProgramCache]: Analyzing trace with hash 923873269, now seen corresponding path program 17 times [2018-10-15 12:55:41,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:42,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:42,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:55:42,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:55:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:55:42,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:42,533 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 37 states. [2018-10-15 12:55:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:43,346 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 12:55:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:55:43,346 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 149 [2018-10-15 12:55:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:43,348 INFO L225 Difference]: With dead ends: 162 [2018-10-15 12:55:43,348 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 12:55:43,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:55:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 12:55:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2018-10-15 12:55:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 12:55:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 12:55:43,353 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 149 [2018-10-15 12:55:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:43,353 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 12:55:43,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:55:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 12:55:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 12:55:43,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:43,355 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:43,355 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:43,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:43,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1656322132, now seen corresponding path program 18 times [2018-10-15 12:55:43,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:43,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:43,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:55:43,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:55:43,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:55:43,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:43,918 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 39 states. [2018-10-15 12:55:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:45,049 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 12:55:45,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:55:45,050 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 156 [2018-10-15 12:55:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:45,051 INFO L225 Difference]: With dead ends: 169 [2018-10-15 12:55:45,052 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 12:55:45,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:55:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 12:55:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2018-10-15 12:55:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:55:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-15 12:55:45,058 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 156 [2018-10-15 12:55:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:45,058 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-15 12:55:45,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:55:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-15 12:55:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:55:45,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:45,059 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:45,059 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:45,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:45,059 INFO L82 PathProgramCache]: Analyzing trace with hash 725604117, now seen corresponding path program 19 times [2018-10-15 12:55:45,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:46,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:46,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:55:46,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:55:46,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:55:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:55:46,019 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 41 states. [2018-10-15 12:55:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:47,321 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-15 12:55:47,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:55:47,321 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-10-15 12:55:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:47,323 INFO L225 Difference]: With dead ends: 176 [2018-10-15 12:55:47,323 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 12:55:47,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:55:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 12:55:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2018-10-15 12:55:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 12:55:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 12:55:47,329 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 163 [2018-10-15 12:55:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:47,329 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 12:55:47,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:55:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 12:55:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 12:55:47,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:47,331 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:47,331 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:47,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash -550073036, now seen corresponding path program 20 times [2018-10-15 12:55:47,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:47,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:47,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:55:47,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:55:47,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:55:47,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:47,970 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 43 states. [2018-10-15 12:55:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:49,239 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-15 12:55:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:55:49,240 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-10-15 12:55:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:49,242 INFO L225 Difference]: With dead ends: 183 [2018-10-15 12:55:49,242 INFO L226 Difference]: Without dead ends: 183 [2018-10-15 12:55:49,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:55:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-15 12:55:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2018-10-15 12:55:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-15 12:55:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-10-15 12:55:49,249 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 170 [2018-10-15 12:55:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:49,249 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-10-15 12:55:49,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:55:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-10-15 12:55:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-15 12:55:49,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:49,251 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:49,251 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:49,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:49,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1800698315, now seen corresponding path program 21 times [2018-10-15 12:55:49,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:50,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:50,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:55:50,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:55:50,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:55:50,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:55:50,103 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 45 states. [2018-10-15 12:55:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:51,379 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-15 12:55:51,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:55:51,382 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 177 [2018-10-15 12:55:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:51,384 INFO L225 Difference]: With dead ends: 190 [2018-10-15 12:55:51,384 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 12:55:51,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:55:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 12:55:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185. [2018-10-15 12:55:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 12:55:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-15 12:55:51,388 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 177 [2018-10-15 12:55:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:51,389 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-15 12:55:51,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:55:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-15 12:55:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:55:51,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:51,389 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:51,390 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:51,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash 20814356, now seen corresponding path program 22 times [2018-10-15 12:55:51,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 0 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:52,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:52,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:55:52,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:55:52,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:55:52,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:52,953 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 47 states. [2018-10-15 12:55:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:54,347 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-15 12:55:54,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:55:54,347 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 184 [2018-10-15 12:55:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:54,349 INFO L225 Difference]: With dead ends: 197 [2018-10-15 12:55:54,349 INFO L226 Difference]: Without dead ends: 197 [2018-10-15 12:55:54,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:55:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-15 12:55:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2018-10-15 12:55:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-15 12:55:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-15 12:55:54,354 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 184 [2018-10-15 12:55:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:54,354 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-15 12:55:54,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:55:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-15 12:55:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-15 12:55:54,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:54,356 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:54,356 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:54,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash -538559147, now seen corresponding path program 23 times [2018-10-15 12:55:54,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:55,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:55,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:55:55,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:55:55,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:55:55,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:55:55,891 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 49 states. [2018-10-15 12:55:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:57,415 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-15 12:55:57,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:55:57,415 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 191 [2018-10-15 12:55:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:57,417 INFO L225 Difference]: With dead ends: 204 [2018-10-15 12:55:57,417 INFO L226 Difference]: Without dead ends: 204 [2018-10-15 12:55:57,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:55:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-15 12:55:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2018-10-15 12:55:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-15 12:55:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-15 12:55:57,423 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 191 [2018-10-15 12:55:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:57,423 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-15 12:55:57,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:55:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-15 12:55:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-15 12:55:57,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:57,425 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:55:57,425 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:57,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:57,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1945935604, now seen corresponding path program 24 times [2018-10-15 12:55:57,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 0 proven. 1956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:58,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:58,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:55:58,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:55:58,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:55:58,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:58,789 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 51 states. [2018-10-15 12:56:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:00,432 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-15 12:56:00,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:56:00,432 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-10-15 12:56:00,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:00,434 INFO L225 Difference]: With dead ends: 211 [2018-10-15 12:56:00,434 INFO L226 Difference]: Without dead ends: 211 [2018-10-15 12:56:00,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:56:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-15 12:56:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2018-10-15 12:56:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 12:56:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-15 12:56:00,439 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 198 [2018-10-15 12:56:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:00,439 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-15 12:56:00,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:56:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-15 12:56:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-15 12:56:00,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:00,441 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 12:56:00,441 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:00,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash 302120053, now seen corresponding path program 25 times [2018-10-15 12:56:00,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 0 proven. 2125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:01,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:01,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:01,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:01,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:01,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:01,460 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 53 states. [2018-10-15 12:56:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:03,366 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-15 12:56:03,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:56:03,366 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 205 [2018-10-15 12:56:03,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:03,368 INFO L225 Difference]: With dead ends: 218 [2018-10-15 12:56:03,368 INFO L226 Difference]: Without dead ends: 218 [2018-10-15 12:56:03,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:56:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-15 12:56:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2018-10-15 12:56:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 12:56:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-15 12:56:03,374 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 205 [2018-10-15 12:56:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:03,374 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-15 12:56:03,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-15 12:56:03,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 12:56:03,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:03,376 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:03,376 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:03,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:03,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1172202540, now seen corresponding path program 26 times [2018-10-15 12:56:03,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:04,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:04,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:04,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:04,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:04,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:04,584 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 55 states. [2018-10-15 12:56:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:07,065 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-15 12:56:07,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:56:07,066 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2018-10-15 12:56:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:07,067 INFO L225 Difference]: With dead ends: 225 [2018-10-15 12:56:07,067 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 12:56:07,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:56:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 12:56:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2018-10-15 12:56:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 12:56:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-10-15 12:56:07,072 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 212 [2018-10-15 12:56:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:07,072 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-10-15 12:56:07,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-10-15 12:56:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 12:56:07,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:07,074 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:07,074 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:07,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash -393165931, now seen corresponding path program 27 times [2018-10-15 12:56:07,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2484 backedges. 0 proven. 2484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:10,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:10,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:10,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:10,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:10,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:10,143 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 57 states. [2018-10-15 12:56:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:11,961 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-15 12:56:11,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:56:11,962 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 219 [2018-10-15 12:56:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:11,963 INFO L225 Difference]: With dead ends: 232 [2018-10-15 12:56:11,963 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 12:56:11,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:56:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 12:56:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2018-10-15 12:56:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 12:56:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 12:56:11,968 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 219 [2018-10-15 12:56:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:11,969 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 12:56:11,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:56:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 12:56:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:56:11,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:11,970 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:11,970 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:11,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:11,971 INFO L82 PathProgramCache]: Analyzing trace with hash 232427700, now seen corresponding path program 28 times [2018-10-15 12:56:11,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2674 backedges. 0 proven. 2674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:13,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:13,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:56:13,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:56:13,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:56:13,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:13,376 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 59 states. [2018-10-15 12:56:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:15,385 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-15 12:56:15,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:56:15,385 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 226 [2018-10-15 12:56:15,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:15,387 INFO L225 Difference]: With dead ends: 239 [2018-10-15 12:56:15,387 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 12:56:15,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:56:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 12:56:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 234. [2018-10-15 12:56:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-15 12:56:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-15 12:56:15,392 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 226 [2018-10-15 12:56:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:15,392 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-15 12:56:15,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:56:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-15 12:56:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-15 12:56:15,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:15,394 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:15,394 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:15,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash -106655051, now seen corresponding path program 29 times [2018-10-15 12:56:15,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:16,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:16,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:56:16,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:56:16,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:56:16,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:16,611 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 61 states. [2018-10-15 12:56:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:19,064 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-15 12:56:19,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:56:19,068 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 233 [2018-10-15 12:56:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:19,069 INFO L225 Difference]: With dead ends: 246 [2018-10-15 12:56:19,070 INFO L226 Difference]: Without dead ends: 246 [2018-10-15 12:56:19,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:56:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-15 12:56:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 241. [2018-10-15 12:56:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 12:56:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-15 12:56:19,076 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 233 [2018-10-15 12:56:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:19,076 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-15 12:56:19,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:56:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-15 12:56:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 12:56:19,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:19,078 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:19,078 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:19,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:19,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1087733140, now seen corresponding path program 30 times [2018-10-15 12:56:19,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 0 proven. 3075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:20,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:20,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:56:20,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:56:20,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:56:20,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:20,921 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 63 states. [2018-10-15 12:56:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:23,480 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-15 12:56:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:56:23,480 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 240 [2018-10-15 12:56:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:23,481 INFO L225 Difference]: With dead ends: 253 [2018-10-15 12:56:23,482 INFO L226 Difference]: Without dead ends: 253 [2018-10-15 12:56:23,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:56:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-15 12:56:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2018-10-15 12:56:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 12:56:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-10-15 12:56:23,487 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 240 [2018-10-15 12:56:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:23,488 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-10-15 12:56:23,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:56:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-10-15 12:56:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 12:56:23,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:23,489 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:23,490 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:23,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash -741381675, now seen corresponding path program 31 times [2018-10-15 12:56:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3286 backedges. 0 proven. 3286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:25,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:25,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:56:25,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:56:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:56:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:25,947 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 65 states. [2018-10-15 12:56:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:28,684 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-15 12:56:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:56:28,684 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 247 [2018-10-15 12:56:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:28,686 INFO L225 Difference]: With dead ends: 260 [2018-10-15 12:56:28,686 INFO L226 Difference]: Without dead ends: 260 [2018-10-15 12:56:28,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:56:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-15 12:56:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 255. [2018-10-15 12:56:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-15 12:56:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-15 12:56:28,691 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 247 [2018-10-15 12:56:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:28,691 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-15 12:56:28,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:56:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-15 12:56:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-15 12:56:28,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:28,693 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:28,693 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:28,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1673502092, now seen corresponding path program 32 times [2018-10-15 12:56:28,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3504 backedges. 0 proven. 3504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:30,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:30,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:56:30,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:56:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:56:30,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:30,216 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 67 states. [2018-10-15 12:56:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:32,715 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-15 12:56:32,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:56:32,716 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 254 [2018-10-15 12:56:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:32,717 INFO L225 Difference]: With dead ends: 267 [2018-10-15 12:56:32,717 INFO L226 Difference]: Without dead ends: 267 [2018-10-15 12:56:32,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:56:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-15 12:56:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2018-10-15 12:56:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-15 12:56:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-15 12:56:32,723 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 254 [2018-10-15 12:56:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:32,723 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-15 12:56:32,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:56:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-15 12:56:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-15 12:56:32,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:32,725 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:32,725 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:32,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:32,725 INFO L82 PathProgramCache]: Analyzing trace with hash 505628917, now seen corresponding path program 33 times [2018-10-15 12:56:32,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3729 backedges. 0 proven. 3729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:34,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:34,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:56:34,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:56:34,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:56:34,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:34,829 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 69 states. [2018-10-15 12:56:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:37,387 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-15 12:56:37,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:56:37,388 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 261 [2018-10-15 12:56:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:37,390 INFO L225 Difference]: With dead ends: 274 [2018-10-15 12:56:37,390 INFO L226 Difference]: Without dead ends: 274 [2018-10-15 12:56:37,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:56:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-15 12:56:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 269. [2018-10-15 12:56:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-15 12:56:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-15 12:56:37,395 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 261 [2018-10-15 12:56:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:37,395 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-15 12:56:37,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:56:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-15 12:56:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-15 12:56:37,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:37,397 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:37,397 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:37,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1060552876, now seen corresponding path program 34 times [2018-10-15 12:56:37,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 0 proven. 3961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:39,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:39,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:56:39,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:56:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:56:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:39,709 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 71 states. [2018-10-15 12:56:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:42,500 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-15 12:56:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:56:42,501 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 268 [2018-10-15 12:56:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:42,503 INFO L225 Difference]: With dead ends: 281 [2018-10-15 12:56:42,503 INFO L226 Difference]: Without dead ends: 281 [2018-10-15 12:56:42,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:56:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-15 12:56:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 276. [2018-10-15 12:56:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-15 12:56:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-15 12:56:42,509 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 268 [2018-10-15 12:56:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:42,509 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-15 12:56:42,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:56:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-15 12:56:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-15 12:56:42,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:42,511 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:42,511 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:42,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:42,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1204670443, now seen corresponding path program 35 times [2018-10-15 12:56:42,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 0 proven. 4200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:44,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:44,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:56:44,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:56:44,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:56:44,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:44,451 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 73 states. [2018-10-15 12:56:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:47,378 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-10-15 12:56:47,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:56:47,379 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 275 [2018-10-15 12:56:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:47,380 INFO L225 Difference]: With dead ends: 288 [2018-10-15 12:56:47,380 INFO L226 Difference]: Without dead ends: 288 [2018-10-15 12:56:47,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:56:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-15 12:56:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 283. [2018-10-15 12:56:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-15 12:56:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-15 12:56:47,386 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 275 [2018-10-15 12:56:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:47,386 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-15 12:56:47,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:56:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-15 12:56:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 12:56:47,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:47,388 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:47,389 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:47,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2036460492, now seen corresponding path program 36 times [2018-10-15 12:56:47,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4446 backedges. 0 proven. 4446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:49,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:49,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:56:49,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:56:49,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:56:49,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:56:49,681 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 75 states. [2018-10-15 12:56:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:52,729 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-15 12:56:52,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:56:52,729 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 282 [2018-10-15 12:56:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:52,731 INFO L225 Difference]: With dead ends: 295 [2018-10-15 12:56:52,731 INFO L226 Difference]: Without dead ends: 295 [2018-10-15 12:56:52,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:56:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-15 12:56:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 290. [2018-10-15 12:56:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:56:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 12:56:52,736 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 282 [2018-10-15 12:56:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:52,736 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 12:56:52,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:56:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 12:56:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:56:52,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:52,738 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:52,738 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:52,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash -636608715, now seen corresponding path program 37 times [2018-10-15 12:56:52,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4699 backedges. 0 proven. 4699 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:54,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:54,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:56:54,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:56:54,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:56:54,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:56:54,884 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 77 states. [2018-10-15 12:56:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:57,996 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-15 12:56:57,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:56:57,996 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 289 [2018-10-15 12:56:57,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:57,999 INFO L225 Difference]: With dead ends: 302 [2018-10-15 12:56:57,999 INFO L226 Difference]: Without dead ends: 302 [2018-10-15 12:56:58,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:56:58,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-15 12:56:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2018-10-15 12:56:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-15 12:56:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-15 12:56:58,004 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 289 [2018-10-15 12:56:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:58,004 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-15 12:56:58,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:56:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-15 12:56:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 12:56:58,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:58,006 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:58,007 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:58,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:58,007 INFO L82 PathProgramCache]: Analyzing trace with hash -580067052, now seen corresponding path program 38 times [2018-10-15 12:56:58,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 0 proven. 4959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:00,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:00,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:57:00,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:57:00,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:57:00,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:57:00,244 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 79 states. [2018-10-15 12:57:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:03,612 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-15 12:57:03,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:57:03,612 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 296 [2018-10-15 12:57:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:03,613 INFO L225 Difference]: With dead ends: 309 [2018-10-15 12:57:03,614 INFO L226 Difference]: Without dead ends: 309 [2018-10-15 12:57:03,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:57:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-15 12:57:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2018-10-15 12:57:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-15 12:57:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-10-15 12:57:03,619 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 296 [2018-10-15 12:57:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:03,619 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-10-15 12:57:03,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:57:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-10-15 12:57:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-15 12:57:03,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:03,621 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:03,621 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:03,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:03,622 INFO L82 PathProgramCache]: Analyzing trace with hash 877205077, now seen corresponding path program 39 times [2018-10-15 12:57:03,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5226 backedges. 0 proven. 5226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:05,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:05,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:57:05,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:57:05,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:57:05,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:05,929 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 81 states. [2018-10-15 12:57:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:09,504 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2018-10-15 12:57:09,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:57:09,505 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 303 [2018-10-15 12:57:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:09,506 INFO L225 Difference]: With dead ends: 316 [2018-10-15 12:57:09,506 INFO L226 Difference]: Without dead ends: 316 [2018-10-15 12:57:09,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:57:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-15 12:57:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 311. [2018-10-15 12:57:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-15 12:57:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-15 12:57:09,510 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 303 [2018-10-15 12:57:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:09,511 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-15 12:57:09,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:57:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-15 12:57:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-15 12:57:09,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:09,512 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:09,513 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1402755596, now seen corresponding path program 40 times [2018-10-15 12:57:09,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5500 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:11,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:11,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:57:11,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:57:11,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:57:11,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:11,611 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 83 states. [2018-10-15 12:57:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:15,348 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-15 12:57:15,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:57:15,348 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 310 [2018-10-15 12:57:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:15,349 INFO L225 Difference]: With dead ends: 323 [2018-10-15 12:57:15,350 INFO L226 Difference]: Without dead ends: 323 [2018-10-15 12:57:15,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:57:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-15 12:57:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 318. [2018-10-15 12:57:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-15 12:57:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-10-15 12:57:15,353 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 310 [2018-10-15 12:57:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:15,353 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-10-15 12:57:15,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:57:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-10-15 12:57:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-15 12:57:15,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:15,355 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:15,355 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:15,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:15,355 INFO L82 PathProgramCache]: Analyzing trace with hash 267720053, now seen corresponding path program 41 times [2018-10-15 12:57:15,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5781 backedges. 0 proven. 5781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:17,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:17,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:57:17,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:57:17,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:57:17,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:17,571 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 85 states. [2018-10-15 12:57:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:21,462 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-10-15 12:57:21,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:57:21,463 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 317 [2018-10-15 12:57:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:21,465 INFO L225 Difference]: With dead ends: 330 [2018-10-15 12:57:21,465 INFO L226 Difference]: Without dead ends: 330 [2018-10-15 12:57:21,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:57:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-15 12:57:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 325. [2018-10-15 12:57:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-15 12:57:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-10-15 12:57:21,470 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 317 [2018-10-15 12:57:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:21,471 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-10-15 12:57:21,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:57:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-10-15 12:57:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-15 12:57:21,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:21,473 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:21,473 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:21,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1305451820, now seen corresponding path program 42 times [2018-10-15 12:57:21,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 0 proven. 6069 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:24,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:24,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:57:24,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:57:24,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:57:24,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:24,171 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 87 states. [2018-10-15 12:57:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:28,343 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-15 12:57:28,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:57:28,344 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 324 [2018-10-15 12:57:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:28,346 INFO L225 Difference]: With dead ends: 337 [2018-10-15 12:57:28,346 INFO L226 Difference]: Without dead ends: 337 [2018-10-15 12:57:28,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:57:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-15 12:57:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 332. [2018-10-15 12:57:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 12:57:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-15 12:57:28,351 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 324 [2018-10-15 12:57:28,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:28,351 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-15 12:57:28,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:57:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-15 12:57:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-15 12:57:28,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:28,354 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:28,354 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:28,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:28,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1856248981, now seen corresponding path program 43 times [2018-10-15 12:57:28,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6364 backedges. 0 proven. 6364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:31,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:31,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:57:31,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:57:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:57:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:31,069 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 89 states. [2018-10-15 12:57:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:35,405 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2018-10-15 12:57:35,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:57:35,405 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 331 [2018-10-15 12:57:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:35,407 INFO L225 Difference]: With dead ends: 344 [2018-10-15 12:57:35,407 INFO L226 Difference]: Without dead ends: 344 [2018-10-15 12:57:35,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:57:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-15 12:57:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 339. [2018-10-15 12:57:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-15 12:57:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-15 12:57:35,413 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 331 [2018-10-15 12:57:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:35,413 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-15 12:57:35,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:57:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-15 12:57:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-15 12:57:35,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:35,415 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:35,416 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:35,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:35,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1694570420, now seen corresponding path program 44 times [2018-10-15 12:57:35,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6666 backedges. 0 proven. 6666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:38,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:38,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:57:38,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:57:38,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:57:38,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:38,238 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 91 states. [2018-10-15 12:57:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:42,844 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-10-15 12:57:42,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:57:42,845 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 338 [2018-10-15 12:57:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:42,847 INFO L225 Difference]: With dead ends: 351 [2018-10-15 12:57:42,847 INFO L226 Difference]: Without dead ends: 351 [2018-10-15 12:57:42,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:57:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-15 12:57:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 346. [2018-10-15 12:57:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-15 12:57:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-10-15 12:57:42,852 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 338 [2018-10-15 12:57:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:42,853 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-10-15 12:57:42,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:57:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-10-15 12:57:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-15 12:57:42,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:42,855 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:42,855 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:42,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash 711470005, now seen corresponding path program 45 times [2018-10-15 12:57:42,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6975 backedges. 0 proven. 6975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:45,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:45,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:57:45,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:57:45,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:57:45,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:45,743 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 93 states. [2018-10-15 12:57:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:50,373 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-10-15 12:57:50,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:57:50,374 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 345 [2018-10-15 12:57:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:50,376 INFO L225 Difference]: With dead ends: 358 [2018-10-15 12:57:50,376 INFO L226 Difference]: Without dead ends: 358 [2018-10-15 12:57:50,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:57:50,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-15 12:57:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2018-10-15 12:57:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-15 12:57:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-15 12:57:50,382 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 345 [2018-10-15 12:57:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:50,382 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-15 12:57:50,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:57:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-15 12:57:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 12:57:50,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:50,384 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:50,385 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:50,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:50,385 INFO L82 PathProgramCache]: Analyzing trace with hash -763116396, now seen corresponding path program 46 times [2018-10-15 12:57:50,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7291 backedges. 0 proven. 7291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:53,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:53,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:57:53,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:57:53,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:57:53,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:57:53,087 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 95 states. [2018-10-15 12:57:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:58,535 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-15 12:57:58,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:57:58,536 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 352 [2018-10-15 12:57:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:58,537 INFO L225 Difference]: With dead ends: 365 [2018-10-15 12:57:58,537 INFO L226 Difference]: Without dead ends: 365 [2018-10-15 12:57:58,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:57:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-15 12:57:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 360. [2018-10-15 12:57:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-15 12:57:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2018-10-15 12:57:58,542 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 352 [2018-10-15 12:57:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:58,542 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2018-10-15 12:57:58,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:57:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2018-10-15 12:57:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 12:57:58,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:58,545 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:58,545 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:58,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash 366166741, now seen corresponding path program 47 times [2018-10-15 12:57:58,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7614 backedges. 0 proven. 7614 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:02,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:02,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:58:02,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:58:02,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:58:02,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:58:02,061 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand 97 states. [2018-10-15 12:58:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:07,090 INFO L93 Difference]: Finished difference Result 372 states and 372 transitions. [2018-10-15 12:58:07,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:58:07,090 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 359 [2018-10-15 12:58:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:07,092 INFO L225 Difference]: With dead ends: 372 [2018-10-15 12:58:07,092 INFO L226 Difference]: Without dead ends: 372 [2018-10-15 12:58:07,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:58:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-10-15 12:58:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2018-10-15 12:58:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-15 12:58:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-15 12:58:07,096 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 359 [2018-10-15 12:58:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:07,097 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-15 12:58:07,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:58:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-15 12:58:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-15 12:58:07,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:07,099 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:07,100 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:07,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:07,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2145806708, now seen corresponding path program 48 times [2018-10-15 12:58:07,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7944 backedges. 0 proven. 7944 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:10,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:10,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:58:10,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:58:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:58:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:10,058 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 99 states. [2018-10-15 12:58:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:15,246 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-10-15 12:58:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:58:15,246 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 366 [2018-10-15 12:58:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:15,248 INFO L225 Difference]: With dead ends: 379 [2018-10-15 12:58:15,248 INFO L226 Difference]: Without dead ends: 379 [2018-10-15 12:58:15,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:58:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-15 12:58:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 374. [2018-10-15 12:58:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:58:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 374 transitions. [2018-10-15 12:58:15,255 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 374 transitions. Word has length 366 [2018-10-15 12:58:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:15,255 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 374 transitions. [2018-10-15 12:58:15,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:58:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 374 transitions. [2018-10-15 12:58:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-15 12:58:15,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:15,258 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:15,258 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:15,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash 469197301, now seen corresponding path program 49 times [2018-10-15 12:58:15,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:18,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:18,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:58:18,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:58:18,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:58:18,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:18,516 INFO L87 Difference]: Start difference. First operand 374 states and 374 transitions. Second operand 101 states. [2018-10-15 12:58:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:23,957 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2018-10-15 12:58:23,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:58:23,957 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 373 [2018-10-15 12:58:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:23,959 INFO L225 Difference]: With dead ends: 386 [2018-10-15 12:58:23,959 INFO L226 Difference]: Without dead ends: 386 [2018-10-15 12:58:23,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:58:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-15 12:58:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 381. [2018-10-15 12:58:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-15 12:58:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-10-15 12:58:23,964 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 373 [2018-10-15 12:58:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:23,965 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-10-15 12:58:23,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:58:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-10-15 12:58:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-15 12:58:23,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:23,967 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:23,967 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:23,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1238828628, now seen corresponding path program 50 times [2018-10-15 12:58:23,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8625 backedges. 0 proven. 8625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:27,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:27,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:58:27,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:58:27,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:58:27,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:27,677 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 103 states. [2018-10-15 12:58:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:33,432 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-15 12:58:33,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:58:33,433 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 380 [2018-10-15 12:58:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:33,435 INFO L225 Difference]: With dead ends: 393 [2018-10-15 12:58:33,435 INFO L226 Difference]: Without dead ends: 393 [2018-10-15 12:58:33,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:58:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-15 12:58:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2018-10-15 12:58:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-15 12:58:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-10-15 12:58:33,439 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 380 [2018-10-15 12:58:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:33,440 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-10-15 12:58:33,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:58:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-10-15 12:58:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-15 12:58:33,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:33,442 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:33,442 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:33,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:33,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1617332501, now seen corresponding path program 51 times [2018-10-15 12:58:33,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 0 proven. 8976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:37,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:37,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:58:37,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:58:37,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:58:37,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:37,216 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 105 states. [2018-10-15 12:58:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:43,323 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2018-10-15 12:58:43,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:58:43,323 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 387 [2018-10-15 12:58:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:43,325 INFO L225 Difference]: With dead ends: 400 [2018-10-15 12:58:43,325 INFO L226 Difference]: Without dead ends: 400 [2018-10-15 12:58:43,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:58:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-15 12:58:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 395. [2018-10-15 12:58:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-15 12:58:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-15 12:58:43,330 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 387 [2018-10-15 12:58:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:43,330 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-15 12:58:43,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:58:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-15 12:58:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-15 12:58:43,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:43,332 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:43,332 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:43,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:43,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1149475636, now seen corresponding path program 52 times [2018-10-15 12:58:43,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9334 backedges. 0 proven. 9334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:47,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:47,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:58:47,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:58:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:58:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:47,354 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 107 states. [2018-10-15 12:58:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:53,589 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-10-15 12:58:53,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:58:53,590 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 394 [2018-10-15 12:58:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:53,591 INFO L225 Difference]: With dead ends: 407 [2018-10-15 12:58:53,591 INFO L226 Difference]: Without dead ends: 407 [2018-10-15 12:58:53,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:58:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-15 12:58:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 402. [2018-10-15 12:58:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-15 12:58:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2018-10-15 12:58:53,595 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 394 [2018-10-15 12:58:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:53,595 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2018-10-15 12:58:53,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:58:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2018-10-15 12:58:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-15 12:58:53,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:53,597 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:53,597 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:53,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:53,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1597159477, now seen corresponding path program 53 times [2018-10-15 12:58:53,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9699 backedges. 0 proven. 9699 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:57,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:57,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:58:57,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:58:57,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:58:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:58:57,541 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 109 states. [2018-10-15 12:59:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:03,929 INFO L93 Difference]: Finished difference Result 414 states and 414 transitions. [2018-10-15 12:59:03,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:59:03,929 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 401 [2018-10-15 12:59:03,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:03,931 INFO L225 Difference]: With dead ends: 414 [2018-10-15 12:59:03,931 INFO L226 Difference]: Without dead ends: 414 [2018-10-15 12:59:03,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:59:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-15 12:59:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 409. [2018-10-15 12:59:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-15 12:59:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 409 transitions. [2018-10-15 12:59:03,935 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 409 transitions. Word has length 401 [2018-10-15 12:59:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:03,936 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 409 transitions. [2018-10-15 12:59:03,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:59:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 409 transitions. [2018-10-15 12:59:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-15 12:59:03,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:03,938 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:03,938 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:03,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:03,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1684396012, now seen corresponding path program 54 times [2018-10-15 12:59:03,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10071 backedges. 0 proven. 10071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:08,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:08,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:59:08,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:59:08,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:59:08,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:08,240 INFO L87 Difference]: Start difference. First operand 409 states and 409 transitions. Second operand 111 states. [2018-10-15 12:59:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:14,516 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-15 12:59:14,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:59:14,517 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 408 [2018-10-15 12:59:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:14,518 INFO L225 Difference]: With dead ends: 421 [2018-10-15 12:59:14,518 INFO L226 Difference]: Without dead ends: 421 [2018-10-15 12:59:14,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:59:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-15 12:59:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 416. [2018-10-15 12:59:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:59:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-10-15 12:59:14,523 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 408 [2018-10-15 12:59:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:14,524 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-10-15 12:59:14,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:59:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-10-15 12:59:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-15 12:59:14,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:14,525 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:14,525 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:14,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:14,526 INFO L82 PathProgramCache]: Analyzing trace with hash 216919893, now seen corresponding path program 55 times [2018-10-15 12:59:14,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10450 backedges. 0 proven. 10450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:18,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:18,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:59:18,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:59:18,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:59:18,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:18,593 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 113 states. [2018-10-15 12:59:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:25,398 INFO L93 Difference]: Finished difference Result 428 states and 428 transitions. [2018-10-15 12:59:25,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:59:25,398 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 415 [2018-10-15 12:59:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:25,400 INFO L225 Difference]: With dead ends: 428 [2018-10-15 12:59:25,400 INFO L226 Difference]: Without dead ends: 428 [2018-10-15 12:59:25,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:59:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-15 12:59:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 423. [2018-10-15 12:59:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-15 12:59:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-15 12:59:25,404 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 415 [2018-10-15 12:59:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:25,404 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-15 12:59:25,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:59:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-15 12:59:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-15 12:59:25,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:25,406 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:25,406 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:25,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:25,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1917365492, now seen corresponding path program 56 times [2018-10-15 12:59:25,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10836 backedges. 0 proven. 10836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:29,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:29,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:59:29,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:59:29,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:59:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:29,478 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 115 states. [2018-10-15 12:59:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:36,277 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2018-10-15 12:59:36,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:59:36,278 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 422 [2018-10-15 12:59:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:36,279 INFO L225 Difference]: With dead ends: 435 [2018-10-15 12:59:36,279 INFO L226 Difference]: Without dead ends: 435 [2018-10-15 12:59:36,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:59:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-15 12:59:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 430. [2018-10-15 12:59:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-15 12:59:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 430 transitions. [2018-10-15 12:59:36,284 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 430 transitions. Word has length 422 [2018-10-15 12:59:36,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:36,285 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 430 transitions. [2018-10-15 12:59:36,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:59:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 430 transitions. [2018-10-15 12:59:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 12:59:36,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:36,286 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:36,287 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:36,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash -156619147, now seen corresponding path program 57 times [2018-10-15 12:59:36,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 11229 backedges. 0 proven. 11229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:40,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:40,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:59:40,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:59:40,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:59:40,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:40,662 INFO L87 Difference]: Start difference. First operand 430 states and 430 transitions. Second operand 117 states. [2018-10-15 12:59:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:47,524 INFO L93 Difference]: Finished difference Result 442 states and 442 transitions. [2018-10-15 12:59:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:59:47,524 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 429 [2018-10-15 12:59:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:47,526 INFO L225 Difference]: With dead ends: 442 [2018-10-15 12:59:47,526 INFO L226 Difference]: Without dead ends: 442 [2018-10-15 12:59:47,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:59:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-10-15 12:59:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 437. [2018-10-15 12:59:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-10-15 12:59:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 437 transitions. [2018-10-15 12:59:47,531 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 437 transitions. Word has length 429 [2018-10-15 12:59:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:47,532 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 437 transitions. [2018-10-15 12:59:47,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:59:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 437 transitions. [2018-10-15 12:59:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-15 12:59:47,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:47,534 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:47,534 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:47,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:47,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1019401772, now seen corresponding path program 58 times [2018-10-15 12:59:47,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11629 backedges. 0 proven. 11629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:52,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:52,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:59:52,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:59:52,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:59:52,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:59:52,022 INFO L87 Difference]: Start difference. First operand 437 states and 437 transitions. Second operand 119 states. [2018-10-15 12:59:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:59,527 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-15 12:59:59,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 12:59:59,527 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 436 [2018-10-15 12:59:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:59,529 INFO L225 Difference]: With dead ends: 449 [2018-10-15 12:59:59,529 INFO L226 Difference]: Without dead ends: 449 [2018-10-15 12:59:59,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 12:59:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-15 12:59:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 444. [2018-10-15 12:59:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-15 12:59:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 444 transitions. [2018-10-15 12:59:59,534 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 444 transitions. Word has length 436 [2018-10-15 12:59:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:59,534 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 444 transitions. [2018-10-15 12:59:59,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:59:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 444 transitions. [2018-10-15 12:59:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-10-15 12:59:59,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:59,536 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:59,537 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:59,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:59,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1643738517, now seen corresponding path program 59 times [2018-10-15 12:59:59,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12036 backedges. 0 proven. 12036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:04,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:04,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 13:00:04,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 13:00:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 13:00:04,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:00:04,039 INFO L87 Difference]: Start difference. First operand 444 states and 444 transitions. Second operand 121 states. [2018-10-15 13:00:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:11,541 INFO L93 Difference]: Finished difference Result 456 states and 456 transitions. [2018-10-15 13:00:11,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 13:00:11,541 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 443 [2018-10-15 13:00:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:11,543 INFO L225 Difference]: With dead ends: 456 [2018-10-15 13:00:11,543 INFO L226 Difference]: Without dead ends: 456 [2018-10-15 13:00:11,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:00:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-10-15 13:00:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 451. [2018-10-15 13:00:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-15 13:00:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-15 13:00:11,547 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 443 [2018-10-15 13:00:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:11,548 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-15 13:00:11,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:00:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-15 13:00:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-15 13:00:11,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:11,550 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:11,550 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:11,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:11,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1084595892, now seen corresponding path program 60 times [2018-10-15 13:00:11,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 0 proven. 12450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:16,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:16,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:00:16,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:00:16,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:00:16,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:16,339 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 123 states. [2018-10-15 13:00:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:24,361 INFO L93 Difference]: Finished difference Result 463 states and 463 transitions. [2018-10-15 13:00:24,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 13:00:24,361 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 450 [2018-10-15 13:00:24,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:24,363 INFO L225 Difference]: With dead ends: 463 [2018-10-15 13:00:24,363 INFO L226 Difference]: Without dead ends: 463 [2018-10-15 13:00:24,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:00:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-10-15 13:00:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 458. [2018-10-15 13:00:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-10-15 13:00:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 458 transitions. [2018-10-15 13:00:24,368 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 458 transitions. Word has length 450 [2018-10-15 13:00:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:24,368 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 458 transitions. [2018-10-15 13:00:24,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:00:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 458 transitions. [2018-10-15 13:00:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-10-15 13:00:24,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:24,370 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:24,370 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:24,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:24,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1827521717, now seen corresponding path program 61 times [2018-10-15 13:00:24,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12871 backedges. 0 proven. 12871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:29,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:29,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:00:29,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:00:29,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:00:29,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:29,226 INFO L87 Difference]: Start difference. First operand 458 states and 458 transitions. Second operand 125 states. [2018-10-15 13:00:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:37,316 INFO L93 Difference]: Finished difference Result 470 states and 470 transitions. [2018-10-15 13:00:37,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 13:00:37,317 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 457 [2018-10-15 13:00:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:37,319 INFO L225 Difference]: With dead ends: 470 [2018-10-15 13:00:37,319 INFO L226 Difference]: Without dead ends: 470 [2018-10-15 13:00:37,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 13:00:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-15 13:00:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 465. [2018-10-15 13:00:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-10-15 13:00:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 465 transitions. [2018-10-15 13:00:37,324 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 465 transitions. Word has length 457 [2018-10-15 13:00:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:37,324 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 465 transitions. [2018-10-15 13:00:37,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:00:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 465 transitions. [2018-10-15 13:00:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-15 13:00:37,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:37,326 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:37,327 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:37,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash 875563924, now seen corresponding path program 62 times [2018-10-15 13:00:37,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13299 backedges. 0 proven. 13299 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:42,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:42,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:00:42,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:00:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:00:42,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:42,331 INFO L87 Difference]: Start difference. First operand 465 states and 465 transitions. Second operand 127 states. [2018-10-15 13:00:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:50,891 INFO L93 Difference]: Finished difference Result 477 states and 477 transitions. [2018-10-15 13:00:50,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 13:00:50,892 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 464 [2018-10-15 13:00:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:50,894 INFO L225 Difference]: With dead ends: 477 [2018-10-15 13:00:50,894 INFO L226 Difference]: Without dead ends: 477 [2018-10-15 13:00:50,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:00:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-15 13:00:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 472. [2018-10-15 13:00:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-15 13:00:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 472 transitions. [2018-10-15 13:00:50,900 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 472 transitions. Word has length 464 [2018-10-15 13:00:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:50,900 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 472 transitions. [2018-10-15 13:00:50,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:00:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 472 transitions. [2018-10-15 13:00:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-10-15 13:00:50,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:50,902 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:50,902 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:50,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash 773397461, now seen corresponding path program 63 times [2018-10-15 13:00:50,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13734 backedges. 0 proven. 13734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:56,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:56,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:00:56,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:00:56,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:00:56,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:00:56,006 INFO L87 Difference]: Start difference. First operand 472 states and 472 transitions. Second operand 129 states. [2018-10-15 13:01:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:05,062 INFO L93 Difference]: Finished difference Result 484 states and 484 transitions. [2018-10-15 13:01:05,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:01:05,063 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 471 [2018-10-15 13:01:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:05,064 INFO L225 Difference]: With dead ends: 484 [2018-10-15 13:01:05,064 INFO L226 Difference]: Without dead ends: 484 [2018-10-15 13:01:05,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 13:01:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-15 13:01:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 479. [2018-10-15 13:01:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-15 13:01:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-15 13:01:05,069 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 471 [2018-10-15 13:01:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:05,070 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-15 13:01:05,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:01:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-15 13:01:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-15 13:01:05,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:05,072 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:05,072 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:05,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1594519668, now seen corresponding path program 64 times [2018-10-15 13:01:05,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14176 backedges. 0 proven. 14176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:10,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:10,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:01:10,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:01:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:01:10,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:01:10,262 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 131 states. [2018-10-15 13:01:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:18,763 INFO L93 Difference]: Finished difference Result 491 states and 491 transitions. [2018-10-15 13:01:18,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 13:01:18,763 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 478 [2018-10-15 13:01:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:18,765 INFO L225 Difference]: With dead ends: 491 [2018-10-15 13:01:18,765 INFO L226 Difference]: Without dead ends: 491 [2018-10-15 13:01:18,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:01:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-10-15 13:01:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 486. [2018-10-15 13:01:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-10-15 13:01:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 486 transitions. [2018-10-15 13:01:18,771 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 486 transitions. Word has length 478 [2018-10-15 13:01:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:18,771 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 486 transitions. [2018-10-15 13:01:18,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:01:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 486 transitions. [2018-10-15 13:01:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-10-15 13:01:18,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:18,773 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:18,773 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:18,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash -728925451, now seen corresponding path program 65 times [2018-10-15 13:01:18,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14625 backedges. 0 proven. 14625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:24,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:24,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:01:24,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:01:24,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:01:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:24,228 INFO L87 Difference]: Start difference. First operand 486 states and 486 transitions. Second operand 133 states. [2018-10-15 13:01:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:33,521 INFO L93 Difference]: Finished difference Result 498 states and 498 transitions. [2018-10-15 13:01:33,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 13:01:33,521 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 485 [2018-10-15 13:01:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:33,523 INFO L225 Difference]: With dead ends: 498 [2018-10-15 13:01:33,523 INFO L226 Difference]: Without dead ends: 498 [2018-10-15 13:01:33,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:01:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-10-15 13:01:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 493. [2018-10-15 13:01:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-10-15 13:01:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 493 transitions. [2018-10-15 13:01:33,529 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 493 transitions. Word has length 485 [2018-10-15 13:01:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:33,529 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 493 transitions. [2018-10-15 13:01:33,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:01:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 493 transitions. [2018-10-15 13:01:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-15 13:01:33,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:33,532 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:33,532 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:33,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:33,532 INFO L82 PathProgramCache]: Analyzing trace with hash -639447724, now seen corresponding path program 66 times [2018-10-15 13:01:33,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 15081 backedges. 0 proven. 15081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:39,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:39,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:01:39,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:01:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:01:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:39,149 INFO L87 Difference]: Start difference. First operand 493 states and 493 transitions. Second operand 135 states. [2018-10-15 13:01:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:48,787 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-10-15 13:01:48,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 13:01:48,788 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 492 [2018-10-15 13:01:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:48,790 INFO L225 Difference]: With dead ends: 505 [2018-10-15 13:01:48,790 INFO L226 Difference]: Without dead ends: 505 [2018-10-15 13:01:48,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 13:01:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-15 13:01:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 500. [2018-10-15 13:01:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-15 13:01:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 500 transitions. [2018-10-15 13:01:48,795 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 500 transitions. Word has length 492 [2018-10-15 13:01:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:48,795 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 500 transitions. [2018-10-15 13:01:48,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:01:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 500 transitions. [2018-10-15 13:01:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 13:01:48,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:48,797 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:48,797 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:48,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:48,798 INFO L82 PathProgramCache]: Analyzing trace with hash -941825515, now seen corresponding path program 67 times [2018-10-15 13:01:48,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15544 backedges. 0 proven. 15544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:54,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:54,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:01:54,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:01:54,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:01:54,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:01:54,460 INFO L87 Difference]: Start difference. First operand 500 states and 500 transitions. Second operand 137 states. [2018-10-15 13:02:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:04,351 INFO L93 Difference]: Finished difference Result 512 states and 512 transitions. [2018-10-15 13:02:04,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 13:02:04,351 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 499 [2018-10-15 13:02:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:04,353 INFO L225 Difference]: With dead ends: 512 [2018-10-15 13:02:04,353 INFO L226 Difference]: Without dead ends: 512 [2018-10-15 13:02:04,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:02:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-10-15 13:02:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 507. [2018-10-15 13:02:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-15 13:02:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2018-10-15 13:02:04,358 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 499 [2018-10-15 13:02:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:04,358 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 507 transitions. [2018-10-15 13:02:04,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:02:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 507 transitions. [2018-10-15 13:02:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-15 13:02:04,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:04,361 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:04,361 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:04,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash -186179020, now seen corresponding path program 68 times [2018-10-15 13:02:04,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16014 backedges. 0 proven. 16014 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:10,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:10,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:02:10,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:02:10,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:02:10,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:02:10,233 INFO L87 Difference]: Start difference. First operand 507 states and 507 transitions. Second operand 139 states. [2018-10-15 13:02:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:20,375 INFO L93 Difference]: Finished difference Result 519 states and 519 transitions. [2018-10-15 13:02:20,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 13:02:20,375 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 506 [2018-10-15 13:02:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:20,377 INFO L225 Difference]: With dead ends: 519 [2018-10-15 13:02:20,377 INFO L226 Difference]: Without dead ends: 519 [2018-10-15 13:02:20,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:02:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-10-15 13:02:20,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 514. [2018-10-15 13:02:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-10-15 13:02:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 514 transitions. [2018-10-15 13:02:20,383 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 514 transitions. Word has length 506 [2018-10-15 13:02:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:20,383 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 514 transitions. [2018-10-15 13:02:20,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:02:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 514 transitions. [2018-10-15 13:02:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-10-15 13:02:20,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:20,385 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:20,386 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:20,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:20,386 INFO L82 PathProgramCache]: Analyzing trace with hash -937864907, now seen corresponding path program 69 times [2018-10-15 13:02:20,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16491 backedges. 0 proven. 16491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:26,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:26,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:02:26,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:02:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:02:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:26,416 INFO L87 Difference]: Start difference. First operand 514 states and 514 transitions. Second operand 141 states. [2018-10-15 13:02:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:36,809 INFO L93 Difference]: Finished difference Result 526 states and 526 transitions. [2018-10-15 13:02:36,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 13:02:36,809 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 513 [2018-10-15 13:02:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:36,811 INFO L225 Difference]: With dead ends: 526 [2018-10-15 13:02:36,811 INFO L226 Difference]: Without dead ends: 526 [2018-10-15 13:02:36,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 13:02:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-10-15 13:02:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 521. [2018-10-15 13:02:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-10-15 13:02:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 521 transitions. [2018-10-15 13:02:36,817 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 521 transitions. Word has length 513 [2018-10-15 13:02:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:36,817 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 521 transitions. [2018-10-15 13:02:36,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:02:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 521 transitions. [2018-10-15 13:02:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-10-15 13:02:36,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:36,820 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:36,820 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:36,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:36,820 INFO L82 PathProgramCache]: Analyzing trace with hash 398814996, now seen corresponding path program 70 times [2018-10-15 13:02:36,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16975 backedges. 0 proven. 16975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:43,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:43,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:02:43,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:02:43,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:02:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:43,133 INFO L87 Difference]: Start difference. First operand 521 states and 521 transitions. Second operand 143 states. [2018-10-15 13:02:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:53,700 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-15 13:02:53,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:02:53,701 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 520 [2018-10-15 13:02:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:53,702 INFO L225 Difference]: With dead ends: 533 [2018-10-15 13:02:53,702 INFO L226 Difference]: Without dead ends: 533 [2018-10-15 13:02:53,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 13:02:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-15 13:02:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 528. [2018-10-15 13:02:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-15 13:02:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 528 transitions. [2018-10-15 13:02:53,709 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 528 transitions. Word has length 520 [2018-10-15 13:02:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:53,709 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 528 transitions. [2018-10-15 13:02:53,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:02:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 528 transitions. [2018-10-15 13:02:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-15 13:02:53,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:53,711 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:53,711 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:53,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash 232048725, now seen corresponding path program 71 times [2018-10-15 13:02:53,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 17466 backedges. 0 proven. 17466 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:00,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:00,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:03:00,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:03:00,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:03:00,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:03:00,115 INFO L87 Difference]: Start difference. First operand 528 states and 528 transitions. Second operand 145 states. [2018-10-15 13:03:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:10,723 INFO L93 Difference]: Finished difference Result 540 states and 540 transitions. [2018-10-15 13:03:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 13:03:10,723 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 527 [2018-10-15 13:03:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:10,725 INFO L225 Difference]: With dead ends: 540 [2018-10-15 13:03:10,725 INFO L226 Difference]: Without dead ends: 540 [2018-10-15 13:03:10,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 13:03:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-15 13:03:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2018-10-15 13:03:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-15 13:03:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 535 transitions. [2018-10-15 13:03:10,731 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 535 transitions. Word has length 527 [2018-10-15 13:03:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:10,732 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 535 transitions. [2018-10-15 13:03:10,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:03:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 535 transitions. [2018-10-15 13:03:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-15 13:03:10,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:10,734 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:10,734 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:10,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1582582796, now seen corresponding path program 72 times [2018-10-15 13:03:10,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 17964 backedges. 0 proven. 17964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:17,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:17,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:03:17,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:03:17,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:03:17,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:03:17,326 INFO L87 Difference]: Start difference. First operand 535 states and 535 transitions. Second operand 147 states. [2018-10-15 13:03:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:28,675 INFO L93 Difference]: Finished difference Result 547 states and 547 transitions. [2018-10-15 13:03:28,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 13:03:28,675 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 534 [2018-10-15 13:03:28,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:28,677 INFO L225 Difference]: With dead ends: 547 [2018-10-15 13:03:28,677 INFO L226 Difference]: Without dead ends: 547 [2018-10-15 13:03:28,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 13:03:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-10-15 13:03:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 542. [2018-10-15 13:03:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-10-15 13:03:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 542 transitions. [2018-10-15 13:03:28,682 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 542 transitions. Word has length 534 [2018-10-15 13:03:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:28,683 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 542 transitions. [2018-10-15 13:03:28,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 13:03:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 542 transitions. [2018-10-15 13:03:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-10-15 13:03:28,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:28,685 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:28,685 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:28,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:28,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1780565877, now seen corresponding path program 73 times [2018-10-15 13:03:28,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18469 backedges. 0 proven. 18469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:35,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:35,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 13:03:35,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 13:03:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 13:03:35,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 13:03:35,327 INFO L87 Difference]: Start difference. First operand 542 states and 542 transitions. Second operand 149 states.