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/simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:12:19,754 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:12:19,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:12:19,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:12:19,770 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:12:19,772 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:12:19,774 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:12:19,776 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:12:19,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:12:19,779 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:12:19,782 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:12:19,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:12:19,783 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:12:19,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:12:19,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:12:19,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:12:19,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:12:19,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:12:19,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:12:19,806 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:12:19,807 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:12:19,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:12:19,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:12:19,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:12:19,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:12:19,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:12:19,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:12:19,819 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:12:19,820 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:12:19,821 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:12:19,821 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:12:19,822 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:12:19,822 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:12:19,822 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:12:19,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:12:19,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:12:19,824 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 13:12:19,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:12:19,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:12:19,841 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:12:19,845 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:12:19,845 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:12:19,845 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:12:19,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:12:19,846 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:12:19,846 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:12:19,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:12:19,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:12:19,847 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:12:19,848 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:12:19,849 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:12:19,849 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:12:19,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:12:19,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:12:19,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:12:19,925 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:12:19,926 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:12:19,927 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl [2018-10-15 13:12:19,927 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl' [2018-10-15 13:12:20,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:12:20,007 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:12:20,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:12:20,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:12:20,008 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:12:20,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:19" (1/1) ... [2018-10-15 13:12:20,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:19" (1/1) ... [2018-10-15 13:12:20,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:19" (1/1) ... [2018-10-15 13:12:20,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:19" (1/1) ... [2018-10-15 13:12:20,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:19" (1/1) ... [2018-10-15 13:12:20,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:19" (1/1) ... [2018-10-15 13:12:20,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:19" (1/1) ... [2018-10-15 13:12:20,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:12:20,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:12:20,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:12:20,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:12:20,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:19" (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 13:12:20,141 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:12:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:12:20,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:12:20,563 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:12:20,564 INFO L202 PluginConnector]: Adding new model simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:12:20 BoogieIcfgContainer [2018-10-15 13:12:20,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:12:20,565 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:12:20,565 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:12:20,566 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:12:20,570 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:12:20" (1/1) ... [2018-10-15 13:12:20,579 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-15 13:12:20,579 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-15 13:12:20,612 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-15 13:12:20,653 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-15 13:12:20,668 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-15 13:12:20,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-15 13:12:23,337 INFO L315 AbstractInterpreter]: Visited 41 different actions 89 times. Merged at 23 different actions 46 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-10-15 13:12:23,341 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-15 13:12:23,346 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-15 13:12:23,358 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_2|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-15 13:12:23,360 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 13:12:23,377 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_2|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-15 13:12:23,378 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-15 13:12:23,379 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 13:12:23,379 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 13:12:23,379 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 13:12:23,385 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 13:12:23,385 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 13:12:23,385 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 13:12:23,386 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 13:12:23,386 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 13:12:23,386 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 13:12:23,386 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 13:12:23,386 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 13:12:23,387 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 13:12:23,387 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 13:12:23,389 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 13:12:23,390 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-15 13:12:23,407 INFO L202 PluginConnector]: Adding new model simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:12:23 BasicIcfg [2018-10-15 13:12:23,408 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:12:23,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:12:23,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:12:23,413 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:12:23,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:19" (1/3) ... [2018-10-15 13:12:23,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8da3113 and model type simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:12:23, skipping insertion in model container [2018-10-15 13:12:23,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:12:20" (2/3) ... [2018-10-15 13:12:23,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8da3113 and model type simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:12:23, skipping insertion in model container [2018-10-15 13:12:23,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:12:23" (3/3) ... [2018-10-15 13:12:23,417 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-15 13:12:23,428 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:12:23,436 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:12:23,454 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:12:23,479 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:12:23,480 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:12:23,480 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:12:23,480 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:12:23,481 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:12:23,481 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:12:23,481 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:12:23,481 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:12:23,481 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:12:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-10-15 13:12:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 13:12:23,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:23,509 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] [2018-10-15 13:12:23,512 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:23,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:23,521 INFO L82 PathProgramCache]: Analyzing trace with hash 103530517, now seen corresponding path program 1 times [2018-10-15 13:12:23,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:23,777 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 13:12:23,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:12:23,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:12:23,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:12:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:12:23,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:12:23,806 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-10-15 13:12:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:23,967 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 13:12:23,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:12:23,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-15 13:12:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:23,982 INFO L225 Difference]: With dead ends: 49 [2018-10-15 13:12:23,982 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 13:12:23,984 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 13:12:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 13:12:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2018-10-15 13:12:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 13:12:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-15 13:12:24,079 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 28 [2018-10-15 13:12:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:24,080 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-15 13:12:24,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:12:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-15 13:12:24,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 13:12:24,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:24,081 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:24,082 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:24,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:24,083 INFO L82 PathProgramCache]: Analyzing trace with hash -112453152, now seen corresponding path program 1 times [2018-10-15 13:12:24,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:24,280 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 13:12:24,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:24,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:12:24,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:12:24,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:12:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:12:24,287 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 5 states. [2018-10-15 13:12:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:24,733 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-15 13:12:24,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:12:24,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-15 13:12:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:24,739 INFO L225 Difference]: With dead ends: 60 [2018-10-15 13:12:24,739 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 13:12:24,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:12:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 13:12:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-10-15 13:12:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 13:12:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 13:12:24,751 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 39 [2018-10-15 13:12:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:24,752 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 13:12:24,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:12:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 13:12:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 13:12:24,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:24,755 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:24,755 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:24,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1366801611, now seen corresponding path program 2 times [2018-10-15 13:12:24,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:25,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:25,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:12:25,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:12:25,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:12:25,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:12:25,025 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 7 states. [2018-10-15 13:12:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:25,426 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-15 13:12:25,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:12:25,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-10-15 13:12:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:25,429 INFO L225 Difference]: With dead ends: 71 [2018-10-15 13:12:25,429 INFO L226 Difference]: Without dead ends: 71 [2018-10-15 13:12:25,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:12:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-15 13:12:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2018-10-15 13:12:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-15 13:12:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-15 13:12:25,437 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 50 [2018-10-15 13:12:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:25,437 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-15 13:12:25,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:12:25,437 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-15 13:12:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-15 13:12:25,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:25,439 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:25,440 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:25,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:25,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1656462656, now seen corresponding path program 3 times [2018-10-15 13:12:25,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:26,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:26,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:12:26,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:12:26,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:12:26,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:12:26,025 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 9 states. [2018-10-15 13:12:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:26,453 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-15 13:12:26,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:12:26,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-10-15 13:12:26,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:26,456 INFO L225 Difference]: With dead ends: 82 [2018-10-15 13:12:26,456 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 13:12:26,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:12:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 13:12:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2018-10-15 13:12:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 13:12:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 13:12:26,464 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 61 [2018-10-15 13:12:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:26,467 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 13:12:26,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:12:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 13:12:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 13:12:26,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:26,469 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:26,469 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:26,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:26,469 INFO L82 PathProgramCache]: Analyzing trace with hash 293842517, now seen corresponding path program 4 times [2018-10-15 13:12:26,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:26,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:26,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:12:26,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:12:26,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:12:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:12:26,761 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 11 states. [2018-10-15 13:12:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:27,500 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-15 13:12:27,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:12:27,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-10-15 13:12:27,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:27,504 INFO L225 Difference]: With dead ends: 93 [2018-10-15 13:12:27,504 INFO L226 Difference]: Without dead ends: 93 [2018-10-15 13:12:27,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:12:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-15 13:12:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-10-15 13:12:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-15 13:12:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-15 13:12:27,511 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 72 [2018-10-15 13:12:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:27,511 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-15 13:12:27,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:12:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-15 13:12:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-15 13:12:27,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:27,513 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:27,514 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:27,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1438434208, now seen corresponding path program 5 times [2018-10-15 13:12:27,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:28,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:28,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:12:28,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:12:28,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:12:28,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:12:28,071 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 13 states. [2018-10-15 13:12:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:28,771 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 13:12:28,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:12:28,772 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2018-10-15 13:12:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:28,774 INFO L225 Difference]: With dead ends: 104 [2018-10-15 13:12:28,774 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 13:12:28,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:12:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 13:12:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2018-10-15 13:12:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 13:12:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 13:12:28,785 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 83 [2018-10-15 13:12:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:28,786 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 13:12:28,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:12:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 13:12:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 13:12:28,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:28,791 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:28,791 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:28,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash 931135861, now seen corresponding path program 6 times [2018-10-15 13:12:28,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:29,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:29,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:12:29,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:12:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:12:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:12:29,293 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 15 states. [2018-10-15 13:12:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:30,057 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-15 13:12:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:12:30,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2018-10-15 13:12:30,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:30,059 INFO L225 Difference]: With dead ends: 115 [2018-10-15 13:12:30,059 INFO L226 Difference]: Without dead ends: 115 [2018-10-15 13:12:30,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:12:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-15 13:12:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2018-10-15 13:12:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-15 13:12:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-15 13:12:30,067 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 94 [2018-10-15 13:12:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:30,067 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-15 13:12:30,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:12:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-15 13:12:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-15 13:12:30,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:30,070 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:30,070 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:30,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:30,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1762868352, now seen corresponding path program 7 times [2018-10-15 13:12:30,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:31,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:31,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:12:31,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:12:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:12:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:12:31,236 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 17 states. [2018-10-15 13:12:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:32,927 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 13:12:32,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:12:32,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 105 [2018-10-15 13:12:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:32,930 INFO L225 Difference]: With dead ends: 126 [2018-10-15 13:12:32,930 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 13:12:32,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:12:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 13:12:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2018-10-15 13:12:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 13:12:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-15 13:12:32,941 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 105 [2018-10-15 13:12:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:32,941 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-15 13:12:32,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:12:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-15 13:12:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 13:12:32,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:32,943 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:32,944 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:32,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash -748733291, now seen corresponding path program 8 times [2018-10-15 13:12:32,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:33,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:33,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:12:33,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:12:33,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:12:33,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:12:33,463 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 19 states. [2018-10-15 13:12:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:34,588 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 13:12:34,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:12:34,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 116 [2018-10-15 13:12:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:34,592 INFO L225 Difference]: With dead ends: 137 [2018-10-15 13:12:34,592 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 13:12:34,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:12:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 13:12:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2018-10-15 13:12:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 13:12:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 13:12:34,599 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 116 [2018-10-15 13:12:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:34,600 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 13:12:34,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:12:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 13:12:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 13:12:34,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:34,602 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:34,602 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:34,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash -484061856, now seen corresponding path program 9 times [2018-10-15 13:12:34,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:35,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:35,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:12:35,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:12:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:12:35,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:12:35,049 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 21 states. [2018-10-15 13:12:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:36,734 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 13:12:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:12:36,734 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 127 [2018-10-15 13:12:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:36,736 INFO L225 Difference]: With dead ends: 148 [2018-10-15 13:12:36,736 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 13:12:36,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:12:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 13:12:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2018-10-15 13:12:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 13:12:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 13:12:36,742 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 127 [2018-10-15 13:12:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:36,742 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 13:12:36,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:12:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 13:12:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 13:12:36,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:36,744 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:36,744 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:36,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:36,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1652776885, now seen corresponding path program 10 times [2018-10-15 13:12:36,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:37,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:37,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:12:37,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:12:37,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:12:37,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:12:37,271 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 23 states. [2018-10-15 13:12:39,672 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 13:12:40,262 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 13:12:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:40,619 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-15 13:12:40,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 13:12:40,620 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 138 [2018-10-15 13:12:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:40,621 INFO L225 Difference]: With dead ends: 159 [2018-10-15 13:12:40,622 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 13:12:40,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:12:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 13:12:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2018-10-15 13:12:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 13:12:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-15 13:12:40,628 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 138 [2018-10-15 13:12:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:40,628 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-15 13:12:40,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:12:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-15 13:12:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 13:12:40,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:40,629 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:40,630 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:40,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1968338496, now seen corresponding path program 11 times [2018-10-15 13:12:40,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:41,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:41,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:12:41,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:12:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:12:41,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:12:41,407 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 25 states. [2018-10-15 13:12:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:43,296 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-15 13:12:43,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:12:43,296 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2018-10-15 13:12:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:43,298 INFO L225 Difference]: With dead ends: 170 [2018-10-15 13:12:43,298 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 13:12:43,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:12:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 13:12:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2018-10-15 13:12:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 13:12:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 13:12:43,303 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 149 [2018-10-15 13:12:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:43,304 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 13:12:43,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:12:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 13:12:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:12:43,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:43,306 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:43,306 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:43,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1288596181, now seen corresponding path program 12 times [2018-10-15 13:12:43,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:44,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:44,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:12:44,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:12:44,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:12:44,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:12:44,006 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 27 states. [2018-10-15 13:12:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:45,929 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-15 13:12:45,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:12:45,930 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 160 [2018-10-15 13:12:45,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:45,932 INFO L225 Difference]: With dead ends: 181 [2018-10-15 13:12:45,932 INFO L226 Difference]: Without dead ends: 181 [2018-10-15 13:12:45,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:12:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-15 13:12:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2018-10-15 13:12:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-15 13:12:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-15 13:12:45,937 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 160 [2018-10-15 13:12:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:45,938 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-15 13:12:45,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:12:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-15 13:12:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-15 13:12:45,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:45,939 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:45,939 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:45,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:45,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1450653472, now seen corresponding path program 13 times [2018-10-15 13:12:45,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 0 proven. 871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:47,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:47,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:12:47,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:12:47,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:12:47,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:12:47,286 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 29 states. [2018-10-15 13:12:49,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:49,465 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-15 13:12:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:12:49,466 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 171 [2018-10-15 13:12:49,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:49,467 INFO L225 Difference]: With dead ends: 192 [2018-10-15 13:12:49,468 INFO L226 Difference]: Without dead ends: 192 [2018-10-15 13:12:49,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:12:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-15 13:12:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 183. [2018-10-15 13:12:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 13:12:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 13:12:49,473 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 171 [2018-10-15 13:12:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:49,473 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 13:12:49,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:12:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 13:12:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 13:12:49,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:49,475 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:49,475 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:49,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash 77749749, now seen corresponding path program 14 times [2018-10-15 13:12:49,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 0 proven. 1015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:50,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:50,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:12:50,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:12:50,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:12:50,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:12:50,661 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 31 states. [2018-10-15 13:12:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:53,381 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-15 13:12:53,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:12:53,381 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 182 [2018-10-15 13:12:53,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:53,383 INFO L225 Difference]: With dead ends: 203 [2018-10-15 13:12:53,383 INFO L226 Difference]: Without dead ends: 203 [2018-10-15 13:12:53,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:12:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-15 13:12:53,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 194. [2018-10-15 13:12:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-15 13:12:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-15 13:12:53,388 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 182 [2018-10-15 13:12:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:53,389 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-15 13:12:53,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:12:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-15 13:12:53,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:12:53,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:53,390 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:53,390 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:53,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash 586289152, now seen corresponding path program 15 times [2018-10-15 13:12:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1170 backedges. 0 proven. 1170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:54,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:54,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:12:54,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:12:54,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:12:54,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:12:54,697 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 33 states. [2018-10-15 13:12:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:57,870 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 13:12:57,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:12:57,871 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 193 [2018-10-15 13:12:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:57,873 INFO L225 Difference]: With dead ends: 214 [2018-10-15 13:12:57,873 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 13:12:57,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:12:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 13:12:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 205. [2018-10-15 13:12:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 13:12:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-15 13:12:57,879 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 193 [2018-10-15 13:12:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:57,880 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-15 13:12:57,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:12:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-15 13:12:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 13:12:57,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:57,881 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:57,881 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:57,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:57,881 INFO L82 PathProgramCache]: Analyzing trace with hash 652294421, now seen corresponding path program 16 times [2018-10-15 13:12:57,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 0 proven. 1336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:59,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:59,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:12:59,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:12:59,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:12:59,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:12:59,419 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 35 states. [2018-10-15 13:13:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:02,958 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-15 13:13:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:13:02,958 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 204 [2018-10-15 13:13:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:02,960 INFO L225 Difference]: With dead ends: 225 [2018-10-15 13:13:02,961 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 13:13:02,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:13:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 13:13:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 216. [2018-10-15 13:13:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-15 13:13:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-15 13:13:02,967 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 204 [2018-10-15 13:13:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:02,968 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-15 13:13:02,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:13:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-15 13:13:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-15 13:13:02,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:02,969 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:02,970 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:02,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1130299168, now seen corresponding path program 17 times [2018-10-15 13:13:02,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 0 proven. 1513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:04,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:04,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:13:04,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:13:04,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:13:04,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:13:04,094 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 37 states. [2018-10-15 13:13:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:08,213 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-15 13:13:08,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:13:08,215 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 215 [2018-10-15 13:13:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:08,216 INFO L225 Difference]: With dead ends: 236 [2018-10-15 13:13:08,216 INFO L226 Difference]: Without dead ends: 236 [2018-10-15 13:13:08,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:13:08,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-15 13:13:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 227. [2018-10-15 13:13:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 13:13:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 13:13:08,221 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 215 [2018-10-15 13:13:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:08,221 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 13:13:08,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:13:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 13:13:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 13:13:08,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:08,222 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:08,223 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:08,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1695744971, now seen corresponding path program 18 times [2018-10-15 13:13:08,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:09,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:09,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:13:09,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:13:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:13:09,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:13:09,530 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 39 states. [2018-10-15 13:13:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:14,062 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-15 13:13:14,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:13:14,063 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 226 [2018-10-15 13:13:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:14,065 INFO L225 Difference]: With dead ends: 247 [2018-10-15 13:13:14,065 INFO L226 Difference]: Without dead ends: 247 [2018-10-15 13:13:14,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:13:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-15 13:13:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 238. [2018-10-15 13:13:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-15 13:13:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-10-15 13:13:14,071 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 226 [2018-10-15 13:13:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:14,071 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-10-15 13:13:14,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:13:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-10-15 13:13:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-15 13:13:14,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:14,073 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:14,073 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:14,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:14,074 INFO L82 PathProgramCache]: Analyzing trace with hash 719456704, now seen corresponding path program 19 times [2018-10-15 13:13:14,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:15,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:15,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:13:15,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:13:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:13:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:13:15,835 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 41 states. [2018-10-15 13:13:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:20,445 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-10-15 13:13:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:13:20,446 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 237 [2018-10-15 13:13:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:20,448 INFO L225 Difference]: With dead ends: 258 [2018-10-15 13:13:20,448 INFO L226 Difference]: Without dead ends: 258 [2018-10-15 13:13:20,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:13:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-15 13:13:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2018-10-15 13:13:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-15 13:13:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-15 13:13:20,454 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 237 [2018-10-15 13:13:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:20,455 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-15 13:13:20,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:13:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-15 13:13:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-15 13:13:20,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:20,456 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:20,457 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:20,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:20,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1297635499, now seen corresponding path program 20 times [2018-10-15 13:13:20,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 0 proven. 2110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:23,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:23,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:13:23,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:13:23,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:13:23,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:13:23,062 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 43 states. [2018-10-15 13:13:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:27,880 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-15 13:13:27,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:13:27,880 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 248 [2018-10-15 13:13:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:27,882 INFO L225 Difference]: With dead ends: 269 [2018-10-15 13:13:27,882 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 13:13:27,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:13:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 13:13:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 260. [2018-10-15 13:13:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 13:13:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-15 13:13:27,889 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 248 [2018-10-15 13:13:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:27,890 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-15 13:13:27,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:13:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-15 13:13:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 13:13:27,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:27,892 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:27,892 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:27,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2056465056, now seen corresponding path program 21 times [2018-10-15 13:13:27,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2331 backedges. 0 proven. 2331 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:29,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:29,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:13:29,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:13:29,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:13:29,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:13:29,870 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 45 states. [2018-10-15 13:13:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:35,759 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-15 13:13:35,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:13:35,760 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 259 [2018-10-15 13:13:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:35,763 INFO L225 Difference]: With dead ends: 280 [2018-10-15 13:13:35,763 INFO L226 Difference]: Without dead ends: 280 [2018-10-15 13:13:35,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:13:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-15 13:13:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 271. [2018-10-15 13:13:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-15 13:13:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-15 13:13:35,769 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 259 [2018-10-15 13:13:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:35,770 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-15 13:13:35,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:13:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-15 13:13:35,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 13:13:35,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:35,772 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:35,772 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:35,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:35,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1249065589, now seen corresponding path program 22 times [2018-10-15 13:13:35,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2563 backedges. 0 proven. 2563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:37,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:37,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:13:37,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:13:37,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:13:37,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:13:37,086 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 47 states. [2018-10-15 13:13:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:42,930 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-15 13:13:42,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:13:42,930 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 270 [2018-10-15 13:13:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:42,932 INFO L225 Difference]: With dead ends: 291 [2018-10-15 13:13:42,932 INFO L226 Difference]: Without dead ends: 291 [2018-10-15 13:13:42,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:13:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-15 13:13:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 282. [2018-10-15 13:13:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-15 13:13:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-15 13:13:42,938 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 270 [2018-10-15 13:13:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:42,939 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-15 13:13:42,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:13:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-15 13:13:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-15 13:13:42,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:42,940 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:42,941 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:42,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1642962048, now seen corresponding path program 23 times [2018-10-15 13:13:42,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2806 backedges. 0 proven. 2806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:44,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:44,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:13:44,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:13:44,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:13:44,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:13:44,440 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 49 states. [2018-10-15 13:13:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:50,794 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-15 13:13:50,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:13:50,794 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 281 [2018-10-15 13:13:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:50,796 INFO L225 Difference]: With dead ends: 302 [2018-10-15 13:13:50,796 INFO L226 Difference]: Without dead ends: 302 [2018-10-15 13:13:50,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:13:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-15 13:13:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 293. [2018-10-15 13:13:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-15 13:13:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-15 13:13:50,802 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 281 [2018-10-15 13:13:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:50,802 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-15 13:13:50,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:13:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-15 13:13:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-15 13:13:50,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:50,804 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:50,804 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:50,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash -382618219, now seen corresponding path program 24 times [2018-10-15 13:13:50,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:52,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:52,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:13:52,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:13:52,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:13:52,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:13:52,513 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 51 states. [2018-10-15 13:13:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:59,362 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-15 13:13:59,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:13:59,363 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 292 [2018-10-15 13:13:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:59,365 INFO L225 Difference]: With dead ends: 313 [2018-10-15 13:13:59,365 INFO L226 Difference]: Without dead ends: 313 [2018-10-15 13:13:59,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:13:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-15 13:13:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 304. [2018-10-15 13:13:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-15 13:13:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-10-15 13:13:59,372 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 292 [2018-10-15 13:13:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:59,372 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-10-15 13:13:59,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:13:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-10-15 13:13:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-15 13:13:59,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:59,374 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:59,374 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:59,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:59,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1295889504, now seen corresponding path program 25 times [2018-10-15 13:13:59,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3325 backedges. 0 proven. 3325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:01,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:01,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:14:01,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:14:01,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:14:01,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:14:01,141 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 53 states. [2018-10-15 13:14:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:08,274 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-10-15 13:14:08,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:14:08,275 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 303 [2018-10-15 13:14:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:08,276 INFO L225 Difference]: With dead ends: 324 [2018-10-15 13:14:08,277 INFO L226 Difference]: Without dead ends: 324 [2018-10-15 13:14:08,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:14:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-15 13:14:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 315. [2018-10-15 13:14:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-15 13:14:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-15 13:14:08,282 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 303 [2018-10-15 13:14:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:08,283 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-15 13:14:08,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:14:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-15 13:14:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-15 13:14:08,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:08,285 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:08,285 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:08,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:08,286 INFO L82 PathProgramCache]: Analyzing trace with hash -532342603, now seen corresponding path program 26 times [2018-10-15 13:14:08,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 0 proven. 3601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:10,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:10,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:14:10,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:14:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:14:10,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:14:10,426 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 55 states. [2018-10-15 13:14:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:18,320 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-15 13:14:18,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 13:14:18,320 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 314 [2018-10-15 13:14:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:18,323 INFO L225 Difference]: With dead ends: 335 [2018-10-15 13:14:18,324 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 13:14:18,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:14:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 13:14:18,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 326. [2018-10-15 13:14:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:14:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-15 13:14:18,329 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 314 [2018-10-15 13:14:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:18,329 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-15 13:14:18,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:14:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-15 13:14:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-15 13:14:18,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:18,331 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:18,332 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:18,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:18,332 INFO L82 PathProgramCache]: Analyzing trace with hash -445440704, now seen corresponding path program 27 times [2018-10-15 13:14:18,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 3888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:21,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:21,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:14:21,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:14:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:14:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:14:21,659 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 57 states. [2018-10-15 13:14:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:30,186 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-15 13:14:30,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:14:30,186 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 325 [2018-10-15 13:14:30,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:30,189 INFO L225 Difference]: With dead ends: 346 [2018-10-15 13:14:30,189 INFO L226 Difference]: Without dead ends: 346 [2018-10-15 13:14:30,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:14:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-15 13:14:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 337. [2018-10-15 13:14:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-15 13:14:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-10-15 13:14:30,194 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 325 [2018-10-15 13:14:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:30,194 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-10-15 13:14:30,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:14:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-10-15 13:14:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-15 13:14:30,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:30,197 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:30,197 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:30,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:30,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1804559317, now seen corresponding path program 28 times [2018-10-15 13:14:30,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:32,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:32,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:14:32,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:14:32,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:14:32,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:14:32,789 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 59 states. [2018-10-15 13:14:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:41,832 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-10-15 13:14:41,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:14:41,833 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 336 [2018-10-15 13:14:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:41,835 INFO L225 Difference]: With dead ends: 357 [2018-10-15 13:14:41,835 INFO L226 Difference]: Without dead ends: 357 [2018-10-15 13:14:41,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:14:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-15 13:14:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 348. [2018-10-15 13:14:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-15 13:14:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-10-15 13:14:41,841 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 336 [2018-10-15 13:14:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:41,841 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-10-15 13:14:41,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:14:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-10-15 13:14:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 13:14:41,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:41,843 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:41,844 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:41,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:41,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1234214432, now seen corresponding path program 29 times [2018-10-15 13:14:41,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4495 backedges. 0 proven. 4495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:44,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:44,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:14:44,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:14:44,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:14:44,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:14:44,637 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 61 states. [2018-10-15 13:14:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:54,136 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-10-15 13:14:54,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 13:14:54,137 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 347 [2018-10-15 13:14:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:54,139 INFO L225 Difference]: With dead ends: 368 [2018-10-15 13:14:54,139 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 13:14:54,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:14:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 13:14:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 359. [2018-10-15 13:14:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-15 13:14:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-10-15 13:14:54,145 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 347 [2018-10-15 13:14:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:54,145 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-10-15 13:14:54,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:14:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-10-15 13:14:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-15 13:14:54,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:54,148 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:54,148 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:54,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash -781019403, now seen corresponding path program 30 times [2018-10-15 13:14:54,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4815 backedges. 0 proven. 4815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:56,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:56,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:14:56,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:14:56,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:14:56,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:14:56,637 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 63 states. [2018-10-15 13:15:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:06,901 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-10-15 13:15:06,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 13:15:06,902 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 358 [2018-10-15 13:15:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:06,905 INFO L225 Difference]: With dead ends: 379 [2018-10-15 13:15:06,905 INFO L226 Difference]: Without dead ends: 379 [2018-10-15 13:15:06,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:15:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-15 13:15:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 370. [2018-10-15 13:15:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-15 13:15:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2018-10-15 13:15:06,910 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 358 [2018-10-15 13:15:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:06,911 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 370 transitions. [2018-10-15 13:15:06,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:15:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 370 transitions. [2018-10-15 13:15:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-15 13:15:06,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:06,913 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:06,913 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:06,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:06,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1040959744, now seen corresponding path program 31 times [2018-10-15 13:15:06,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5146 backedges. 0 proven. 5146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:09,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:09,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 13:15:09,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 13:15:09,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 13:15:09,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:15:09,239 INFO L87 Difference]: Start difference. First operand 370 states and 370 transitions. Second operand 65 states. [2018-10-15 13:15:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:20,394 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2018-10-15 13:15:20,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 13:15:20,397 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 369 [2018-10-15 13:15:20,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:20,399 INFO L225 Difference]: With dead ends: 390 [2018-10-15 13:15:20,400 INFO L226 Difference]: Without dead ends: 390 [2018-10-15 13:15:20,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:15:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-15 13:15:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 381. [2018-10-15 13:15:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-15 13:15:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-10-15 13:15:20,405 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 369 [2018-10-15 13:15:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:20,406 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-10-15 13:15:20,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 13:15:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-10-15 13:15:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-15 13:15:20,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:20,408 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:20,409 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:20,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:20,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252139, now seen corresponding path program 32 times [2018-10-15 13:15:20,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5488 backedges. 0 proven. 5488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:23,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:23,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:15:23,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:15:23,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:15:23,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:15:23,849 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 67 states. [2018-10-15 13:15:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:35,472 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-15 13:15:35,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 13:15:35,473 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 380 [2018-10-15 13:15:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:35,474 INFO L225 Difference]: With dead ends: 401 [2018-10-15 13:15:35,474 INFO L226 Difference]: Without dead ends: 401 [2018-10-15 13:15:35,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:15:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-15 13:15:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 392. [2018-10-15 13:15:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:15:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2018-10-15 13:15:35,479 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 380 [2018-10-15 13:15:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:35,479 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2018-10-15 13:15:35,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:15:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2018-10-15 13:15:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-15 13:15:35,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:35,482 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:35,482 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:35,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:35,482 INFO L82 PathProgramCache]: Analyzing trace with hash -595859488, now seen corresponding path program 33 times [2018-10-15 13:15:35,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5841 backedges. 0 proven. 5841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:38,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:38,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:15:38,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:15:38,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:15:38,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:15:38,430 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 69 states. [2018-10-15 13:15:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:50,607 INFO L93 Difference]: Finished difference Result 412 states and 412 transitions. [2018-10-15 13:15:50,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 13:15:50,608 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 391 [2018-10-15 13:15:50,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:50,610 INFO L225 Difference]: With dead ends: 412 [2018-10-15 13:15:50,610 INFO L226 Difference]: Without dead ends: 412 [2018-10-15 13:15:50,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:15:50,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-15 13:15:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 403. [2018-10-15 13:15:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 13:15:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-15 13:15:50,616 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 391 [2018-10-15 13:15:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:50,616 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-15 13:15:50,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:15:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-15 13:15:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 13:15:50,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:50,619 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:50,619 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:50,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 990623029, now seen corresponding path program 34 times [2018-10-15 13:15:50,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6205 backedges. 0 proven. 6205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:53,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:53,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:15:53,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:15:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:15:53,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:15:53,527 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 71 states. [2018-10-15 13:16:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:06,520 INFO L93 Difference]: Finished difference Result 423 states and 423 transitions. [2018-10-15 13:16:06,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 13:16:06,520 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 402 [2018-10-15 13:16:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:06,522 INFO L225 Difference]: With dead ends: 423 [2018-10-15 13:16:06,522 INFO L226 Difference]: Without dead ends: 423 [2018-10-15 13:16:06,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:16:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-15 13:16:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 414. [2018-10-15 13:16:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-15 13:16:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 414 transitions. [2018-10-15 13:16:06,527 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 414 transitions. Word has length 402 [2018-10-15 13:16:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:06,528 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 414 transitions. [2018-10-15 13:16:06,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:16:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 414 transitions. [2018-10-15 13:16:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-15 13:16:06,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:06,530 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:06,531 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:06,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:06,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1283829952, now seen corresponding path program 35 times [2018-10-15 13:16:06,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6580 backedges. 0 proven. 6580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:09,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:09,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 13:16:09,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 13:16:09,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 13:16:09,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:16:09,503 INFO L87 Difference]: Start difference. First operand 414 states and 414 transitions. Second operand 73 states. [2018-10-15 13:16:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:23,215 INFO L93 Difference]: Finished difference Result 434 states and 434 transitions. [2018-10-15 13:16:23,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 13:16:23,216 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 413 [2018-10-15 13:16:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:23,218 INFO L225 Difference]: With dead ends: 434 [2018-10-15 13:16:23,219 INFO L226 Difference]: Without dead ends: 434 [2018-10-15 13:16:23,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:16:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-15 13:16:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 425. [2018-10-15 13:16:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-15 13:16:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 425 transitions. [2018-10-15 13:16:23,223 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 425 transitions. Word has length 413 [2018-10-15 13:16:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:23,224 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 425 transitions. [2018-10-15 13:16:23,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 13:16:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 425 transitions. [2018-10-15 13:16:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-15 13:16:23,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:23,226 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:23,226 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:23,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash 537239637, now seen corresponding path program 36 times [2018-10-15 13:16:23,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6966 backedges. 0 proven. 6966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:26,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:26,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:16:26,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:16:26,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:16:26,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:16:26,334 INFO L87 Difference]: Start difference. First operand 425 states and 425 transitions. Second operand 75 states. [2018-10-15 13:16:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:40,685 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-10-15 13:16:40,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 13:16:40,685 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 424 [2018-10-15 13:16:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:40,688 INFO L225 Difference]: With dead ends: 445 [2018-10-15 13:16:40,688 INFO L226 Difference]: Without dead ends: 445 [2018-10-15 13:16:40,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:16:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-15 13:16:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 436. [2018-10-15 13:16:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-15 13:16:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2018-10-15 13:16:40,693 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 424 [2018-10-15 13:16:40,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:40,694 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2018-10-15 13:16:40,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:16:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2018-10-15 13:16:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-15 13:16:40,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:40,697 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:40,697 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:40,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash -890269280, now seen corresponding path program 37 times [2018-10-15 13:16:40,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7363 backedges. 0 proven. 7363 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:44,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:44,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 13:16:44,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 13:16:44,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 13:16:44,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:16:44,780 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 77 states. [2018-10-15 13:17:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:00,064 INFO L93 Difference]: Finished difference Result 456 states and 456 transitions. [2018-10-15 13:17:00,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 13:17:00,065 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 435 [2018-10-15 13:17:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:00,067 INFO L225 Difference]: With dead ends: 456 [2018-10-15 13:17:00,067 INFO L226 Difference]: Without dead ends: 456 [2018-10-15 13:17:00,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 13:17:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-10-15 13:17:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 447. [2018-10-15 13:17:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-15 13:17:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 447 transitions. [2018-10-15 13:17:00,073 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 447 transitions. Word has length 435 [2018-10-15 13:17:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:00,073 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 447 transitions. [2018-10-15 13:17:00,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 13:17:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 447 transitions. [2018-10-15 13:17:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-15 13:17:00,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:00,076 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:00,076 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:00,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash -501189771, now seen corresponding path program 38 times [2018-10-15 13:17:00,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7771 backedges. 0 proven. 7771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:03,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:03,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:17:03,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:17:03,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:17:03,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:17:03,608 INFO L87 Difference]: Start difference. First operand 447 states and 447 transitions. Second operand 79 states. [2018-10-15 13:17:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:19,508 INFO L93 Difference]: Finished difference Result 467 states and 467 transitions. [2018-10-15 13:17:19,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 13:17:19,508 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 446 [2018-10-15 13:17:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:19,510 INFO L225 Difference]: With dead ends: 467 [2018-10-15 13:17:19,510 INFO L226 Difference]: Without dead ends: 467 [2018-10-15 13:17:19,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 13:17:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-15 13:17:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 458. [2018-10-15 13:17:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-10-15 13:17:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 458 transitions. [2018-10-15 13:17:19,515 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 458 transitions. Word has length 446 [2018-10-15 13:17:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:19,516 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 458 transitions. [2018-10-15 13:17:19,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:17:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 458 transitions. [2018-10-15 13:17:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-10-15 13:17:19,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:19,518 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:19,519 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:19,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:19,519 INFO L82 PathProgramCache]: Analyzing trace with hash -166229376, now seen corresponding path program 39 times [2018-10-15 13:17:19,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:23,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:23,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:17:23,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:17:23,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:17:23,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:17:23,441 INFO L87 Difference]: Start difference. First operand 458 states and 458 transitions. Second operand 81 states. [2018-10-15 13:17:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:40,057 INFO L93 Difference]: Finished difference Result 478 states and 478 transitions. [2018-10-15 13:17:40,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 13:17:40,057 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 457 [2018-10-15 13:17:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:40,060 INFO L225 Difference]: With dead ends: 478 [2018-10-15 13:17:40,060 INFO L226 Difference]: Without dead ends: 478 [2018-10-15 13:17:40,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 13:17:40,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-10-15 13:17:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 469. [2018-10-15 13:17:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-15 13:17:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 469 transitions. [2018-10-15 13:17:40,065 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 469 transitions. Word has length 457 [2018-10-15 13:17:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:40,065 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 469 transitions. [2018-10-15 13:17:40,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:17:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 469 transitions. [2018-10-15 13:17:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-10-15 13:17:40,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:40,069 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:40,069 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:40,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:40,069 INFO L82 PathProgramCache]: Analyzing trace with hash -599904619, now seen corresponding path program 40 times [2018-10-15 13:17:40,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8620 backedges. 0 proven. 8620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:43,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:43,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:17:43,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:17:43,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:17:43,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:17:43,949 INFO L87 Difference]: Start difference. First operand 469 states and 469 transitions. Second operand 83 states. [2018-10-15 13:18:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:01,341 INFO L93 Difference]: Finished difference Result 489 states and 489 transitions. [2018-10-15 13:18:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 13:18:01,342 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 468 [2018-10-15 13:18:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:01,343 INFO L225 Difference]: With dead ends: 489 [2018-10-15 13:18:01,343 INFO L226 Difference]: Without dead ends: 489 [2018-10-15 13:18:01,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 13:18:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-15 13:18:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 480. [2018-10-15 13:18:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-15 13:18:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 480 transitions. [2018-10-15 13:18:01,348 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 480 transitions. Word has length 468 [2018-10-15 13:18:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:01,348 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 480 transitions. [2018-10-15 13:18:01,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:18:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 480 transitions. [2018-10-15 13:18:01,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 13:18:01,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:01,353 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:01,353 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:01,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash 836475744, now seen corresponding path program 41 times [2018-10-15 13:18:01,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9061 backedges. 0 proven. 9061 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:05,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:05,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 13:18:05,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 13:18:05,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 13:18:05,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:18:05,437 INFO L87 Difference]: Start difference. First operand 480 states and 480 transitions. Second operand 85 states. [2018-10-15 13:18:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:23,701 INFO L93 Difference]: Finished difference Result 500 states and 500 transitions. [2018-10-15 13:18:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 13:18:23,701 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 479 [2018-10-15 13:18:23,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:23,703 INFO L225 Difference]: With dead ends: 500 [2018-10-15 13:18:23,703 INFO L226 Difference]: Without dead ends: 500 [2018-10-15 13:18:23,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 13:18:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-15 13:18:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 491. [2018-10-15 13:18:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-10-15 13:18:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 491 transitions. [2018-10-15 13:18:23,709 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 491 transitions. Word has length 479 [2018-10-15 13:18:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:23,710 INFO L481 AbstractCegarLoop]: Abstraction has 491 states and 491 transitions. [2018-10-15 13:18:23,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 13:18:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 491 transitions. [2018-10-15 13:18:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-10-15 13:18:23,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:23,713 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:23,713 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:23,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:23,713 INFO L82 PathProgramCache]: Analyzing trace with hash 868274613, now seen corresponding path program 42 times [2018-10-15 13:18:23,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9513 backedges. 0 proven. 9513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:28,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:28,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:18:28,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:18:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:18:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:18:28,113 INFO L87 Difference]: Start difference. First operand 491 states and 491 transitions. Second operand 87 states. [2018-10-15 13:18:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:47,454 INFO L93 Difference]: Finished difference Result 511 states and 511 transitions. [2018-10-15 13:18:47,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 13:18:47,454 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 490 [2018-10-15 13:18:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:47,457 INFO L225 Difference]: With dead ends: 511 [2018-10-15 13:18:47,457 INFO L226 Difference]: Without dead ends: 511 [2018-10-15 13:18:47,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 13:18:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-10-15 13:18:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 502. [2018-10-15 13:18:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-10-15 13:18:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 502 transitions. [2018-10-15 13:18:47,462 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 502 transitions. Word has length 490 [2018-10-15 13:18:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:47,463 INFO L481 AbstractCegarLoop]: Abstraction has 502 states and 502 transitions. [2018-10-15 13:18:47,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:18:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 502 transitions. [2018-10-15 13:18:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-10-15 13:18:47,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:47,465 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:47,465 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:47,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:47,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2019965888, now seen corresponding path program 43 times [2018-10-15 13:18:47,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9976 backedges. 0 proven. 9976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:52,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:52,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 13:18:52,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 13:18:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 13:18:52,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:18:52,165 INFO L87 Difference]: Start difference. First operand 502 states and 502 transitions. Second operand 89 states. [2018-10-15 13:19:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:12,343 INFO L93 Difference]: Finished difference Result 522 states and 522 transitions. [2018-10-15 13:19:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 13:19:12,343 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 501 [2018-10-15 13:19:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:12,346 INFO L225 Difference]: With dead ends: 522 [2018-10-15 13:19:12,346 INFO L226 Difference]: Without dead ends: 522 [2018-10-15 13:19:12,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 13:19:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-15 13:19:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 513. [2018-10-15 13:19:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-15 13:19:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 513 transitions. [2018-10-15 13:19:12,351 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 513 transitions. Word has length 501 [2018-10-15 13:19:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:12,351 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 513 transitions. [2018-10-15 13:19:12,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 13:19:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 513 transitions. [2018-10-15 13:19:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-10-15 13:19:12,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:12,354 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:12,354 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:12,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash -125149995, now seen corresponding path program 44 times [2018-10-15 13:19:12,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:17,503 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 13:19:17,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:17,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:19:17,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:19:17,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:19:17,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:19:17,504 INFO L87 Difference]: Start difference. First operand 513 states and 513 transitions. Second operand 91 states. [2018-10-15 13:19:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:38,646 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-15 13:19:38,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 13:19:38,646 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 512 [2018-10-15 13:19:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:38,648 INFO L225 Difference]: With dead ends: 533 [2018-10-15 13:19:38,648 INFO L226 Difference]: Without dead ends: 533 [2018-10-15 13:19:38,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 13:19:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-15 13:19:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2018-10-15 13:19:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-15 13:19:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 524 transitions. [2018-10-15 13:19:38,653 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 524 transitions. Word has length 512 [2018-10-15 13:19:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:38,653 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 524 transitions. [2018-10-15 13:19:38,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:19:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 524 transitions. [2018-10-15 13:19:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-10-15 13:19:38,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:38,656 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:38,656 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:38,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:38,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2043673312, now seen corresponding path program 45 times [2018-10-15 13:19:38,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10935 backedges. 0 proven. 10935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:43,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:43,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:19:43,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:19:43,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:19:43,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:19:43,596 INFO L87 Difference]: Start difference. First operand 524 states and 524 transitions. Second operand 93 states. [2018-10-15 13:20:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:05,522 INFO L93 Difference]: Finished difference Result 544 states and 544 transitions. [2018-10-15 13:20:05,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 13:20:05,522 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 523 [2018-10-15 13:20:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:05,524 INFO L225 Difference]: With dead ends: 544 [2018-10-15 13:20:05,524 INFO L226 Difference]: Without dead ends: 544 [2018-10-15 13:20:05,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 13:20:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-10-15 13:20:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 535. [2018-10-15 13:20:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-15 13:20:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 535 transitions. [2018-10-15 13:20:05,529 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 535 transitions. Word has length 523 [2018-10-15 13:20:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:05,529 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 535 transitions. [2018-10-15 13:20:05,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:20:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 535 transitions. [2018-10-15 13:20:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-15 13:20:05,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:05,532 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:05,532 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:05,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:05,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1157418997, now seen corresponding path program 46 times [2018-10-15 13:20:05,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11431 backedges. 0 proven. 11431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:10,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:10,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 13:20:10,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 13:20:10,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 13:20:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:20:10,598 INFO L87 Difference]: Start difference. First operand 535 states and 535 transitions. Second operand 95 states. [2018-10-15 13:20:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:33,694 INFO L93 Difference]: Finished difference Result 555 states and 555 transitions. [2018-10-15 13:20:33,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 13:20:33,695 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 534 [2018-10-15 13:20:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:33,697 INFO L225 Difference]: With dead ends: 555 [2018-10-15 13:20:33,697 INFO L226 Difference]: Without dead ends: 555 [2018-10-15 13:20:33,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 13:20:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-10-15 13:20:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 546. [2018-10-15 13:20:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-10-15 13:20:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 546 transitions. [2018-10-15 13:20:33,702 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 546 transitions. Word has length 534 [2018-10-15 13:20:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:33,702 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 546 transitions. [2018-10-15 13:20:33,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 13:20:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 546 transitions. [2018-10-15 13:20:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-10-15 13:20:33,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:33,705 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:33,705 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:33,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:33,706 INFO L82 PathProgramCache]: Analyzing trace with hash 570187264, now seen corresponding path program 47 times [2018-10-15 13:20:33,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11938 backedges. 0 proven. 11938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:38,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:38,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 13:20:38,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 13:20:38,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 13:20:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:20:38,756 INFO L87 Difference]: Start difference. First operand 546 states and 546 transitions. Second operand 97 states. [2018-10-15 13:20:42,256 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 9