java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call3_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:21,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:21,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:21,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:21,225 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:21,226 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:21,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:21,231 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:21,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:21,238 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:21,241 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:21,241 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:21,242 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:21,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:21,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:21,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:21,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:21,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:21,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:21,268 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:21,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:21,273 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:21,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:21,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:21,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:21,280 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:21,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:21,282 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:21,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:21,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:21,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:21,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:21,288 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:21,288 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:21,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:21,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:21,291 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 12:55:21,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:21,309 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:21,309 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:21,312 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:21,312 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:21,313 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:21,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:21,314 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:21,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:21,315 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:21,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:21,315 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:21,315 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:21,316 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:21,317 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:21,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:21,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:21,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:21,419 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:21,419 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:21,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call3_true-termination.i_3.bpl [2018-10-15 12:55:21,420 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call3_true-termination.i_3.bpl' [2018-10-15 12:55:21,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:21,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:21,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:21,502 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:21,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:21,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:21,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:21,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 12:55:21,637 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:21,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:22,182 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:22,183 INFO L202 PluginConnector]: Adding new model array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22 BoogieIcfgContainer [2018-10-15 12:55:22,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:22,184 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:22,184 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:22,185 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:22,189 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22" (1/1) ... [2018-10-15 12:55:22,197 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-15 12:55:22,198 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-15 12:55:22,235 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-15 12:55:22,279 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-15 12:55:22,295 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-15 12:55:22,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-15 12:55:25,374 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 12:55:25,378 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-15 12:55:25,382 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-15 12:55:25,415 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 12:55:25,421 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 12:55:25,421 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_2|) |v_ULTIMATE.start_read~int_#ptr.offset_2|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-15 12:55:25,423 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-15 12:55:25,424 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 12:55:25,428 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:25,428 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,428 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,428 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:25,429 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,429 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,429 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 12:55:25,429 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:25,429 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,430 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,430 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:25,430 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,432 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,437 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-15 12:55:25,459 INFO L202 PluginConnector]: Adding new model array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:25 BasicIcfg [2018-10-15 12:55:25,460 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:25,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:25,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:25,466 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:25,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/3) ... [2018-10-15 12:55:25,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ce1acb and model type array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:55:25, skipping insertion in model container [2018-10-15 12:55:25,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22" (2/3) ... [2018-10-15 12:55:25,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ce1acb and model type array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:55:25, skipping insertion in model container [2018-10-15 12:55:25,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:25" (3/3) ... [2018-10-15 12:55:25,470 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-15 12:55:25,484 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:25,494 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:25,516 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:25,547 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:25,548 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:25,548 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:25,548 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:25,549 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:25,549 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:25,550 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:25,550 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:25,550 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-10-15 12:55:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 12:55:25,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:25,580 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] [2018-10-15 12:55:25,581 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:25,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1085521132, now seen corresponding path program 1 times [2018-10-15 12:55:25,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:25,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:25,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:25,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:25,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:25,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:25,900 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-10-15 12:55:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:26,090 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 12:55:26,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:26,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-15 12:55:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:26,108 INFO L225 Difference]: With dead ends: 48 [2018-10-15 12:55:26,108 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 12:55:26,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 12:55:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-10-15 12:55:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 12:55:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-15 12:55:26,219 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 29 [2018-10-15 12:55:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:26,220 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-15 12:55:26,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-15 12:55:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 12:55:26,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,222 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 12:55:26,223 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,224 INFO L82 PathProgramCache]: Analyzing trace with hash -269835606, now seen corresponding path program 1 times [2018-10-15 12:55:26,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:26,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:26,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:26,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:26,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:26,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:26,403 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 5 states. [2018-10-15 12:55:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:26,713 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 12:55:26,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:55:26,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-15 12:55:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:26,715 INFO L225 Difference]: With dead ends: 58 [2018-10-15 12:55:26,715 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 12:55:26,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 12:55:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-10-15 12:55:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 12:55:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-15 12:55:26,723 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 39 [2018-10-15 12:55:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:26,723 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-15 12:55:26,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-15 12:55:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 12:55:26,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,725 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:26,726 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1889599808, now seen corresponding path program 2 times [2018-10-15 12:55:26,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:26,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:26,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:55:26,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:55:26,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:55:26,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:26,941 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 7 states. [2018-10-15 12:55:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,150 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-15 12:55:27,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:55:27,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-10-15 12:55:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,155 INFO L225 Difference]: With dead ends: 68 [2018-10-15 12:55:27,156 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 12:55:27,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 12:55:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-10-15 12:55:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 12:55:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-15 12:55:27,164 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 49 [2018-10-15 12:55:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,164 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-15 12:55:27,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:55:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-15 12:55:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 12:55:27,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,166 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:27,167 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1773647702, now seen corresponding path program 3 times [2018-10-15 12:55:27,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:27,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:27,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:27,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:27,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:27,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:27,385 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 9 states. [2018-10-15 12:55:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,584 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 12:55:27,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:55:27,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-10-15 12:55:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,585 INFO L225 Difference]: With dead ends: 78 [2018-10-15 12:55:27,586 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 12:55:27,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 12:55:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2018-10-15 12:55:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 12:55:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-15 12:55:27,592 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 59 [2018-10-15 12:55:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,593 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-15 12:55:27,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-15 12:55:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 12:55:27,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,595 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:27,595 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,595 INFO L82 PathProgramCache]: Analyzing trace with hash -729076628, now seen corresponding path program 4 times [2018-10-15 12:55:27,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:28,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:28,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:28,113 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 11 states. [2018-10-15 12:55:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:28,539 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-15 12:55:28,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:55:28,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-10-15 12:55:28,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:28,544 INFO L225 Difference]: With dead ends: 88 [2018-10-15 12:55:28,545 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 12:55:28,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 12:55:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2018-10-15 12:55:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 12:55:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-15 12:55:28,558 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 69 [2018-10-15 12:55:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:28,559 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-15 12:55:28,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-15 12:55:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:55:28,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:28,563 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:28,563 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:28,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:28,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1693957634, now seen corresponding path program 5 times [2018-10-15 12:55:28,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:28,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:28,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:28,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:28,835 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 13 states. [2018-10-15 12:55:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,161 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-15 12:55:29,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:55:29,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-10-15 12:55:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,164 INFO L225 Difference]: With dead ends: 98 [2018-10-15 12:55:29,164 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 12:55:29,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:29,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 12:55:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2018-10-15 12:55:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-15 12:55:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-15 12:55:29,171 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 79 [2018-10-15 12:55:29,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,172 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-15 12:55:29,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:29,172 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-15 12:55:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 12:55:29,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,174 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:29,174 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash 631491608, now seen corresponding path program 6 times [2018-10-15 12:55:29,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:29,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:29,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:29,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:29,402 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 15 states. [2018-10-15 12:55:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,730 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 12:55:29,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:55:29,730 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-15 12:55:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,732 INFO L225 Difference]: With dead ends: 108 [2018-10-15 12:55:29,732 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:55:29,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:29,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:55:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-10-15 12:55:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 12:55:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-15 12:55:29,740 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 89 [2018-10-15 12:55:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,741 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-15 12:55:29,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-15 12:55:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 12:55:29,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,743 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:29,743 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1287501486, now seen corresponding path program 7 times [2018-10-15 12:55:29,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:29,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:29,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:29,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:29,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:29,974 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 17 states. [2018-10-15 12:55:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:30,327 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 12:55:30,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:55:30,327 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2018-10-15 12:55:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:30,329 INFO L225 Difference]: With dead ends: 118 [2018-10-15 12:55:30,329 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 12:55:30,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 12:55:30,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2018-10-15 12:55:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 12:55:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 12:55:30,339 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 99 [2018-10-15 12:55:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:30,339 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 12:55:30,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 12:55:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:55:30,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:30,342 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:30,342 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:30,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:30,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1912331716, now seen corresponding path program 8 times [2018-10-15 12:55:30,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:30,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:30,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:30,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:30,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:30,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:30,676 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 19 states. [2018-10-15 12:55:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:31,135 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-15 12:55:31,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:55:31,137 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-10-15 12:55:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:31,138 INFO L225 Difference]: With dead ends: 128 [2018-10-15 12:55:31,138 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 12:55:31,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 12:55:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-10-15 12:55:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-15 12:55:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-15 12:55:31,144 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 109 [2018-10-15 12:55:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:31,144 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-15 12:55:31,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-15 12:55:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 12:55:31,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:31,146 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:31,147 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:31,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:31,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1151115610, now seen corresponding path program 9 times [2018-10-15 12:55:31,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:31,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:31,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:31,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:31,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:31,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:31,451 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 21 states. [2018-10-15 12:55:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:32,098 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-15 12:55:32,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:55:32,099 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-10-15 12:55:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:32,100 INFO L225 Difference]: With dead ends: 138 [2018-10-15 12:55:32,100 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 12:55:32,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:32,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 12:55:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2018-10-15 12:55:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-15 12:55:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-15 12:55:32,107 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 119 [2018-10-15 12:55:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:32,108 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-15 12:55:32,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-15 12:55:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 12:55:32,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:32,110 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:32,110 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:32,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:32,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1050254992, now seen corresponding path program 10 times [2018-10-15 12:55:32,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:32,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:32,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:32,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:32,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:32,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:32,527 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 23 states. [2018-10-15 12:55:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:33,079 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 12:55:33,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:55:33,080 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-10-15 12:55:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:33,082 INFO L225 Difference]: With dead ends: 148 [2018-10-15 12:55:33,082 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 12:55:33,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 12:55:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2018-10-15 12:55:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:55:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-15 12:55:33,090 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 129 [2018-10-15 12:55:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:33,090 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-15 12:55:33,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-15 12:55:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:55:33,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:33,093 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:33,093 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:33,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:33,093 INFO L82 PathProgramCache]: Analyzing trace with hash -391676410, now seen corresponding path program 11 times [2018-10-15 12:55:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:33,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:33,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:33,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:33,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:33,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:33,542 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 25 states. [2018-10-15 12:55:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:34,233 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-15 12:55:34,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:55:34,233 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 139 [2018-10-15 12:55:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:34,235 INFO L225 Difference]: With dead ends: 158 [2018-10-15 12:55:34,235 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 12:55:34,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 12:55:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2018-10-15 12:55:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 12:55:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-15 12:55:34,244 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 139 [2018-10-15 12:55:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:34,244 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-15 12:55:34,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-15 12:55:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:55:34,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:34,246 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:34,246 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:34,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:34,247 INFO L82 PathProgramCache]: Analyzing trace with hash -197765348, now seen corresponding path program 12 times [2018-10-15 12:55:34,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:34,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:34,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:34,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:34,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:34,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:34,611 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 27 states. [2018-10-15 12:55:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:35,166 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-10-15 12:55:35,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:55:35,167 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 149 [2018-10-15 12:55:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:35,169 INFO L225 Difference]: With dead ends: 168 [2018-10-15 12:55:35,169 INFO L226 Difference]: Without dead ends: 168 [2018-10-15 12:55:35,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-15 12:55:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2018-10-15 12:55:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 12:55:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-15 12:55:35,174 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 149 [2018-10-15 12:55:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:35,175 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-15 12:55:35,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:35,175 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-15 12:55:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 12:55:35,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:35,176 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:35,176 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:35,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:35,177 INFO L82 PathProgramCache]: Analyzing trace with hash 225529010, now seen corresponding path program 13 times [2018-10-15 12:55:35,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:36,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:36,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:36,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:36,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:36,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:36,355 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 29 states. [2018-10-15 12:55:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,822 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-15 12:55:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:55:37,822 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 159 [2018-10-15 12:55:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,823 INFO L225 Difference]: With dead ends: 178 [2018-10-15 12:55:37,823 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 12:55:37,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:55:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 12:55:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2018-10-15 12:55:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 12:55:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-15 12:55:37,828 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 159 [2018-10-15 12:55:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,829 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-15 12:55:37,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-15 12:55:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:55:37,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,830 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:37,830 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2093039928, now seen corresponding path program 14 times [2018-10-15 12:55:37,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:38,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:38,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:38,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:38,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:38,342 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 31 states. [2018-10-15 12:55:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,980 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-15 12:55:38,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:55:38,980 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 169 [2018-10-15 12:55:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,982 INFO L225 Difference]: With dead ends: 188 [2018-10-15 12:55:38,982 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 12:55:38,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:55:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 12:55:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2018-10-15 12:55:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-15 12:55:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-15 12:55:38,987 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 169 [2018-10-15 12:55:38,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,988 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-15 12:55:38,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-15 12:55:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 12:55:38,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,989 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,989 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2146628258, now seen corresponding path program 15 times [2018-10-15 12:55:38,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:40,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:40,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:40,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:40,304 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 33 states. [2018-10-15 12:55:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:41,092 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-15 12:55:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:55:41,093 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 179 [2018-10-15 12:55:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:41,095 INFO L225 Difference]: With dead ends: 198 [2018-10-15 12:55:41,095 INFO L226 Difference]: Without dead ends: 198 [2018-10-15 12:55:41,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:55:41,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-15 12:55:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2018-10-15 12:55:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-15 12:55:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-15 12:55:41,102 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 179 [2018-10-15 12:55:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,102 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-15 12:55:41,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-15 12:55:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-15 12:55:41,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,104 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:41,104 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1070766196, now seen corresponding path program 16 times [2018-10-15 12:55:41,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:41,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:41,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:41,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:41,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:41,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:41,599 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 35 states. [2018-10-15 12:55:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:42,710 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-15 12:55:42,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:55:42,711 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2018-10-15 12:55:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:42,712 INFO L225 Difference]: With dead ends: 208 [2018-10-15 12:55:42,712 INFO L226 Difference]: Without dead ends: 208 [2018-10-15 12:55:42,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:55:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-15 12:55:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 200. [2018-10-15 12:55:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:55:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 12:55:42,717 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 189 [2018-10-15 12:55:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:42,718 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 12:55:42,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:55:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 12:55:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:55:42,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:42,719 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:42,719 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:42,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash -972177398, now seen corresponding path program 17 times [2018-10-15 12:55:42,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 1377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:43,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:43,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:55:43,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:55:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:55:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:43,722 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 37 states. [2018-10-15 12:55:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:44,624 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-15 12:55:44,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:55:44,624 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 199 [2018-10-15 12:55:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:44,627 INFO L225 Difference]: With dead ends: 218 [2018-10-15 12:55:44,627 INFO L226 Difference]: Without dead ends: 218 [2018-10-15 12:55:44,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:55:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-15 12:55:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-10-15 12:55:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-15 12:55:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-15 12:55:44,633 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 199 [2018-10-15 12:55:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:44,634 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-15 12:55:44,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:55:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-15 12:55:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 12:55:44,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:44,635 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:44,635 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:44,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:44,636 INFO L82 PathProgramCache]: Analyzing trace with hash 331670560, now seen corresponding path program 18 times [2018-10-15 12:55:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 1548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:45,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:45,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:55:45,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:55:45,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:55:45,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:45,249 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 39 states. [2018-10-15 12:55:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:46,199 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-10-15 12:55:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:55:46,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 209 [2018-10-15 12:55:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:46,201 INFO L225 Difference]: With dead ends: 228 [2018-10-15 12:55:46,201 INFO L226 Difference]: Without dead ends: 228 [2018-10-15 12:55:46,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:55:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-15 12:55:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 220. [2018-10-15 12:55:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 12:55:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-10-15 12:55:46,208 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 209 [2018-10-15 12:55:46,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:46,208 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-10-15 12:55:46,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:55:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-10-15 12:55:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 12:55:46,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:46,210 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:46,210 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:46,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:46,211 INFO L82 PathProgramCache]: Analyzing trace with hash -578394954, now seen corresponding path program 19 times [2018-10-15 12:55:46,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:47,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:47,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:55:47,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:55:47,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:55:47,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:55:47,267 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 41 states. [2018-10-15 12:55:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:48,410 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-15 12:55:48,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:55:48,410 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 219 [2018-10-15 12:55:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:48,413 INFO L225 Difference]: With dead ends: 238 [2018-10-15 12:55:48,413 INFO L226 Difference]: Without dead ends: 238 [2018-10-15 12:55:48,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:55:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-15 12:55:48,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2018-10-15 12:55:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 12:55:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-15 12:55:48,420 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 219 [2018-10-15 12:55:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:48,420 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-15 12:55:48,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:55:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-15 12:55:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 12:55:48,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:48,422 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:48,422 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:48,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1050107444, now seen corresponding path program 20 times [2018-10-15 12:55:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 0 proven. 1920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:49,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:49,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:55:49,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:55:49,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:55:49,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:49,141 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 43 states. [2018-10-15 12:55:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:50,315 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-15 12:55:50,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:55:50,315 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 229 [2018-10-15 12:55:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:50,317 INFO L225 Difference]: With dead ends: 248 [2018-10-15 12:55:50,317 INFO L226 Difference]: Without dead ends: 248 [2018-10-15 12:55:50,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:55:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-15 12:55:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 240. [2018-10-15 12:55:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 12:55:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-15 12:55:50,324 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 229 [2018-10-15 12:55:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:50,325 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-15 12:55:50,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:55:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-15 12:55:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 12:55:50,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:50,326 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:50,326 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:50,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:50,327 INFO L82 PathProgramCache]: Analyzing trace with hash -49677470, now seen corresponding path program 21 times [2018-10-15 12:55:50,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 0 proven. 2121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:52,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:52,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:55:52,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:55:52,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:55:52,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:55:52,018 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 45 states. [2018-10-15 12:55:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:53,579 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-10-15 12:55:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:55:53,581 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 239 [2018-10-15 12:55:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:53,583 INFO L225 Difference]: With dead ends: 258 [2018-10-15 12:55:53,583 INFO L226 Difference]: Without dead ends: 258 [2018-10-15 12:55:53,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:55:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-15 12:55:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 250. [2018-10-15 12:55:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-15 12:55:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-10-15 12:55:53,589 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 239 [2018-10-15 12:55:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:53,589 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-10-15 12:55:53,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:55:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-10-15 12:55:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 12:55:53,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:53,591 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:53,591 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:53,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1550790280, now seen corresponding path program 22 times [2018-10-15 12:55:53,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 2332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:54,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:54,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:55:54,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:55:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:55:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:54,411 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 47 states. [2018-10-15 12:55:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:56,092 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-15 12:55:56,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:55:56,092 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 249 [2018-10-15 12:55:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:56,095 INFO L225 Difference]: With dead ends: 268 [2018-10-15 12:55:56,095 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 12:55:56,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:55:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 12:55:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2018-10-15 12:55:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 12:55:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-15 12:55:56,101 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 249 [2018-10-15 12:55:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:56,102 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-15 12:55:56,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:55:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-15 12:55:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 12:55:56,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:56,103 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:56,104 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:56,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:56,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1403749390, now seen corresponding path program 23 times [2018-10-15 12:55:56,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2553 backedges. 0 proven. 2553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:58,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:58,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:55:58,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:55:58,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:55:58,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:55:58,190 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 49 states. [2018-10-15 12:55:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:59,650 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-10-15 12:55:59,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:55:59,650 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 259 [2018-10-15 12:55:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:59,652 INFO L225 Difference]: With dead ends: 278 [2018-10-15 12:55:59,653 INFO L226 Difference]: Without dead ends: 278 [2018-10-15 12:55:59,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:55:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-15 12:55:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 270. [2018-10-15 12:55:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-15 12:55:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-15 12:55:59,658 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 259 [2018-10-15 12:55:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:59,659 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-15 12:55:59,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:55:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-15 12:55:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 12:55:59,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:59,661 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:59,661 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:59,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1838183204, now seen corresponding path program 24 times [2018-10-15 12:55:59,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 0 proven. 2784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:01,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:01,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:56:01,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:56:01,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:56:01,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:56:01,210 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 51 states. [2018-10-15 12:56:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:03,101 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-10-15 12:56:03,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:56:03,105 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 269 [2018-10-15 12:56:03,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:03,107 INFO L225 Difference]: With dead ends: 288 [2018-10-15 12:56:03,107 INFO L226 Difference]: Without dead ends: 288 [2018-10-15 12:56:03,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:56:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-15 12:56:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2018-10-15 12:56:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-15 12:56:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-10-15 12:56:03,113 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 269 [2018-10-15 12:56:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:03,113 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-10-15 12:56:03,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:56:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-10-15 12:56:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 12:56:03,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:03,115 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:03,115 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:03,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash -922878278, now seen corresponding path program 25 times [2018-10-15 12:56:03,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:04,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:04,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:04,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:04,511 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 53 states. [2018-10-15 12:56:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:06,262 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-10-15 12:56:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:56:06,265 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 279 [2018-10-15 12:56:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:06,267 INFO L225 Difference]: With dead ends: 298 [2018-10-15 12:56:06,267 INFO L226 Difference]: Without dead ends: 298 [2018-10-15 12:56:06,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:56:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-15 12:56:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 290. [2018-10-15 12:56:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:56:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 12:56:06,274 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 279 [2018-10-15 12:56:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:06,275 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 12:56:06,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 12:56:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:56:06,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:06,277 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:06,277 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:06,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash -348485936, now seen corresponding path program 26 times [2018-10-15 12:56:06,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3276 backedges. 0 proven. 3276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:07,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:07,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:07,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:07,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:07,497 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 55 states. [2018-10-15 12:56:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:09,412 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-10-15 12:56:09,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:56:09,412 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 289 [2018-10-15 12:56:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:09,415 INFO L225 Difference]: With dead ends: 308 [2018-10-15 12:56:09,415 INFO L226 Difference]: Without dead ends: 308 [2018-10-15 12:56:09,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:56:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-15 12:56:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2018-10-15 12:56:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-15 12:56:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-10-15 12:56:09,423 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 289 [2018-10-15 12:56:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:09,424 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-10-15 12:56:09,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-10-15 12:56:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 12:56:09,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:09,426 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:09,426 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:09,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:09,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1122735258, now seen corresponding path program 27 times [2018-10-15 12:56:09,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:10,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:10,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:10,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:10,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:10,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:10,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:10,688 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 57 states. [2018-10-15 12:56:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:13,503 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-10-15 12:56:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:56:13,504 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 299 [2018-10-15 12:56:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:13,505 INFO L225 Difference]: With dead ends: 318 [2018-10-15 12:56:13,505 INFO L226 Difference]: Without dead ends: 318 [2018-10-15 12:56:13,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:56:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-15 12:56:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2018-10-15 12:56:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-15 12:56:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-10-15 12:56:13,510 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 299 [2018-10-15 12:56:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:13,510 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-10-15 12:56:13,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:56:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-10-15 12:56:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 12:56:13,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:13,512 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:13,513 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:13,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1058927492, now seen corresponding path program 28 times [2018-10-15 12:56:13,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 0 proven. 3808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:15,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:15,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:56:15,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:56:15,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:56:15,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:15,614 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 59 states. [2018-10-15 12:56:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:17,605 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-15 12:56:17,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:56:17,605 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 309 [2018-10-15 12:56:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:17,607 INFO L225 Difference]: With dead ends: 328 [2018-10-15 12:56:17,607 INFO L226 Difference]: Without dead ends: 328 [2018-10-15 12:56:17,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:56:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-15 12:56:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 320. [2018-10-15 12:56:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 12:56:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-15 12:56:17,613 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 309 [2018-10-15 12:56:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:17,613 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-15 12:56:17,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:56:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-15 12:56:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 12:56:17,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:17,615 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:17,615 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:17,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash -931018222, now seen corresponding path program 29 times [2018-10-15 12:56:17,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4089 backedges. 0 proven. 4089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:19,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:19,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:56:19,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:56:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:56:19,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:19,334 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 61 states. [2018-10-15 12:56:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:21,588 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-10-15 12:56:21,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:56:21,589 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 319 [2018-10-15 12:56:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:21,590 INFO L225 Difference]: With dead ends: 338 [2018-10-15 12:56:21,590 INFO L226 Difference]: Without dead ends: 338 [2018-10-15 12:56:21,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:56:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-15 12:56:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 330. [2018-10-15 12:56:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-15 12:56:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-10-15 12:56:21,597 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 319 [2018-10-15 12:56:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:21,597 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-10-15 12:56:21,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:56:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-10-15 12:56:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-15 12:56:21,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:21,599 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:21,599 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:21,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash 727319592, now seen corresponding path program 30 times [2018-10-15 12:56:21,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4380 backedges. 0 proven. 4380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:23,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:23,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:56:23,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:56:23,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:56:23,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:23,415 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 63 states. [2018-10-15 12:56:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:25,702 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-10-15 12:56:25,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:56:25,703 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 329 [2018-10-15 12:56:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:25,705 INFO L225 Difference]: With dead ends: 348 [2018-10-15 12:56:25,705 INFO L226 Difference]: Without dead ends: 348 [2018-10-15 12:56:25,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:56:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-15 12:56:25,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 340. [2018-10-15 12:56:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-15 12:56:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-10-15 12:56:25,711 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 329 [2018-10-15 12:56:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:25,711 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-10-15 12:56:25,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:56:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-10-15 12:56:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 12:56:25,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:25,714 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:25,714 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:25,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:25,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2086214334, now seen corresponding path program 31 times [2018-10-15 12:56:25,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4681 backedges. 0 proven. 4681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:27,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:27,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:56:27,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:56:27,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:56:27,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:27,135 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 65 states. [2018-10-15 12:56:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:29,733 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-10-15 12:56:29,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:56:29,734 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 339 [2018-10-15 12:56:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:29,737 INFO L225 Difference]: With dead ends: 358 [2018-10-15 12:56:29,737 INFO L226 Difference]: Without dead ends: 358 [2018-10-15 12:56:29,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:56:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-15 12:56:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 350. [2018-10-15 12:56:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:56:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-10-15 12:56:29,743 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 339 [2018-10-15 12:56:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:29,743 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-10-15 12:56:29,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:56:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-10-15 12:56:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 12:56:29,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:29,746 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:56:29,746 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:29,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1074434604, now seen corresponding path program 32 times [2018-10-15 12:56:29,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 0 proven. 4992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:31,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:31,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:56:31,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:56:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:56:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:31,297 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 67 states. [2018-10-15 12:56:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:34,079 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-10-15 12:56:34,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:56:34,079 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 349 [2018-10-15 12:56:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:34,081 INFO L225 Difference]: With dead ends: 368 [2018-10-15 12:56:34,081 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 12:56:34,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:56:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 12:56:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 360. [2018-10-15 12:56:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-15 12:56:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2018-10-15 12:56:34,087 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 349 [2018-10-15 12:56:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:34,087 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2018-10-15 12:56:34,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:56:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2018-10-15 12:56:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 12:56:34,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:34,090 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:56:34,090 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:34,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash 573398378, now seen corresponding path program 33 times [2018-10-15 12:56:34,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:35,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:35,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:56:35,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:56:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:56:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:35,921 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand 69 states. [2018-10-15 12:56:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:38,844 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-10-15 12:56:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:56:38,845 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 359 [2018-10-15 12:56:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:38,846 INFO L225 Difference]: With dead ends: 378 [2018-10-15 12:56:38,846 INFO L226 Difference]: Without dead ends: 378 [2018-10-15 12:56:38,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:56:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-10-15 12:56:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2018-10-15 12:56:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-15 12:56:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2018-10-15 12:56:38,852 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 359 [2018-10-15 12:56:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:38,852 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 370 transitions. [2018-10-15 12:56:38,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:56:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 370 transitions. [2018-10-15 12:56:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-15 12:56:38,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:38,854 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:56:38,855 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:38,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash 747063680, now seen corresponding path program 34 times [2018-10-15 12:56:38,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5644 backedges. 0 proven. 5644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:40,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:40,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:56:40,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:56:40,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:56:40,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:40,661 INFO L87 Difference]: Start difference. First operand 370 states and 370 transitions. Second operand 71 states. [2018-10-15 12:56:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:43,311 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-10-15 12:56:43,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:56:43,311 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 369 [2018-10-15 12:56:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:43,312 INFO L225 Difference]: With dead ends: 388 [2018-10-15 12:56:43,312 INFO L226 Difference]: Without dead ends: 388 [2018-10-15 12:56:43,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:56:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-15 12:56:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2018-10-15 12:56:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 12:56:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-10-15 12:56:43,319 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 369 [2018-10-15 12:56:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:43,319 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-10-15 12:56:43,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:56:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-10-15 12:56:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 12:56:43,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:43,322 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:56:43,322 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:43,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:43,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2081526294, now seen corresponding path program 35 times [2018-10-15 12:56:43,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:45,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:45,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:56:45,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:56:45,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:56:45,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:45,178 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 73 states. [2018-10-15 12:56:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:48,236 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-10-15 12:56:48,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:56:48,236 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 379 [2018-10-15 12:56:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:48,239 INFO L225 Difference]: With dead ends: 398 [2018-10-15 12:56:48,239 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 12:56:48,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:56:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 12:56:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 390. [2018-10-15 12:56:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-15 12:56:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2018-10-15 12:56:48,244 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 379 [2018-10-15 12:56:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:48,245 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 390 transitions. [2018-10-15 12:56:48,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:56:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 390 transitions. [2018-10-15 12:56:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-15 12:56:48,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:48,247 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:56:48,248 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:48,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:48,248 INFO L82 PathProgramCache]: Analyzing trace with hash -144533716, now seen corresponding path program 36 times [2018-10-15 12:56:48,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6336 backedges. 0 proven. 6336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:50,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:50,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:56:50,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:56:50,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:56:50,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:56:50,334 INFO L87 Difference]: Start difference. First operand 390 states and 390 transitions. Second operand 75 states. [2018-10-15 12:56:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:53,416 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2018-10-15 12:56:53,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:56:53,416 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 389 [2018-10-15 12:56:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:53,419 INFO L225 Difference]: With dead ends: 408 [2018-10-15 12:56:53,419 INFO L226 Difference]: Without dead ends: 408 [2018-10-15 12:56:53,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:56:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-15 12:56:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2018-10-15 12:56:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-15 12:56:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 400 transitions. [2018-10-15 12:56:53,425 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 400 transitions. Word has length 389 [2018-10-15 12:56:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:53,425 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 400 transitions. [2018-10-15 12:56:53,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:56:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 400 transitions. [2018-10-15 12:56:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-15 12:56:53,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:53,428 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:56:53,428 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:53,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:53,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2070366014, now seen corresponding path program 37 times [2018-10-15 12:56:53,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6697 backedges. 0 proven. 6697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:55,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:55,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:56:55,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:56:55,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:56:55,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:56:55,514 INFO L87 Difference]: Start difference. First operand 400 states and 400 transitions. Second operand 77 states. [2018-10-15 12:56:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:58,862 INFO L93 Difference]: Finished difference Result 418 states and 418 transitions. [2018-10-15 12:56:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:56:58,862 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 399 [2018-10-15 12:56:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:58,864 INFO L225 Difference]: With dead ends: 418 [2018-10-15 12:56:58,864 INFO L226 Difference]: Without dead ends: 418 [2018-10-15 12:56:58,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:56:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-15 12:56:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 410. [2018-10-15 12:56:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:56:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 410 transitions. [2018-10-15 12:56:58,869 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 410 transitions. Word has length 399 [2018-10-15 12:56:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:58,870 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 410 transitions. [2018-10-15 12:56:58,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:56:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 410 transitions. [2018-10-15 12:56:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 12:56:58,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:58,872 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:56:58,873 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:58,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1062885080, now seen corresponding path program 38 times [2018-10-15 12:56:58,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7068 backedges. 0 proven. 7068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:00,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:00,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:57:00,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:57:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:57:00,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:57:00,963 INFO L87 Difference]: Start difference. First operand 410 states and 410 transitions. Second operand 79 states. [2018-10-15 12:57:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:04,741 INFO L93 Difference]: Finished difference Result 428 states and 428 transitions. [2018-10-15 12:57:04,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:57:04,742 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 409 [2018-10-15 12:57:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:04,743 INFO L225 Difference]: With dead ends: 428 [2018-10-15 12:57:04,743 INFO L226 Difference]: Without dead ends: 428 [2018-10-15 12:57:04,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:57:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-15 12:57:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 420. [2018-10-15 12:57:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-15 12:57:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 420 transitions. [2018-10-15 12:57:04,749 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 420 transitions. Word has length 409 [2018-10-15 12:57:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:04,750 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 420 transitions. [2018-10-15 12:57:04,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:57:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 420 transitions. [2018-10-15 12:57:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 12:57:04,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:04,752 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:57:04,752 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:04,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash 785764718, now seen corresponding path program 39 times [2018-10-15 12:57:04,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7449 backedges. 0 proven. 7449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:06,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:06,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:57:06,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:57:06,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:57:06,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:06,900 INFO L87 Difference]: Start difference. First operand 420 states and 420 transitions. Second operand 81 states. [2018-10-15 12:57:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:10,620 INFO L93 Difference]: Finished difference Result 438 states and 438 transitions. [2018-10-15 12:57:10,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:57:10,621 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 419 [2018-10-15 12:57:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:10,623 INFO L225 Difference]: With dead ends: 438 [2018-10-15 12:57:10,623 INFO L226 Difference]: Without dead ends: 438 [2018-10-15 12:57:10,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:57:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-10-15 12:57:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 430. [2018-10-15 12:57:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-15 12:57:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 430 transitions. [2018-10-15 12:57:10,629 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 430 transitions. Word has length 419 [2018-10-15 12:57:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:10,629 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 430 transitions. [2018-10-15 12:57:10,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:57:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 430 transitions. [2018-10-15 12:57:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 12:57:10,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:10,632 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:57:10,632 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:10,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2076280964, now seen corresponding path program 40 times [2018-10-15 12:57:10,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7840 backedges. 0 proven. 7840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:12,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:12,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:57:12,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:57:12,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:57:12,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:12,935 INFO L87 Difference]: Start difference. First operand 430 states and 430 transitions. Second operand 83 states. [2018-10-15 12:57:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:16,766 INFO L93 Difference]: Finished difference Result 448 states and 448 transitions. [2018-10-15 12:57:16,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:57:16,772 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 429 [2018-10-15 12:57:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:16,774 INFO L225 Difference]: With dead ends: 448 [2018-10-15 12:57:16,774 INFO L226 Difference]: Without dead ends: 448 [2018-10-15 12:57:16,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:57:16,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-15 12:57:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 440. [2018-10-15 12:57:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-10-15 12:57:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 440 transitions. [2018-10-15 12:57:16,781 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 440 transitions. Word has length 429 [2018-10-15 12:57:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:16,781 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 440 transitions. [2018-10-15 12:57:16,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:57:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 440 transitions. [2018-10-15 12:57:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 12:57:16,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:16,784 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:57:16,784 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:16,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 643554330, now seen corresponding path program 41 times [2018-10-15 12:57:16,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8241 backedges. 0 proven. 8241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:19,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:19,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:57:19,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:57:19,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:57:19,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:19,301 INFO L87 Difference]: Start difference. First operand 440 states and 440 transitions. Second operand 85 states. [2018-10-15 12:57:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:23,274 INFO L93 Difference]: Finished difference Result 458 states and 458 transitions. [2018-10-15 12:57:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:57:23,275 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 439 [2018-10-15 12:57:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:23,277 INFO L225 Difference]: With dead ends: 458 [2018-10-15 12:57:23,277 INFO L226 Difference]: Without dead ends: 458 [2018-10-15 12:57:23,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:57:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-15 12:57:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 450. [2018-10-15 12:57:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-15 12:57:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 450 transitions. [2018-10-15 12:57:23,282 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 450 transitions. Word has length 439 [2018-10-15 12:57:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:23,282 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 450 transitions. [2018-10-15 12:57:23,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:57:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 450 transitions. [2018-10-15 12:57:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-10-15 12:57:23,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:23,286 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:57:23,286 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:23,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1013656624, now seen corresponding path program 42 times [2018-10-15 12:57:23,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8652 backedges. 0 proven. 8652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:26,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:26,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:57:26,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:57:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:57:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:26,097 INFO L87 Difference]: Start difference. First operand 450 states and 450 transitions. Second operand 87 states. [2018-10-15 12:57:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:30,571 INFO L93 Difference]: Finished difference Result 468 states and 468 transitions. [2018-10-15 12:57:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:57:30,572 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 449 [2018-10-15 12:57:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:30,574 INFO L225 Difference]: With dead ends: 468 [2018-10-15 12:57:30,574 INFO L226 Difference]: Without dead ends: 468 [2018-10-15 12:57:30,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:57:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-15 12:57:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 460. [2018-10-15 12:57:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-15 12:57:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 460 transitions. [2018-10-15 12:57:30,581 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 460 transitions. Word has length 449 [2018-10-15 12:57:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:30,582 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 460 transitions. [2018-10-15 12:57:30,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:57:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 460 transitions. [2018-10-15 12:57:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-15 12:57:30,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:30,585 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:57:30,585 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:30,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1891772218, now seen corresponding path program 43 times [2018-10-15 12:57:30,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9073 backedges. 0 proven. 9073 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:33,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:33,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:57:33,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:57:33,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:57:33,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:33,280 INFO L87 Difference]: Start difference. First operand 460 states and 460 transitions. Second operand 89 states. [2018-10-15 12:57:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:37,646 INFO L93 Difference]: Finished difference Result 478 states and 478 transitions. [2018-10-15 12:57:37,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:57:37,647 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 459 [2018-10-15 12:57:37,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:37,648 INFO L225 Difference]: With dead ends: 478 [2018-10-15 12:57:37,649 INFO L226 Difference]: Without dead ends: 478 [2018-10-15 12:57:37,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:57:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-10-15 12:57:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2018-10-15 12:57:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-15 12:57:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 470 transitions. [2018-10-15 12:57:37,655 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 470 transitions. Word has length 459 [2018-10-15 12:57:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:37,656 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 470 transitions. [2018-10-15 12:57:37,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:57:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 470 transitions. [2018-10-15 12:57:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-15 12:57:37,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:37,659 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:57:37,659 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:37,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash -374717988, now seen corresponding path program 44 times [2018-10-15 12:57:37,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 0 proven. 9504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:40,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:40,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:57:40,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:57:40,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:57:40,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:40,511 INFO L87 Difference]: Start difference. First operand 470 states and 470 transitions. Second operand 91 states. [2018-10-15 12:57:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:45,066 INFO L93 Difference]: Finished difference Result 488 states and 488 transitions. [2018-10-15 12:57:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:57:45,067 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 469 [2018-10-15 12:57:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:45,069 INFO L225 Difference]: With dead ends: 488 [2018-10-15 12:57:45,069 INFO L226 Difference]: Without dead ends: 488 [2018-10-15 12:57:45,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:57:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-15 12:57:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 480. [2018-10-15 12:57:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-15 12:57:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 480 transitions. [2018-10-15 12:57:45,074 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 480 transitions. Word has length 469 [2018-10-15 12:57:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:45,075 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 480 transitions. [2018-10-15 12:57:45,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:57:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 480 transitions. [2018-10-15 12:57:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 12:57:45,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:45,076 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:57:45,077 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:45,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash -972109966, now seen corresponding path program 45 times [2018-10-15 12:57:45,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9945 backedges. 0 proven. 9945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:47,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:47,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:57:47,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:57:47,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:57:47,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:47,933 INFO L87 Difference]: Start difference. First operand 480 states and 480 transitions. Second operand 93 states. [2018-10-15 12:57:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:52,759 INFO L93 Difference]: Finished difference Result 498 states and 498 transitions. [2018-10-15 12:57:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:57:52,760 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 479 [2018-10-15 12:57:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:52,762 INFO L225 Difference]: With dead ends: 498 [2018-10-15 12:57:52,762 INFO L226 Difference]: Without dead ends: 498 [2018-10-15 12:57:52,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:57:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-10-15 12:57:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 490. [2018-10-15 12:57:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-10-15 12:57:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 490 transitions. [2018-10-15 12:57:52,766 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 490 transitions. Word has length 479 [2018-10-15 12:57:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:52,767 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 490 transitions. [2018-10-15 12:57:52,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:57:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 490 transitions. [2018-10-15 12:57:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-10-15 12:57:52,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:52,770 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:57:52,770 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:52,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2075014776, now seen corresponding path program 46 times [2018-10-15 12:57:52,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10396 backedges. 0 proven. 10396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:55,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:55,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:57:55,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:57:55,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:57:55,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:57:55,803 INFO L87 Difference]: Start difference. First operand 490 states and 490 transitions. Second operand 95 states. [2018-10-15 12:58:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:00,586 INFO L93 Difference]: Finished difference Result 508 states and 508 transitions. [2018-10-15 12:58:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:58:00,587 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 489 [2018-10-15 12:58:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:00,589 INFO L225 Difference]: With dead ends: 508 [2018-10-15 12:58:00,589 INFO L226 Difference]: Without dead ends: 508 [2018-10-15 12:58:00,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:58:00,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-10-15 12:58:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 500. [2018-10-15 12:58:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-15 12:58:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 500 transitions. [2018-10-15 12:58:00,594 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 500 transitions. Word has length 489 [2018-10-15 12:58:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:00,595 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 500 transitions. [2018-10-15 12:58:00,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:58:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 500 transitions. [2018-10-15 12:58:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 12:58:00,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:00,597 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 12:58:00,597 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:00,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:00,597 INFO L82 PathProgramCache]: Analyzing trace with hash 534882334, now seen corresponding path program 47 times [2018-10-15 12:58:00,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:03,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:03,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:58:03,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:58:03,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:58:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:58:03,858 INFO L87 Difference]: Start difference. First operand 500 states and 500 transitions. Second operand 97 states. [2018-10-15 12:58:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:09,371 INFO L93 Difference]: Finished difference Result 518 states and 518 transitions. [2018-10-15 12:58:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:58:09,371 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 499 [2018-10-15 12:58:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:09,373 INFO L225 Difference]: With dead ends: 518 [2018-10-15 12:58:09,373 INFO L226 Difference]: Without dead ends: 518 [2018-10-15 12:58:09,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:58:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-10-15 12:58:09,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 510. [2018-10-15 12:58:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-10-15 12:58:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 510 transitions. [2018-10-15 12:58:09,380 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 510 transitions. Word has length 499 [2018-10-15 12:58:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:09,380 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 510 transitions. [2018-10-15 12:58:09,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:58:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 510 transitions. [2018-10-15 12:58:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-15 12:58:09,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:09,383 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:09,383 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:09,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:09,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1706345268, now seen corresponding path program 48 times [2018-10-15 12:58:09,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11328 backedges. 0 proven. 11328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:12,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:12,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:58:12,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:58:12,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:58:12,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:12,801 INFO L87 Difference]: Start difference. First operand 510 states and 510 transitions. Second operand 99 states. [2018-10-15 12:58:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:18,050 INFO L93 Difference]: Finished difference Result 528 states and 528 transitions. [2018-10-15 12:58:18,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:58:18,051 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 509 [2018-10-15 12:58:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:18,052 INFO L225 Difference]: With dead ends: 528 [2018-10-15 12:58:18,053 INFO L226 Difference]: Without dead ends: 528 [2018-10-15 12:58:18,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:58:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-15 12:58:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 520. [2018-10-15 12:58:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-15 12:58:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 520 transitions. [2018-10-15 12:58:18,059 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 520 transitions. Word has length 509 [2018-10-15 12:58:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:18,060 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 520 transitions. [2018-10-15 12:58:18,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:58:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 520 transitions. [2018-10-15 12:58:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 12:58:18,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:18,063 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:18,063 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:18,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1438025014, now seen corresponding path program 49 times [2018-10-15 12:58:18,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11809 backedges. 0 proven. 11809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:21,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:21,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:58:21,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:58:21,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:58:21,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:21,447 INFO L87 Difference]: Start difference. First operand 520 states and 520 transitions. Second operand 101 states. [2018-10-15 12:58:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:27,086 INFO L93 Difference]: Finished difference Result 538 states and 538 transitions. [2018-10-15 12:58:27,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:58:27,086 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 519 [2018-10-15 12:58:27,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:27,088 INFO L225 Difference]: With dead ends: 538 [2018-10-15 12:58:27,088 INFO L226 Difference]: Without dead ends: 538 [2018-10-15 12:58:27,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:58:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-15 12:58:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2018-10-15 12:58:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-15 12:58:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 530 transitions. [2018-10-15 12:58:27,096 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 530 transitions. Word has length 519 [2018-10-15 12:58:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:27,096 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 530 transitions. [2018-10-15 12:58:27,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:58:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 530 transitions. [2018-10-15 12:58:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-10-15 12:58:27,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:27,099 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:27,099 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:27,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:27,100 INFO L82 PathProgramCache]: Analyzing trace with hash -5886240, now seen corresponding path program 50 times [2018-10-15 12:58:27,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12300 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:30,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:30,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:58:30,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:58:30,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:58:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:30,359 INFO L87 Difference]: Start difference. First operand 530 states and 530 transitions. Second operand 103 states. [2018-10-15 12:58:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:36,437 INFO L93 Difference]: Finished difference Result 548 states and 548 transitions. [2018-10-15 12:58:36,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:58:36,438 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 529 [2018-10-15 12:58:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:36,440 INFO L225 Difference]: With dead ends: 548 [2018-10-15 12:58:36,441 INFO L226 Difference]: Without dead ends: 548 [2018-10-15 12:58:36,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:58:36,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-10-15 12:58:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 540. [2018-10-15 12:58:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-10-15 12:58:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 540 transitions. [2018-10-15 12:58:36,447 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 540 transitions. Word has length 529 [2018-10-15 12:58:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:36,448 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 540 transitions. [2018-10-15 12:58:36,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:58:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 540 transitions. [2018-10-15 12:58:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-10-15 12:58:36,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:36,451 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:36,452 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:36,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash -346472586, now seen corresponding path program 51 times [2018-10-15 12:58:36,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12801 backedges. 0 proven. 12801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:39,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:39,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:58:39,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:58:39,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:58:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:39,931 INFO L87 Difference]: Start difference. First operand 540 states and 540 transitions. Second operand 105 states. [2018-10-15 12:58:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:45,902 INFO L93 Difference]: Finished difference Result 558 states and 558 transitions. [2018-10-15 12:58:45,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:58:45,903 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 539 [2018-10-15 12:58:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:45,905 INFO L225 Difference]: With dead ends: 558 [2018-10-15 12:58:45,905 INFO L226 Difference]: Without dead ends: 558 [2018-10-15 12:58:45,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:58:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-10-15 12:58:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 550. [2018-10-15 12:58:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-10-15 12:58:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 550 transitions. [2018-10-15 12:58:45,911 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 550 transitions. Word has length 539 [2018-10-15 12:58:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:45,911 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 550 transitions. [2018-10-15 12:58:45,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:58:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 550 transitions. [2018-10-15 12:58:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-10-15 12:58:45,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:45,914 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:45,914 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:45,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:45,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1669788532, now seen corresponding path program 52 times [2018-10-15 12:58:45,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 13312 backedges. 0 proven. 13312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:49,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:49,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:58:49,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:58:49,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:58:49,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:49,645 INFO L87 Difference]: Start difference. First operand 550 states and 550 transitions. Second operand 107 states. [2018-10-15 12:58:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:55,874 INFO L93 Difference]: Finished difference Result 568 states and 568 transitions. [2018-10-15 12:58:55,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:58:55,874 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 549 [2018-10-15 12:58:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:55,876 INFO L225 Difference]: With dead ends: 568 [2018-10-15 12:58:55,876 INFO L226 Difference]: Without dead ends: 568 [2018-10-15 12:58:55,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:58:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-15 12:58:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 560. [2018-10-15 12:58:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-15 12:58:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 560 transitions. [2018-10-15 12:58:55,883 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 560 transitions. Word has length 549 [2018-10-15 12:58:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:55,884 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 560 transitions. [2018-10-15 12:58:55,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:58:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 560 transitions. [2018-10-15 12:58:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 12:58:55,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:55,887 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:55,888 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:55,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1583090142, now seen corresponding path program 53 times [2018-10-15 12:58:55,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 13833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:59,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:59,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:58:59,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:58:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:58:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:58:59,975 INFO L87 Difference]: Start difference. First operand 560 states and 560 transitions. Second operand 109 states. [2018-10-15 12:59:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:06,403 INFO L93 Difference]: Finished difference Result 578 states and 578 transitions. [2018-10-15 12:59:06,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:59:06,404 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 559 [2018-10-15 12:59:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:06,406 INFO L225 Difference]: With dead ends: 578 [2018-10-15 12:59:06,406 INFO L226 Difference]: Without dead ends: 578 [2018-10-15 12:59:06,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:59:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-10-15 12:59:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 570. [2018-10-15 12:59:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-15 12:59:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 570 transitions. [2018-10-15 12:59:06,412 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 570 transitions. Word has length 559 [2018-10-15 12:59:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:06,413 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 570 transitions. [2018-10-15 12:59:06,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:59:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 570 transitions. [2018-10-15 12:59:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-10-15 12:59:06,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:06,416 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:06,416 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:06,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:06,416 INFO L82 PathProgramCache]: Analyzing trace with hash 520117304, now seen corresponding path program 54 times [2018-10-15 12:59:06,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 14364 backedges. 0 proven. 14364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:10,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:10,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:59:10,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:59:10,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:59:10,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:10,484 INFO L87 Difference]: Start difference. First operand 570 states and 570 transitions. Second operand 111 states. [2018-10-15 12:59:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:17,206 INFO L93 Difference]: Finished difference Result 588 states and 588 transitions. [2018-10-15 12:59:17,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:59:17,207 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 569 [2018-10-15 12:59:17,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:17,209 INFO L225 Difference]: With dead ends: 588 [2018-10-15 12:59:17,209 INFO L226 Difference]: Without dead ends: 588 [2018-10-15 12:59:17,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:59:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-10-15 12:59:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 580. [2018-10-15 12:59:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-10-15 12:59:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 580 transitions. [2018-10-15 12:59:17,215 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 580 transitions. Word has length 569 [2018-10-15 12:59:17,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:17,215 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 580 transitions. [2018-10-15 12:59:17,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:59:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 580 transitions. [2018-10-15 12:59:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-15 12:59:17,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:17,218 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:17,218 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:17,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:17,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2076401970, now seen corresponding path program 55 times [2018-10-15 12:59:17,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14905 backedges. 0 proven. 14905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:21,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:21,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:59:21,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:59:21,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:59:21,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:21,160 INFO L87 Difference]: Start difference. First operand 580 states and 580 transitions. Second operand 113 states. [2018-10-15 12:59:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:28,342 INFO L93 Difference]: Finished difference Result 598 states and 598 transitions. [2018-10-15 12:59:28,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:59:28,342 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 579 [2018-10-15 12:59:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:28,344 INFO L225 Difference]: With dead ends: 598 [2018-10-15 12:59:28,344 INFO L226 Difference]: Without dead ends: 598 [2018-10-15 12:59:28,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:59:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-10-15 12:59:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 590. [2018-10-15 12:59:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-15 12:59:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 590 transitions. [2018-10-15 12:59:28,350 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 590 transitions. Word has length 579 [2018-10-15 12:59:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:28,350 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 590 transitions. [2018-10-15 12:59:28,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:59:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 590 transitions. [2018-10-15 12:59:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-10-15 12:59:28,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:28,353 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:28,353 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:28,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:28,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1030808092, now seen corresponding path program 56 times [2018-10-15 12:59:28,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 15456 backedges. 0 proven. 15456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:32,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:32,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:59:32,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:59:32,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:59:32,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:32,440 INFO L87 Difference]: Start difference. First operand 590 states and 590 transitions. Second operand 115 states. [2018-10-15 12:59:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:39,804 INFO L93 Difference]: Finished difference Result 608 states and 608 transitions. [2018-10-15 12:59:39,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:59:39,804 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 589 [2018-10-15 12:59:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:39,806 INFO L225 Difference]: With dead ends: 608 [2018-10-15 12:59:39,806 INFO L226 Difference]: Without dead ends: 608 [2018-10-15 12:59:39,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:59:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-15 12:59:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2018-10-15 12:59:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-15 12:59:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 600 transitions. [2018-10-15 12:59:39,813 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 600 transitions. Word has length 589 [2018-10-15 12:59:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:39,813 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 600 transitions. [2018-10-15 12:59:39,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:59:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 600 transitions. [2018-10-15 12:59:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 12:59:39,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:39,816 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:39,816 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:39,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:39,817 INFO L82 PathProgramCache]: Analyzing trace with hash 45496698, now seen corresponding path program 57 times [2018-10-15 12:59:39,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 16017 backedges. 0 proven. 16017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:44,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:44,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:59:44,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:59:44,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:59:44,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:44,159 INFO L87 Difference]: Start difference. First operand 600 states and 600 transitions. Second operand 117 states. [2018-10-15 12:59:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:51,654 INFO L93 Difference]: Finished difference Result 618 states and 618 transitions. [2018-10-15 12:59:51,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:59:51,654 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 599 [2018-10-15 12:59:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:51,657 INFO L225 Difference]: With dead ends: 618 [2018-10-15 12:59:51,657 INFO L226 Difference]: Without dead ends: 618 [2018-10-15 12:59:51,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:59:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-15 12:59:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2018-10-15 12:59:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-15 12:59:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 610 transitions. [2018-10-15 12:59:51,664 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 610 transitions. Word has length 599 [2018-10-15 12:59:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:51,664 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 610 transitions. [2018-10-15 12:59:51,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:59:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 610 transitions. [2018-10-15 12:59:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-15 12:59:51,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:51,667 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:51,667 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:51,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:51,667 INFO L82 PathProgramCache]: Analyzing trace with hash -621260400, now seen corresponding path program 58 times [2018-10-15 12:59:51,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16588 backedges. 0 proven. 16588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:56,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:56,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:59:56,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:59:56,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:59:56,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:59:56,490 INFO L87 Difference]: Start difference. First operand 610 states and 610 transitions. Second operand 119 states. [2018-10-15 13:00:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:04,071 INFO L93 Difference]: Finished difference Result 628 states and 628 transitions. [2018-10-15 13:00:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 13:00:04,071 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 609 [2018-10-15 13:00:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:04,075 INFO L225 Difference]: With dead ends: 628 [2018-10-15 13:00:04,075 INFO L226 Difference]: Without dead ends: 628 [2018-10-15 13:00:04,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 13:00:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-15 13:00:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 620. [2018-10-15 13:00:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-10-15 13:00:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 620 transitions. [2018-10-15 13:00:04,081 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 620 transitions. Word has length 609 [2018-10-15 13:00:04,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:04,081 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 620 transitions. [2018-10-15 13:00:04,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 13:00:04,081 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 620 transitions. [2018-10-15 13:00:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-15 13:00:04,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:04,084 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:04,085 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:04,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash 86230566, now seen corresponding path program 59 times [2018-10-15 13:00:04,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 17169 backedges. 0 proven. 17169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:08,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:08,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 13:00:08,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 13:00:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 13:00:08,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:00:08,724 INFO L87 Difference]: Start difference. First operand 620 states and 620 transitions. Second operand 121 states. [2018-10-15 13:00:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:16,576 INFO L93 Difference]: Finished difference Result 638 states and 638 transitions. [2018-10-15 13:00:16,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 13:00:16,577 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 619 [2018-10-15 13:00:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:16,579 INFO L225 Difference]: With dead ends: 638 [2018-10-15 13:00:16,579 INFO L226 Difference]: Without dead ends: 638 [2018-10-15 13:00:16,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:00:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-10-15 13:00:16,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2018-10-15 13:00:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-10-15 13:00:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 630 transitions. [2018-10-15 13:00:16,584 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 630 transitions. Word has length 619 [2018-10-15 13:00:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:16,585 INFO L481 AbstractCegarLoop]: Abstraction has 630 states and 630 transitions. [2018-10-15 13:00:16,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:00:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 630 transitions. [2018-10-15 13:00:16,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2018-10-15 13:00:16,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:16,588 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:16,588 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:16,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:16,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1802569924, now seen corresponding path program 60 times [2018-10-15 13:00:16,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 17760 backedges. 0 proven. 17760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:21,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:21,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:00:21,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:00:21,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:00:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:21,662 INFO L87 Difference]: Start difference. First operand 630 states and 630 transitions. Second operand 123 states. [2018-10-15 13:00:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:29,881 INFO L93 Difference]: Finished difference Result 648 states and 648 transitions. [2018-10-15 13:00:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 13:00:29,881 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 629 [2018-10-15 13:00:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:29,884 INFO L225 Difference]: With dead ends: 648 [2018-10-15 13:00:29,884 INFO L226 Difference]: Without dead ends: 648 [2018-10-15 13:00:29,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:00:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-15 13:00:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 640. [2018-10-15 13:00:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-15 13:00:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 640 transitions. [2018-10-15 13:00:29,890 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 640 transitions. Word has length 629 [2018-10-15 13:00:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:29,891 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 640 transitions. [2018-10-15 13:00:29,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:00:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 640 transitions. [2018-10-15 13:00:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-15 13:00:29,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:29,894 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:29,894 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:29,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:29,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1407695662, now seen corresponding path program 61 times [2018-10-15 13:00:29,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18361 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:34,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:34,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:00:34,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:00:34,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:00:34,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:34,869 INFO L87 Difference]: Start difference. First operand 640 states and 640 transitions. Second operand 125 states. [2018-10-15 13:00:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:43,071 INFO L93 Difference]: Finished difference Result 658 states and 658 transitions. [2018-10-15 13:00:43,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 13:00:43,071 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 639 [2018-10-15 13:00:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:43,073 INFO L225 Difference]: With dead ends: 658 [2018-10-15 13:00:43,073 INFO L226 Difference]: Without dead ends: 658 [2018-10-15 13:00:43,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 13:00:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-10-15 13:00:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 650. [2018-10-15 13:00:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-10-15 13:00:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 650 transitions. [2018-10-15 13:00:43,080 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 650 transitions. Word has length 639 [2018-10-15 13:00:43,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:43,080 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 650 transitions. [2018-10-15 13:00:43,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:00:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 650 transitions. [2018-10-15 13:00:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-15 13:00:43,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:43,084 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:43,084 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:43,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1272574232, now seen corresponding path program 62 times [2018-10-15 13:00:43,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18972 backedges. 0 proven. 18972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:48,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:48,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:00:48,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:00:48,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:00:48,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:48,242 INFO L87 Difference]: Start difference. First operand 650 states and 650 transitions. Second operand 127 states. [2018-10-15 13:00:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:56,934 INFO L93 Difference]: Finished difference Result 668 states and 668 transitions. [2018-10-15 13:00:56,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 13:00:56,935 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 649 [2018-10-15 13:00:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:56,937 INFO L225 Difference]: With dead ends: 668 [2018-10-15 13:00:56,937 INFO L226 Difference]: Without dead ends: 668 [2018-10-15 13:00:56,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:00:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-15 13:00:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 660. [2018-10-15 13:00:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-10-15 13:00:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 660 transitions. [2018-10-15 13:00:56,944 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 660 transitions. Word has length 649 [2018-10-15 13:00:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:56,945 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 660 transitions. [2018-10-15 13:00:56,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:00:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 660 transitions. [2018-10-15 13:00:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-10-15 13:00:56,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:56,948 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:56,948 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:56,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:56,948 INFO L82 PathProgramCache]: Analyzing trace with hash 279360894, now seen corresponding path program 63 times [2018-10-15 13:00:56,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 19593 backedges. 0 proven. 19593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:02,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:02,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:01:02,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:01:02,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:01:02,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:01:02,494 INFO L87 Difference]: Start difference. First operand 660 states and 660 transitions. Second operand 129 states. [2018-10-15 13:01:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:11,510 INFO L93 Difference]: Finished difference Result 678 states and 678 transitions. [2018-10-15 13:01:11,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:01:11,510 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 659 [2018-10-15 13:01:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:11,512 INFO L225 Difference]: With dead ends: 678 [2018-10-15 13:01:11,513 INFO L226 Difference]: Without dead ends: 678 [2018-10-15 13:01:11,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 13:01:11,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-10-15 13:01:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 670. [2018-10-15 13:01:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-10-15 13:01:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 670 transitions. [2018-10-15 13:01:11,519 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 670 transitions. Word has length 659 [2018-10-15 13:01:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:11,520 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 670 transitions. [2018-10-15 13:01:11,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:01:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 670 transitions. [2018-10-15 13:01:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-10-15 13:01:11,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:11,524 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:11,524 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:11,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1460705428, now seen corresponding path program 64 times [2018-10-15 13:01:11,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 20224 backedges. 0 proven. 20224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:17,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:17,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:01:17,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:01:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:01:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:01:17,311 INFO L87 Difference]: Start difference. First operand 670 states and 670 transitions. Second operand 131 states. [2018-10-15 13:01:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:26,290 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2018-10-15 13:01:26,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 13:01:26,290 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 669 [2018-10-15 13:01:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:26,292 INFO L225 Difference]: With dead ends: 688 [2018-10-15 13:01:26,293 INFO L226 Difference]: Without dead ends: 688 [2018-10-15 13:01:26,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:01:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-15 13:01:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2018-10-15 13:01:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-15 13:01:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 680 transitions. [2018-10-15 13:01:26,298 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 680 transitions. Word has length 669 [2018-10-15 13:01:26,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:26,299 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 680 transitions. [2018-10-15 13:01:26,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:01:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 680 transitions. [2018-10-15 13:01:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-10-15 13:01:26,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:26,302 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:26,303 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:26,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:26,303 INFO L82 PathProgramCache]: Analyzing trace with hash 73537578, now seen corresponding path program 65 times [2018-10-15 13:01:26,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 20865 backedges. 0 proven. 20865 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:32,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:32,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:01:32,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:01:32,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:01:32,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:32,533 INFO L87 Difference]: Start difference. First operand 680 states and 680 transitions. Second operand 133 states. [2018-10-15 13:01:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:41,961 INFO L93 Difference]: Finished difference Result 698 states and 698 transitions. [2018-10-15 13:01:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 13:01:41,961 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 679 [2018-10-15 13:01:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:41,965 INFO L225 Difference]: With dead ends: 698 [2018-10-15 13:01:41,965 INFO L226 Difference]: Without dead ends: 698 [2018-10-15 13:01:41,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:01:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-10-15 13:01:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 690. [2018-10-15 13:01:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-15 13:01:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 690 transitions. [2018-10-15 13:01:41,973 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 690 transitions. Word has length 679 [2018-10-15 13:01:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:41,973 INFO L481 AbstractCegarLoop]: Abstraction has 690 states and 690 transitions. [2018-10-15 13:01:41,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:01:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 690 transitions. [2018-10-15 13:01:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-10-15 13:01:41,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:41,977 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:41,977 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:41,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1289644992, now seen corresponding path program 66 times [2018-10-15 13:01:41,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 21516 backedges. 0 proven. 21516 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:47,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:47,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:01:47,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:01:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:01:47,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:47,683 INFO L87 Difference]: Start difference. First operand 690 states and 690 transitions. Second operand 135 states. [2018-10-15 13:01:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:57,294 INFO L93 Difference]: Finished difference Result 708 states and 708 transitions. [2018-10-15 13:01:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 13:01:57,294 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 689 [2018-10-15 13:01:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:57,296 INFO L225 Difference]: With dead ends: 708 [2018-10-15 13:01:57,296 INFO L226 Difference]: Without dead ends: 708 [2018-10-15 13:01:57,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 13:01:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-10-15 13:01:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 700. [2018-10-15 13:01:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-15 13:01:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 700 transitions. [2018-10-15 13:01:57,303 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 700 transitions. Word has length 689 [2018-10-15 13:01:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:57,303 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 700 transitions. [2018-10-15 13:01:57,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:01:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 700 transitions. [2018-10-15 13:01:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-15 13:01:57,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:57,307 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:57,307 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:57,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:57,308 INFO L82 PathProgramCache]: Analyzing trace with hash -782406442, now seen corresponding path program 67 times [2018-10-15 13:01:57,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 22177 backedges. 0 proven. 22177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:03,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:03,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:02:03,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:02:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:02:03,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:02:03,172 INFO L87 Difference]: Start difference. First operand 700 states and 700 transitions. Second operand 137 states. [2018-10-15 13:02:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:13,033 INFO L93 Difference]: Finished difference Result 718 states and 718 transitions. [2018-10-15 13:02:13,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 13:02:13,034 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 699 [2018-10-15 13:02:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:13,036 INFO L225 Difference]: With dead ends: 718 [2018-10-15 13:02:13,036 INFO L226 Difference]: Without dead ends: 718 [2018-10-15 13:02:13,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:02:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-10-15 13:02:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 710. [2018-10-15 13:02:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-10-15 13:02:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 710 transitions. [2018-10-15 13:02:13,044 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 710 transitions. Word has length 699 [2018-10-15 13:02:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:13,044 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 710 transitions. [2018-10-15 13:02:13,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:02:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 710 transitions. [2018-10-15 13:02:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-10-15 13:02:13,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:13,048 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:13,048 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:13,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:13,048 INFO L82 PathProgramCache]: Analyzing trace with hash -693370388, now seen corresponding path program 68 times [2018-10-15 13:02:13,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22848 backedges. 0 proven. 22848 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:19,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:19,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:02:19,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:02:19,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:02:19,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:02:19,245 INFO L87 Difference]: Start difference. First operand 710 states and 710 transitions. Second operand 139 states. [2018-10-15 13:02:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:29,288 INFO L93 Difference]: Finished difference Result 728 states and 728 transitions. [2018-10-15 13:02:29,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 13:02:29,289 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 709 [2018-10-15 13:02:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:29,291 INFO L225 Difference]: With dead ends: 728 [2018-10-15 13:02:29,291 INFO L226 Difference]: Without dead ends: 728 [2018-10-15 13:02:29,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:02:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-10-15 13:02:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 720. [2018-10-15 13:02:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-15 13:02:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 720 transitions. [2018-10-15 13:02:29,297 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 720 transitions. Word has length 709 [2018-10-15 13:02:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:29,298 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 720 transitions. [2018-10-15 13:02:29,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:02:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 720 transitions. [2018-10-15 13:02:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-15 13:02:29,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:29,302 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:29,302 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:29,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:29,302 INFO L82 PathProgramCache]: Analyzing trace with hash -97799294, now seen corresponding path program 69 times [2018-10-15 13:02:29,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23529 backedges. 0 proven. 23529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:35,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:35,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:02:35,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:02:35,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:02:35,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:35,570 INFO L87 Difference]: Start difference. First operand 720 states and 720 transitions. Second operand 141 states. [2018-10-15 13:02:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:46,544 INFO L93 Difference]: Finished difference Result 738 states and 738 transitions. [2018-10-15 13:02:46,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 13:02:46,544 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 719 [2018-10-15 13:02:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:46,547 INFO L225 Difference]: With dead ends: 738 [2018-10-15 13:02:46,547 INFO L226 Difference]: Without dead ends: 738 [2018-10-15 13:02:46,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 13:02:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-10-15 13:02:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 730. [2018-10-15 13:02:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-10-15 13:02:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 730 transitions. [2018-10-15 13:02:46,554 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 730 transitions. Word has length 719 [2018-10-15 13:02:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:46,554 INFO L481 AbstractCegarLoop]: Abstraction has 730 states and 730 transitions. [2018-10-15 13:02:46,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:02:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 730 transitions. [2018-10-15 13:02:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-10-15 13:02:46,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:46,558 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:46,558 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:46,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1753407896, now seen corresponding path program 70 times [2018-10-15 13:02:46,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 24220 backedges. 0 proven. 24220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:53,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:53,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:02:53,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:02:53,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:02:53,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:53,203 INFO L87 Difference]: Start difference. First operand 730 states and 730 transitions. Second operand 143 states. [2018-10-15 13:03:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:04,049 INFO L93 Difference]: Finished difference Result 748 states and 748 transitions. [2018-10-15 13:03:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:03:04,049 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 729 [2018-10-15 13:03:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:04,052 INFO L225 Difference]: With dead ends: 748 [2018-10-15 13:03:04,052 INFO L226 Difference]: Without dead ends: 748 [2018-10-15 13:03:04,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 13:03:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-15 13:03:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 740. [2018-10-15 13:03:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-10-15 13:03:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 740 transitions. [2018-10-15 13:03:04,059 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 740 transitions. Word has length 729 [2018-10-15 13:03:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:04,059 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 740 transitions. [2018-10-15 13:03:04,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:03:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 740 transitions. [2018-10-15 13:03:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-15 13:03:04,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:04,064 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:04,064 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:04,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash -102765522, now seen corresponding path program 71 times [2018-10-15 13:03:04,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 24921 backedges. 0 proven. 24921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:10,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:10,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:03:10,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:03:10,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:03:10,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:03:10,599 INFO L87 Difference]: Start difference. First operand 740 states and 740 transitions. Second operand 145 states. [2018-10-15 13:03:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:21,679 INFO L93 Difference]: Finished difference Result 758 states and 758 transitions. [2018-10-15 13:03:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 13:03:21,679 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 739 [2018-10-15 13:03:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:21,682 INFO L225 Difference]: With dead ends: 758 [2018-10-15 13:03:21,682 INFO L226 Difference]: Without dead ends: 758 [2018-10-15 13:03:21,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 13:03:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-10-15 13:03:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 750. [2018-10-15 13:03:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-10-15 13:03:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 750 transitions. [2018-10-15 13:03:21,688 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 750 transitions. Word has length 739 [2018-10-15 13:03:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:21,689 INFO L481 AbstractCegarLoop]: Abstraction has 750 states and 750 transitions. [2018-10-15 13:03:21,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:03:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 750 transitions. [2018-10-15 13:03:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-15 13:03:21,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:21,693 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:21,693 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:21,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1744384836, now seen corresponding path program 72 times [2018-10-15 13:03:21,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 25632 backedges. 0 proven. 25632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:28,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:28,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:03:28,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:03:28,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:03:28,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:03:28,769 INFO L87 Difference]: Start difference. First operand 750 states and 750 transitions. Second operand 147 states. [2018-10-15 13:03:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:40,275 INFO L93 Difference]: Finished difference Result 768 states and 768 transitions. [2018-10-15 13:03:40,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 13:03:40,275 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 749 [2018-10-15 13:03:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:40,278 INFO L225 Difference]: With dead ends: 768 [2018-10-15 13:03:40,278 INFO L226 Difference]: Without dead ends: 768 [2018-10-15 13:03:40,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 13:03:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-10-15 13:03:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 760. [2018-10-15 13:03:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-10-15 13:03:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 760 transitions. [2018-10-15 13:03:40,284 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 760 transitions. Word has length 749 [2018-10-15 13:03:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:40,285 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 760 transitions. [2018-10-15 13:03:40,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 13:03:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 760 transitions. [2018-10-15 13:03:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-10-15 13:03:40,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:40,289 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:40,289 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:40,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash 67966682, now seen corresponding path program 73 times [2018-10-15 13:03:40,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat