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_false-unreach-call3_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:21,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:21,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:21,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:21,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:21,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:21,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:21,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:21,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:21,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:21,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:21,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:21,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:21,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:21,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:21,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:21,170 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:21,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:21,173 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:21,175 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:21,176 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:21,177 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:21,181 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:21,181 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:21,181 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:21,182 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:21,183 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:21,186 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:21,187 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:21,188 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:21,188 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:21,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:21,191 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:21,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:21,193 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:21,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:21,193 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,208 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:21,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:21,209 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:21,209 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:21,210 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:21,210 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:21,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:21,211 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:21,211 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:21,211 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:21,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:21,212 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:21,212 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:21,213 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:21,213 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:21,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:21,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:21,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:21,298 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:21,299 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:21,300 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_false-unreach-call3_true-termination.i_3.bpl [2018-10-15 12:55:21,300 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_false-unreach-call3_true-termination.i_3.bpl' [2018-10-15 12:55:21,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:21,368 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:21,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:21,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:21,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_false-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,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_false-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,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_false-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,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_false-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,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_false-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,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_false-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,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_false-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,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:21,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:21,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:21,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_false-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,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:21,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:21,941 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:21,942 INFO L202 PluginConnector]: Adding new model array_false-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:21 BoogieIcfgContainer [2018-10-15 12:55:21,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:21,942 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:21,942 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:21,943 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:21,947 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array_false-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,955 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-15 12:55:21,955 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-15 12:55:21,989 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-15 12:55:22,033 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-15 12:55:22,052 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-15 12:55:22,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-15 12:55:25,346 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,349 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-15 12:55:25,353 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-15 12:55:25,383 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,387 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,388 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,389 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-15 12:55:25,390 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 12:55:25,390 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:25,390 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,391 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,391 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:25,391 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,391 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,392 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 12:55:25,392 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:25,392 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,392 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,392 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:25,393 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,393 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,395 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-15 12:55:25,411 INFO L202 PluginConnector]: Adding new model array_false-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,411 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:25,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:25,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:25,417 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:25,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_false-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,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692b604b and model type array_false-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,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_false-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:21" (2/3) ... [2018-10-15 12:55:25,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692b604b and model type array_false-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,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_false-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,422 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-15 12:55:25,434 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:25,444 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:25,464 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:25,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:25,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:25,496 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:25,496 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:25,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:25,497 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:25,497 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:25,497 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:25,498 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-10-15 12:55:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 12:55:25,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:25,521 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,522 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:25,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1085521132, now seen corresponding path program 1 times [2018-10-15 12:55:25,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:25,768 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,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:25,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:25,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:25,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:25,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:25,793 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-10-15 12:55:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:26,011 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 12:55:26,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:26,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-15 12:55:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:26,025 INFO L225 Difference]: With dead ends: 48 [2018-10-15 12:55:26,025 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 12:55:26,027 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,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 12:55:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-10-15 12:55:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 12:55:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-15 12:55:26,172 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 29 [2018-10-15 12:55:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:26,172 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-15 12:55:26,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-15 12:55:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 12:55:26,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,174 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,174 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash -269835606, now seen corresponding path program 1 times [2018-10-15 12:55:26,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:26,422 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,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:26,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:26,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:26,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:26,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:26,426 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 5 states. [2018-10-15 12:55:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:26,824 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 12:55:26,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:55:26,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-15 12:55:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:26,827 INFO L225 Difference]: With dead ends: 58 [2018-10-15 12:55:26,827 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 12:55:26,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 12:55:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-10-15 12:55:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 12:55:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-15 12:55:26,837 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 39 [2018-10-15 12:55:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:26,837 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-15 12:55:26,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-15 12:55:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 12:55:26,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,843 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,843 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1889599808, now seen corresponding path program 2 times [2018-10-15 12:55:26,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:27,145 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:27,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:27,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:55:27,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:55:27,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:55:27,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:27,147 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 7 states. [2018-10-15 12:55:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,332 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-15 12:55:27,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:55:27,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-10-15 12:55:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,334 INFO L225 Difference]: With dead ends: 68 [2018-10-15 12:55:27,335 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 12:55:27,335 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,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 12:55:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-10-15 12:55:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 12:55:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-15 12:55:27,342 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 49 [2018-10-15 12:55:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,342 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-15 12:55:27,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:55:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-15 12:55:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 12:55:27,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,344 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,345 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1773647702, now seen corresponding path program 3 times [2018-10-15 12:55:27,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:27,512 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,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:27,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:27,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:27,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:27,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:27,514 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 9 states. [2018-10-15 12:55:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,796 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 12:55:27,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:55:27,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-10-15 12:55:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,798 INFO L225 Difference]: With dead ends: 78 [2018-10-15 12:55:27,798 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 12:55:27,799 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,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 12:55:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2018-10-15 12:55:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 12:55:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-15 12:55:27,806 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 59 [2018-10-15 12:55:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,813 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-15 12:55:27,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-15 12:55:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 12:55:27,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,815 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,818 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash -729076628, now seen corresponding path program 4 times [2018-10-15 12:55:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,311 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,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:28,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:28,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:28,313 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 11 states. [2018-10-15 12:55:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:28,802 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-15 12:55:28,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:55:28,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-10-15 12:55:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:28,804 INFO L225 Difference]: With dead ends: 88 [2018-10-15 12:55:28,805 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 12:55:28,805 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,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 12:55:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2018-10-15 12:55:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 12:55:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-15 12:55:28,812 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 69 [2018-10-15 12:55:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:28,813 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-15 12:55:28,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-15 12:55:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:55:28,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:28,814 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,815 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:28,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:28,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1693957634, now seen corresponding path program 5 times [2018-10-15 12:55:28,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,026 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:29,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:29,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:29,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:29,028 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 13 states. [2018-10-15 12:55:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,355 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-15 12:55:29,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:55:29,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-10-15 12:55:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,358 INFO L225 Difference]: With dead ends: 98 [2018-10-15 12:55:29,359 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 12:55:29,360 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,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 12:55:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2018-10-15 12:55:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-15 12:55:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-15 12:55:29,366 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 79 [2018-10-15 12:55:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,367 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-15 12:55:29,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-15 12:55:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 12:55:29,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,368 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,369 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash 631491608, now seen corresponding path program 6 times [2018-10-15 12:55:29,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,624 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,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:29,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:29,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:29,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:29,625 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 15 states. [2018-10-15 12:55:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:30,006 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 12:55:30,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:55:30,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-15 12:55:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:30,008 INFO L225 Difference]: With dead ends: 108 [2018-10-15 12:55:30,008 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:55:30,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:55:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-10-15 12:55:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 12:55:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-15 12:55:30,017 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 89 [2018-10-15 12:55:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:30,018 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-15 12:55:30,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-15 12:55:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 12:55:30,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:30,020 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:30,020 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:30,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:30,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1287501486, now seen corresponding path program 7 times [2018-10-15 12:55:30,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:30,273 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:30,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:30,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:30,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:30,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:30,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:30,274 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 17 states. [2018-10-15 12:55:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:30,636 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 12:55:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:55:30,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2018-10-15 12:55:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:30,637 INFO L225 Difference]: With dead ends: 118 [2018-10-15 12:55:30,637 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 12:55:30,639 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,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 12:55:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2018-10-15 12:55:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 12:55:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 12:55:30,652 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 99 [2018-10-15 12:55:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:30,652 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 12:55:30,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 12:55:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:55:30,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:30,657 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,657 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:30,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1912331716, now seen corresponding path program 8 times [2018-10-15 12:55:30,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:30,952 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,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:30,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:30,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:30,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:30,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:30,954 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 19 states. [2018-10-15 12:55:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:31,547 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-15 12:55:31,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:55:31,549 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-10-15 12:55:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:31,550 INFO L225 Difference]: With dead ends: 128 [2018-10-15 12:55:31,550 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 12:55:31,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 12:55:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-10-15 12:55:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-15 12:55:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-15 12:55:31,557 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 109 [2018-10-15 12:55:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:31,557 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-15 12:55:31,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-15 12:55:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 12:55:31,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:31,559 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,560 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:31,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1151115610, now seen corresponding path program 9 times [2018-10-15 12:55:31,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:32,051 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:32,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:32,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:32,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:32,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:32,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:32,053 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 21 states. [2018-10-15 12:55:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:32,518 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-15 12:55:32,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:55:32,518 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-10-15 12:55:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:32,520 INFO L225 Difference]: With dead ends: 138 [2018-10-15 12:55:32,520 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 12:55:32,521 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,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 12:55:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2018-10-15 12:55:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-15 12:55:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-15 12:55:32,527 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 119 [2018-10-15 12:55:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:32,527 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-15 12:55:32,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-15 12:55:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 12:55:32,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:32,530 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,530 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:32,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:32,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1050254992, now seen corresponding path program 10 times [2018-10-15 12:55:32,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:32,917 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,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:32,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:32,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:32,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:32,919 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 23 states. [2018-10-15 12:55:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:33,395 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 12:55:33,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:55:33,396 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-10-15 12:55:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:33,397 INFO L225 Difference]: With dead ends: 148 [2018-10-15 12:55:33,398 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 12:55:33,399 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,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 12:55:33,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2018-10-15 12:55:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:55:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-15 12:55:33,404 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 129 [2018-10-15 12:55:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:33,405 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-15 12:55:33,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-15 12:55:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:55:33,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:33,407 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,408 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:33,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash -391676410, now seen corresponding path program 11 times [2018-10-15 12:55:33,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:33,891 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,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:33,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:33,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:33,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:33,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:33,894 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 25 states. [2018-10-15 12:55:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:34,482 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-15 12:55:34,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:55:34,483 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 139 [2018-10-15 12:55:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:34,484 INFO L225 Difference]: With dead ends: 158 [2018-10-15 12:55:34,485 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 12:55:34,486 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,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 12:55:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2018-10-15 12:55:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 12:55:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-15 12:55:34,491 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 139 [2018-10-15 12:55:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:34,492 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-15 12:55:34,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-15 12:55:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:55:34,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:34,494 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,494 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:34,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash -197765348, now seen corresponding path program 12 times [2018-10-15 12:55:34,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:34,895 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,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:34,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:34,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:34,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:34,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:34,897 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 27 states. [2018-10-15 12:55:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:35,440 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-10-15 12:55:35,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:55:35,441 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 149 [2018-10-15 12:55:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:35,443 INFO L225 Difference]: With dead ends: 168 [2018-10-15 12:55:35,443 INFO L226 Difference]: Without dead ends: 168 [2018-10-15 12:55:35,445 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,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-15 12:55:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2018-10-15 12:55:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 12:55:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-15 12:55:35,449 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 149 [2018-10-15 12:55:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:35,449 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-15 12:55:35,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-15 12:55:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 12:55:35,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:35,451 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,452 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:35,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash 225529010, now seen corresponding path program 13 times [2018-10-15 12:55:35,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,066 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,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:36,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:36,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:36,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:36,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:36,068 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 29 states. [2018-10-15 12:55:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,306 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-15 12:55:37,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:55:37,306 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 159 [2018-10-15 12:55:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,307 INFO L225 Difference]: With dead ends: 178 [2018-10-15 12:55:37,308 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 12:55:37,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:55:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 12:55:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2018-10-15 12:55:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 12:55:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-15 12:55:37,313 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 159 [2018-10-15 12:55:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,313 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-15 12:55:37,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-15 12:55:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:55:37,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,315 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,315 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2093039928, now seen corresponding path program 14 times [2018-10-15 12:55:37,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,590 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,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:38,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:38,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:38,592 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 31 states. [2018-10-15 12:55:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:39,228 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-15 12:55:39,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:55:39,229 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 169 [2018-10-15 12:55:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:39,231 INFO L225 Difference]: With dead ends: 188 [2018-10-15 12:55:39,231 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 12:55:39,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:55:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 12:55:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2018-10-15 12:55:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-15 12:55:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-15 12:55:39,237 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 169 [2018-10-15 12:55:39,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:39,237 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-15 12:55:39,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-15 12:55:39,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 12:55:39,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:39,239 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:39,239 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:39,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:39,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2146628258, now seen corresponding path program 15 times [2018-10-15 12:55:39,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:39,712 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:39,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:39,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:39,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:39,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:39,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:39,714 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 33 states. [2018-10-15 12:55:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:40,453 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-15 12:55:40,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:55:40,456 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 179 [2018-10-15 12:55:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:40,458 INFO L225 Difference]: With dead ends: 198 [2018-10-15 12:55:40,458 INFO L226 Difference]: Without dead ends: 198 [2018-10-15 12:55:40,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:55:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-15 12:55:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2018-10-15 12:55:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-15 12:55:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-15 12:55:40,464 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 179 [2018-10-15 12:55:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:40,465 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-15 12:55:40,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-15 12:55:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-15 12:55:40,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:40,466 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:40,467 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:40,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1070766196, now seen corresponding path program 16 times [2018-10-15 12:55:40,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:41,760 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,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:41,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:41,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:41,762 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 35 states. [2018-10-15 12:55:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:42,828 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-15 12:55:42,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:55:42,829 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2018-10-15 12:55:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:42,831 INFO L225 Difference]: With dead ends: 208 [2018-10-15 12:55:42,831 INFO L226 Difference]: Without dead ends: 208 [2018-10-15 12:55:42,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:55:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-15 12:55:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 200. [2018-10-15 12:55:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:55:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 12:55:42,836 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 189 [2018-10-15 12:55:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:42,837 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 12:55:42,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:55:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 12:55:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:55:42,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:42,838 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,839 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:42,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash -972177398, now seen corresponding path program 17 times [2018-10-15 12:55:42,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:43,346 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,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:43,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:55:43,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:55:43,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:55:43,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:43,347 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 37 states. [2018-10-15 12:55:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:44,271 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-15 12:55:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:55:44,271 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 199 [2018-10-15 12:55:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:44,273 INFO L225 Difference]: With dead ends: 218 [2018-10-15 12:55:44,273 INFO L226 Difference]: Without dead ends: 218 [2018-10-15 12:55:44,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:55:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-15 12:55:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-10-15 12:55:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-15 12:55:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-15 12:55:44,279 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 199 [2018-10-15 12:55:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:44,279 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-15 12:55:44,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:55:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-15 12:55:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 12:55:44,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:44,281 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,281 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:44,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash 331670560, now seen corresponding path program 18 times [2018-10-15 12:55:44,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:45,040 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,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:45,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:55:45,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:55:45,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:55:45,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:45,042 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 39 states. [2018-10-15 12:55:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:45,950 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-10-15 12:55:45,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:55:45,950 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 209 [2018-10-15 12:55:45,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:45,952 INFO L225 Difference]: With dead ends: 228 [2018-10-15 12:55:45,952 INFO L226 Difference]: Without dead ends: 228 [2018-10-15 12:55:45,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:55:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-15 12:55:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 220. [2018-10-15 12:55:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 12:55:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-10-15 12:55:45,959 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 209 [2018-10-15 12:55:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:45,959 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-10-15 12:55:45,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:55:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-10-15 12:55:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 12:55:45,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:45,960 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:45,961 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:45,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash -578394954, now seen corresponding path program 19 times [2018-10-15 12:55:45,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:47,293 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,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:47,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:55:47,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:55:47,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:55:47,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:55:47,295 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 41 states. [2018-10-15 12:55:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:48,413 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-15 12:55:48,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:55:48,413 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 219 [2018-10-15 12:55:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:48,415 INFO L225 Difference]: With dead ends: 238 [2018-10-15 12:55:48,416 INFO L226 Difference]: Without dead ends: 238 [2018-10-15 12:55:48,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:55:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-15 12:55:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2018-10-15 12:55:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 12:55:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-15 12:55:48,422 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 219 [2018-10-15 12:55:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:48,423 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-15 12:55:48,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:55:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-15 12:55:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 12:55:48,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:48,424 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,425 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:48,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:48,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1050107444, now seen corresponding path program 20 times [2018-10-15 12:55:48,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:49,226 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,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:49,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:55:49,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:55:49,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:55:49,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:49,228 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 43 states. [2018-10-15 12:55:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:51,486 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-15 12:55:51,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:55:51,487 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 229 [2018-10-15 12:55:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:51,489 INFO L225 Difference]: With dead ends: 248 [2018-10-15 12:55:51,489 INFO L226 Difference]: Without dead ends: 248 [2018-10-15 12:55:51,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:55:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-15 12:55:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 240. [2018-10-15 12:55:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 12:55:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-15 12:55:51,497 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 229 [2018-10-15 12:55:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:51,497 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-15 12:55:51,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:55:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-15 12:55:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 12:55:51,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:51,499 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:51,499 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:51,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash -49677470, now seen corresponding path program 21 times [2018-10-15 12:55:51,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:53,063 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:53,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:53,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:55:53,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:55:53,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:55:53,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:55:53,065 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 45 states. [2018-10-15 12:55:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:54,406 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-10-15 12:55:54,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:55:54,409 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 239 [2018-10-15 12:55:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:54,411 INFO L225 Difference]: With dead ends: 258 [2018-10-15 12:55:54,412 INFO L226 Difference]: Without dead ends: 258 [2018-10-15 12:55:54,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:55:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-15 12:55:54,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 250. [2018-10-15 12:55:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-15 12:55:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-10-15 12:55:54,417 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 239 [2018-10-15 12:55:54,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:54,418 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-10-15 12:55:54,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:55:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-10-15 12:55:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 12:55:54,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:54,419 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:54,420 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:54,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:54,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1550790280, now seen corresponding path program 22 times [2018-10-15 12:55:54,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:56,035 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:56,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:56,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:55:56,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:55:56,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:55:56,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:56,037 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 47 states. [2018-10-15 12:55:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:57,699 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-15 12:55:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:55:57,699 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 249 [2018-10-15 12:55:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:57,702 INFO L225 Difference]: With dead ends: 268 [2018-10-15 12:55:57,702 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 12:55:57,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:55:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 12:55:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2018-10-15 12:55:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 12:55:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-15 12:55:57,707 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 249 [2018-10-15 12:55:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:57,708 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-15 12:55:57,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:55:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-15 12:55:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 12:55:57,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:57,709 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:57,710 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:57,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1403749390, now seen corresponding path program 23 times [2018-10-15 12:55:57,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:58,745 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,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:58,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:55:58,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:55:58,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:55:58,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:55:58,747 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 49 states. [2018-10-15 12:56:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:00,229 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-10-15 12:56:00,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:56:00,229 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 259 [2018-10-15 12:56:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:00,232 INFO L225 Difference]: With dead ends: 278 [2018-10-15 12:56:00,232 INFO L226 Difference]: Without dead ends: 278 [2018-10-15 12:56:00,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:56:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-15 12:56:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 270. [2018-10-15 12:56:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-15 12:56:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-15 12:56:00,237 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 259 [2018-10-15 12:56:00,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:00,238 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-15 12:56:00,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:56:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-15 12:56:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 12:56:00,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:00,240 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:56:00,240 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:00,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:00,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1838183204, now seen corresponding path program 24 times [2018-10-15 12:56:00,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:02,617 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:02,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:02,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:56:02,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:56:02,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:56:02,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:56:02,618 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 51 states. [2018-10-15 12:56:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:04,217 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-10-15 12:56:04,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:56:04,218 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 269 [2018-10-15 12:56:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:04,220 INFO L225 Difference]: With dead ends: 288 [2018-10-15 12:56:04,220 INFO L226 Difference]: Without dead ends: 288 [2018-10-15 12:56:04,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:56:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-15 12:56:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2018-10-15 12:56:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-15 12:56:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-10-15 12:56:04,226 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 269 [2018-10-15 12:56:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:04,226 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-10-15 12:56:04,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:56:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-10-15 12:56:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 12:56:04,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:04,228 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:04,229 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:04,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:04,229 INFO L82 PathProgramCache]: Analyzing trace with hash -922878278, now seen corresponding path program 25 times [2018-10-15 12:56:04,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:05,997 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:05,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:05,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:05,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:05,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:05,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:06,000 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 53 states. [2018-10-15 12:56:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:08,015 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-10-15 12:56:08,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:56:08,018 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 279 [2018-10-15 12:56:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:08,020 INFO L225 Difference]: With dead ends: 298 [2018-10-15 12:56:08,020 INFO L226 Difference]: Without dead ends: 298 [2018-10-15 12:56:08,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:56:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-15 12:56:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 290. [2018-10-15 12:56:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:56:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 12:56:08,027 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 279 [2018-10-15 12:56:08,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:08,028 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 12:56:08,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 12:56:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:56:08,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:08,030 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:08,031 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:08,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:08,031 INFO L82 PathProgramCache]: Analyzing trace with hash -348485936, now seen corresponding path program 26 times [2018-10-15 12:56:08,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:10,612 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:10,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:10,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:10,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:10,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:10,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:10,613 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 55 states. [2018-10-15 12:56:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:13,537 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-10-15 12:56:13,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:56:13,538 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 289 [2018-10-15 12:56:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:13,539 INFO L225 Difference]: With dead ends: 308 [2018-10-15 12:56:13,539 INFO L226 Difference]: Without dead ends: 308 [2018-10-15 12:56:13,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:56:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-15 12:56:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2018-10-15 12:56:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-15 12:56:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-10-15 12:56:13,545 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 289 [2018-10-15 12:56:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:13,545 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-10-15 12:56:13,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-10-15 12:56:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 12:56:13,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:13,547 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:13,548 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:13,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:13,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1122735258, now seen corresponding path program 27 times [2018-10-15 12:56:13,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:14,843 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:14,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:14,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:14,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:14,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:14,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:14,845 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 57 states. [2018-10-15 12:56:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:16,692 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-10-15 12:56:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:56:16,692 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 299 [2018-10-15 12:56:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:16,694 INFO L225 Difference]: With dead ends: 318 [2018-10-15 12:56:16,694 INFO L226 Difference]: Without dead ends: 318 [2018-10-15 12:56:16,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:56:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-15 12:56:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2018-10-15 12:56:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-15 12:56:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-10-15 12:56:16,700 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 299 [2018-10-15 12:56:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:16,700 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-10-15 12:56:16,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:56:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-10-15 12:56:16,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 12:56:16,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:16,702 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:16,702 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:16,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1058927492, now seen corresponding path program 28 times [2018-10-15 12:56:16,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:18,589 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:18,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:18,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:56:18,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:56:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:56:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:18,591 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 59 states. [2018-10-15 12:56:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:20,532 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-15 12:56:20,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:56:20,533 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 309 [2018-10-15 12:56:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:20,535 INFO L225 Difference]: With dead ends: 328 [2018-10-15 12:56:20,535 INFO L226 Difference]: Without dead ends: 328 [2018-10-15 12:56:20,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:56:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-15 12:56:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 320. [2018-10-15 12:56:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 12:56:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-15 12:56:20,541 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 309 [2018-10-15 12:56:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:20,542 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-15 12:56:20,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:56:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-15 12:56:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 12:56:20,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:20,544 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:20,544 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:20,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash -931018222, now seen corresponding path program 29 times [2018-10-15 12:56:20,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:22,780 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:22,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:22,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:56:22,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:56:22,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:56:22,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:22,781 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 61 states. [2018-10-15 12:56:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:25,104 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-10-15 12:56:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:56:25,104 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 319 [2018-10-15 12:56:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:25,106 INFO L225 Difference]: With dead ends: 338 [2018-10-15 12:56:25,106 INFO L226 Difference]: Without dead ends: 338 [2018-10-15 12:56:25,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:56:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-15 12:56:25,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 330. [2018-10-15 12:56:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-15 12:56:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-10-15 12:56:25,112 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 319 [2018-10-15 12:56:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:25,112 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-10-15 12:56:25,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:56:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-10-15 12:56:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-15 12:56:25,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:25,114 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:25,115 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:25,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash 727319592, now seen corresponding path program 30 times [2018-10-15 12:56:25,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:28,195 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:28,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:28,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:56:28,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:56:28,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:56:28,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:28,197 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 63 states. [2018-10-15 12:56:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:30,486 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-10-15 12:56:30,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:56:30,486 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 329 [2018-10-15 12:56:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:30,488 INFO L225 Difference]: With dead ends: 348 [2018-10-15 12:56:30,488 INFO L226 Difference]: Without dead ends: 348 [2018-10-15 12:56:30,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:56:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-15 12:56:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 340. [2018-10-15 12:56:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-15 12:56:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-10-15 12:56:30,493 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 329 [2018-10-15 12:56:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:30,494 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-10-15 12:56:30,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:56:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-10-15 12:56:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 12:56:30,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:30,496 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:30,496 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:30,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:30,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2086214334, now seen corresponding path program 31 times [2018-10-15 12:56:30,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:32,450 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:32,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:32,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:56:32,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:56:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:56:32,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:32,452 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 65 states. [2018-10-15 12:56:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:34,984 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-10-15 12:56:34,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:56:34,985 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 339 [2018-10-15 12:56:34,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:34,987 INFO L225 Difference]: With dead ends: 358 [2018-10-15 12:56:34,987 INFO L226 Difference]: Without dead ends: 358 [2018-10-15 12:56:34,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:56:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-15 12:56:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 350. [2018-10-15 12:56:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:56:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-10-15 12:56:34,993 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 339 [2018-10-15 12:56:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:34,993 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-10-15 12:56:34,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:56:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-10-15 12:56:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 12:56:34,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:34,995 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:34,995 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:34,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:34,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1074434604, now seen corresponding path program 32 times [2018-10-15 12:56:34,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:36,691 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:36,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:36,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:56:36,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:56:36,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:56:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:36,693 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 67 states. [2018-10-15 12:56:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:39,497 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-10-15 12:56:39,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:56:39,497 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 349 [2018-10-15 12:56:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:39,499 INFO L225 Difference]: With dead ends: 368 [2018-10-15 12:56:39,499 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 12:56:39,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:56:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 12:56:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 360. [2018-10-15 12:56:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-15 12:56:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2018-10-15 12:56:39,505 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 349 [2018-10-15 12:56:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:39,505 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2018-10-15 12:56:39,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:56:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2018-10-15 12:56:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 12:56:39,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:39,507 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:39,508 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:39,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:39,508 INFO L82 PathProgramCache]: Analyzing trace with hash 573398378, now seen corresponding path program 33 times [2018-10-15 12:56:39,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:41,108 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:41,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:41,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:56:41,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:56:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:56:41,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:41,110 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand 69 states. [2018-10-15 12:56:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:43,935 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-10-15 12:56:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:56:43,935 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 359 [2018-10-15 12:56:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:43,937 INFO L225 Difference]: With dead ends: 378 [2018-10-15 12:56:43,937 INFO L226 Difference]: Without dead ends: 378 [2018-10-15 12:56:43,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:56:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-10-15 12:56:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2018-10-15 12:56:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-15 12:56:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2018-10-15 12:56:43,943 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 359 [2018-10-15 12:56:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:43,944 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 370 transitions. [2018-10-15 12:56:43,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:56:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 370 transitions. [2018-10-15 12:56:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-15 12:56:43,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:43,946 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:43,946 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:43,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash 747063680, now seen corresponding path program 34 times [2018-10-15 12:56:43,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:45,633 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:45,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:45,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:56:45,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:56:45,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:56:45,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:45,636 INFO L87 Difference]: Start difference. First operand 370 states and 370 transitions. Second operand 71 states. [2018-10-15 12:56:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:48,194 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-10-15 12:56:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:56:48,200 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 369 [2018-10-15 12:56:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:48,202 INFO L225 Difference]: With dead ends: 388 [2018-10-15 12:56:48,202 INFO L226 Difference]: Without dead ends: 388 [2018-10-15 12:56:48,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:56:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-15 12:56:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2018-10-15 12:56:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 12:56:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-10-15 12:56:48,208 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 369 [2018-10-15 12:56:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:48,208 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-10-15 12:56:48,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:56:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-10-15 12:56:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 12:56:48,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:48,210 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:48,211 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:48,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2081526294, now seen corresponding path program 35 times [2018-10-15 12:56:48,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:50,114 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:50,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:50,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:56:50,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:56:50,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:56:50,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:50,116 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 73 states. [2018-10-15 12:56:52,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:52,987 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-10-15 12:56:52,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:56:52,995 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 379 [2018-10-15 12:56:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:52,996 INFO L225 Difference]: With dead ends: 398 [2018-10-15 12:56:52,996 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 12:56:52,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:56:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 12:56:53,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 390. [2018-10-15 12:56:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-15 12:56:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2018-10-15 12:56:53,002 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 379 [2018-10-15 12:56:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:53,003 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 390 transitions. [2018-10-15 12:56:53,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:56:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 390 transitions. [2018-10-15 12:56:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-15 12:56:53,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:53,005 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:53,005 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:53,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash -144533716, now seen corresponding path program 36 times [2018-10-15 12:56:53,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:55,819 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:55,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:55,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:56:55,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:56:55,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:56:55,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:56:55,821 INFO L87 Difference]: Start difference. First operand 390 states and 390 transitions. Second operand 75 states. [2018-10-15 12:56:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:59,075 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2018-10-15 12:56:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:56:59,075 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 389 [2018-10-15 12:56:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:59,077 INFO L225 Difference]: With dead ends: 408 [2018-10-15 12:56:59,077 INFO L226 Difference]: Without dead ends: 408 [2018-10-15 12:56:59,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:56:59,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-15 12:56:59,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2018-10-15 12:56:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-15 12:56:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 400 transitions. [2018-10-15 12:56:59,082 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 400 transitions. Word has length 389 [2018-10-15 12:56:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:59,083 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 400 transitions. [2018-10-15 12:56:59,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:56:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 400 transitions. [2018-10-15 12:56:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-15 12:56:59,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:59,085 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:59,086 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:59,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:59,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2070366014, now seen corresponding path program 37 times [2018-10-15 12:56:59,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:01,067 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:57:01,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:01,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:57:01,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:57:01,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:57:01,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:57:01,069 INFO L87 Difference]: Start difference. First operand 400 states and 400 transitions. Second operand 77 states. [2018-10-15 12:57:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:04,586 INFO L93 Difference]: Finished difference Result 418 states and 418 transitions. [2018-10-15 12:57:04,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:57:04,587 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 399 [2018-10-15 12:57:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:04,588 INFO L225 Difference]: With dead ends: 418 [2018-10-15 12:57:04,588 INFO L226 Difference]: Without dead ends: 418 [2018-10-15 12:57:04,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:57:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-15 12:57:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 410. [2018-10-15 12:57:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:57:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 410 transitions. [2018-10-15 12:57:04,596 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 410 transitions. Word has length 399 [2018-10-15 12:57:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:04,596 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 410 transitions. [2018-10-15 12:57:04,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:57:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 410 transitions. [2018-10-15 12:57:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 12:57:04,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:04,600 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:57:04,600 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:04,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:04,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1062885080, now seen corresponding path program 38 times [2018-10-15 12:57:04,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:06,926 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:06,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:06,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:57:06,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:57:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:57:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:57:06,929 INFO L87 Difference]: Start difference. First operand 410 states and 410 transitions. Second operand 79 states. [2018-10-15 12:57:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:10,623 INFO L93 Difference]: Finished difference Result 428 states and 428 transitions. [2018-10-15 12:57:10,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:57:10,623 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 409 [2018-10-15 12:57:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:10,625 INFO L225 Difference]: With dead ends: 428 [2018-10-15 12:57:10,625 INFO L226 Difference]: Without dead ends: 428 [2018-10-15 12:57:10,626 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:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-15 12:57:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 420. [2018-10-15 12:57:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-15 12:57:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 420 transitions. [2018-10-15 12:57:10,632 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 420 transitions. Word has length 409 [2018-10-15 12:57:10,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:10,632 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 420 transitions. [2018-10-15 12:57:10,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:57:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 420 transitions. [2018-10-15 12:57:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 12:57:10,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:10,635 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:10,635 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:10,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash 785764718, now seen corresponding path program 39 times [2018-10-15 12:57:10,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:12,844 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:12,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:12,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:57:12,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:57:12,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:57:12,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:12,846 INFO L87 Difference]: Start difference. First operand 420 states and 420 transitions. Second operand 81 states. [2018-10-15 12:57:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:16,468 INFO L93 Difference]: Finished difference Result 438 states and 438 transitions. [2018-10-15 12:57:16,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:57:16,468 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 419 [2018-10-15 12:57:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:16,470 INFO L225 Difference]: With dead ends: 438 [2018-10-15 12:57:16,470 INFO L226 Difference]: Without dead ends: 438 [2018-10-15 12:57:16,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:57:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-10-15 12:57:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 430. [2018-10-15 12:57:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-15 12:57:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 430 transitions. [2018-10-15 12:57:16,476 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 430 transitions. Word has length 419 [2018-10-15 12:57:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:16,476 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 430 transitions. [2018-10-15 12:57:16,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:57:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 430 transitions. [2018-10-15 12:57:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 12:57:16,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:16,479 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:16,479 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:16,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2076280964, now seen corresponding path program 40 times [2018-10-15 12:57:16,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:18,884 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:18,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:18,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:57:18,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:57:18,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:57:18,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:18,886 INFO L87 Difference]: Start difference. First operand 430 states and 430 transitions. Second operand 83 states. [2018-10-15 12:57:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:22,910 INFO L93 Difference]: Finished difference Result 448 states and 448 transitions. [2018-10-15 12:57:22,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:57:22,918 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 429 [2018-10-15 12:57:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:22,920 INFO L225 Difference]: With dead ends: 448 [2018-10-15 12:57:22,920 INFO L226 Difference]: Without dead ends: 448 [2018-10-15 12:57:22,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:57:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-15 12:57:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 440. [2018-10-15 12:57:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-10-15 12:57:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 440 transitions. [2018-10-15 12:57:22,927 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 440 transitions. Word has length 429 [2018-10-15 12:57:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:22,927 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 440 transitions. [2018-10-15 12:57:22,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:57:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 440 transitions. [2018-10-15 12:57:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 12:57:22,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:22,930 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:22,930 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:22,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash 643554330, now seen corresponding path program 41 times [2018-10-15 12:57:22,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:25,577 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:25,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:25,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:57:25,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:57:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:57:25,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:25,579 INFO L87 Difference]: Start difference. First operand 440 states and 440 transitions. Second operand 85 states. [2018-10-15 12:57:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:29,678 INFO L93 Difference]: Finished difference Result 458 states and 458 transitions. [2018-10-15 12:57:29,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:57:29,679 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 439 [2018-10-15 12:57:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:29,681 INFO L225 Difference]: With dead ends: 458 [2018-10-15 12:57:29,681 INFO L226 Difference]: Without dead ends: 458 [2018-10-15 12:57:29,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:57:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-15 12:57:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 450. [2018-10-15 12:57:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-15 12:57:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 450 transitions. [2018-10-15 12:57:29,686 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 450 transitions. Word has length 439 [2018-10-15 12:57:29,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:29,686 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 450 transitions. [2018-10-15 12:57:29,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:57:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 450 transitions. [2018-10-15 12:57:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-10-15 12:57:29,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:29,689 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:29,689 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:29,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1013656624, now seen corresponding path program 42 times [2018-10-15 12:57:29,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:32,270 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:32,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:32,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:57:32,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:57:32,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:57:32,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:32,272 INFO L87 Difference]: Start difference. First operand 450 states and 450 transitions. Second operand 87 states. [2018-10-15 12:57:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:36,710 INFO L93 Difference]: Finished difference Result 468 states and 468 transitions. [2018-10-15 12:57:36,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:57:36,710 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 449 [2018-10-15 12:57:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:36,713 INFO L225 Difference]: With dead ends: 468 [2018-10-15 12:57:36,713 INFO L226 Difference]: Without dead ends: 468 [2018-10-15 12:57:36,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:57:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-15 12:57:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 460. [2018-10-15 12:57:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-15 12:57:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 460 transitions. [2018-10-15 12:57:36,719 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 460 transitions. Word has length 449 [2018-10-15 12:57:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:36,720 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 460 transitions. [2018-10-15 12:57:36,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:57:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 460 transitions. [2018-10-15 12:57:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-15 12:57:36,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:36,723 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:36,723 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:36,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:36,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1891772218, now seen corresponding path program 43 times [2018-10-15 12:57:36,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:39,249 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:39,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:39,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:57:39,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:57:39,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:57:39,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:39,251 INFO L87 Difference]: Start difference. First operand 460 states and 460 transitions. Second operand 89 states. [2018-10-15 12:57:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:43,423 INFO L93 Difference]: Finished difference Result 478 states and 478 transitions. [2018-10-15 12:57:43,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:57:43,423 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 459 [2018-10-15 12:57:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:43,426 INFO L225 Difference]: With dead ends: 478 [2018-10-15 12:57:43,426 INFO L226 Difference]: Without dead ends: 478 [2018-10-15 12:57:43,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:57:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-10-15 12:57:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2018-10-15 12:57:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-15 12:57:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 470 transitions. [2018-10-15 12:57:43,432 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 470 transitions. Word has length 459 [2018-10-15 12:57:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:43,433 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 470 transitions. [2018-10-15 12:57:43,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:57:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 470 transitions. [2018-10-15 12:57:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-15 12:57:43,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:43,436 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:43,436 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:43,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:43,436 INFO L82 PathProgramCache]: Analyzing trace with hash -374717988, now seen corresponding path program 44 times [2018-10-15 12:57:43,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:46,215 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:46,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:46,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:57:46,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:57:46,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:57:46,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:46,217 INFO L87 Difference]: Start difference. First operand 470 states and 470 transitions. Second operand 91 states. [2018-10-15 12:57:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:50,758 INFO L93 Difference]: Finished difference Result 488 states and 488 transitions. [2018-10-15 12:57:50,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:57:50,759 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 469 [2018-10-15 12:57:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:50,761 INFO L225 Difference]: With dead ends: 488 [2018-10-15 12:57:50,761 INFO L226 Difference]: Without dead ends: 488 [2018-10-15 12:57:50,763 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:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-15 12:57:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 480. [2018-10-15 12:57:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-15 12:57:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 480 transitions. [2018-10-15 12:57:50,767 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 480 transitions. Word has length 469 [2018-10-15 12:57:50,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:50,767 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 480 transitions. [2018-10-15 12:57:50,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:57:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 480 transitions. [2018-10-15 12:57:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 12:57:50,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:50,769 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:50,769 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:50,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:50,770 INFO L82 PathProgramCache]: Analyzing trace with hash -972109966, now seen corresponding path program 45 times [2018-10-15 12:57:50,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:53,729 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:53,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:53,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:57:53,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:57:53,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:57:53,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:53,731 INFO L87 Difference]: Start difference. First operand 480 states and 480 transitions. Second operand 93 states. [2018-10-15 12:57:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:58,498 INFO L93 Difference]: Finished difference Result 498 states and 498 transitions. [2018-10-15 12:57:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:57:58,498 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 479 [2018-10-15 12:57:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:58,500 INFO L225 Difference]: With dead ends: 498 [2018-10-15 12:57:58,500 INFO L226 Difference]: Without dead ends: 498 [2018-10-15 12:57:58,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:57:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-10-15 12:57:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 490. [2018-10-15 12:57:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-10-15 12:57:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 490 transitions. [2018-10-15 12:57:58,506 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 490 transitions. Word has length 479 [2018-10-15 12:57:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:58,506 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 490 transitions. [2018-10-15 12:57:58,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:57:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 490 transitions. [2018-10-15 12:57:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-10-15 12:57:58,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:58,510 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:58,510 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:58,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:58,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2075014776, now seen corresponding path program 46 times [2018-10-15 12:57:58,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:01,814 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:58:01,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:01,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:58:01,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:58:01,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:58:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:58:01,816 INFO L87 Difference]: Start difference. First operand 490 states and 490 transitions. Second operand 95 states. [2018-10-15 12:58:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:06,669 INFO L93 Difference]: Finished difference Result 508 states and 508 transitions. [2018-10-15 12:58:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:58:06,670 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 489 [2018-10-15 12:58:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:06,672 INFO L225 Difference]: With dead ends: 508 [2018-10-15 12:58:06,672 INFO L226 Difference]: Without dead ends: 508 [2018-10-15 12:58:06,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:58:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-10-15 12:58:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 500. [2018-10-15 12:58:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-15 12:58:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 500 transitions. [2018-10-15 12:58:06,678 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 500 transitions. Word has length 489 [2018-10-15 12:58:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:06,678 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 500 transitions. [2018-10-15 12:58:06,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:58:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 500 transitions. [2018-10-15 12:58:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 12:58:06,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:06,681 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:06,681 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:06,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:06,681 INFO L82 PathProgramCache]: Analyzing trace with hash 534882334, now seen corresponding path program 47 times [2018-10-15 12:58:06,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:09,644 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:09,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:09,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:58:09,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:58:09,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:58:09,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:58:09,646 INFO L87 Difference]: Start difference. First operand 500 states and 500 transitions. Second operand 97 states. [2018-10-15 12:58:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:14,504 INFO L93 Difference]: Finished difference Result 518 states and 518 transitions. [2018-10-15 12:58:14,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:58:14,504 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 499 [2018-10-15 12:58:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:14,506 INFO L225 Difference]: With dead ends: 518 [2018-10-15 12:58:14,506 INFO L226 Difference]: Without dead ends: 518 [2018-10-15 12:58:14,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:58:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-10-15 12:58:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 510. [2018-10-15 12:58:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-10-15 12:58:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 510 transitions. [2018-10-15 12:58:14,512 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 510 transitions. Word has length 499 [2018-10-15 12:58:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:14,513 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 510 transitions. [2018-10-15 12:58:14,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:58:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 510 transitions. [2018-10-15 12:58:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-15 12:58:14,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:14,516 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:14,516 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:14,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:14,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1706345268, now seen corresponding path program 48 times [2018-10-15 12:58:14,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:17,774 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:17,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:17,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:58:17,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:58:17,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:58:17,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:17,776 INFO L87 Difference]: Start difference. First operand 510 states and 510 transitions. Second operand 99 states. [2018-10-15 12:58:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:23,110 INFO L93 Difference]: Finished difference Result 528 states and 528 transitions. [2018-10-15 12:58:23,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:58:23,111 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 509 [2018-10-15 12:58:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:23,113 INFO L225 Difference]: With dead ends: 528 [2018-10-15 12:58:23,113 INFO L226 Difference]: Without dead ends: 528 [2018-10-15 12:58:23,114 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:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-15 12:58:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 520. [2018-10-15 12:58:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-15 12:58:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 520 transitions. [2018-10-15 12:58:23,118 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 520 transitions. Word has length 509 [2018-10-15 12:58:23,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:23,119 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 520 transitions. [2018-10-15 12:58:23,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:58:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 520 transitions. [2018-10-15 12:58:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 12:58:23,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:23,121 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:23,122 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:23,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1438025014, now seen corresponding path program 49 times [2018-10-15 12:58:23,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:26,523 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:26,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:26,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:58:26,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:58:26,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:58:26,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:26,525 INFO L87 Difference]: Start difference. First operand 520 states and 520 transitions. Second operand 101 states. [2018-10-15 12:58:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:32,141 INFO L93 Difference]: Finished difference Result 538 states and 538 transitions. [2018-10-15 12:58:32,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:58:32,141 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 519 [2018-10-15 12:58:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:32,144 INFO L225 Difference]: With dead ends: 538 [2018-10-15 12:58:32,144 INFO L226 Difference]: Without dead ends: 538 [2018-10-15 12:58:32,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:58:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-15 12:58:32,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2018-10-15 12:58:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-15 12:58:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 530 transitions. [2018-10-15 12:58:32,152 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 530 transitions. Word has length 519 [2018-10-15 12:58:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:32,153 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 530 transitions. [2018-10-15 12:58:32,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:58:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 530 transitions. [2018-10-15 12:58:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-10-15 12:58:32,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:32,156 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:32,156 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:32,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:32,157 INFO L82 PathProgramCache]: Analyzing trace with hash -5886240, now seen corresponding path program 50 times [2018-10-15 12:58:32,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:35,765 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:35,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:35,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:58:35,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:58:35,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:58:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:35,767 INFO L87 Difference]: Start difference. First operand 530 states and 530 transitions. Second operand 103 states. [2018-10-15 12:58:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:41,883 INFO L93 Difference]: Finished difference Result 548 states and 548 transitions. [2018-10-15 12:58:41,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:58:41,884 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 529 [2018-10-15 12:58:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:41,886 INFO L225 Difference]: With dead ends: 548 [2018-10-15 12:58:41,886 INFO L226 Difference]: Without dead ends: 548 [2018-10-15 12:58:41,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:58:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-10-15 12:58:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 540. [2018-10-15 12:58:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-10-15 12:58:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 540 transitions. [2018-10-15 12:58:41,892 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 540 transitions. Word has length 529 [2018-10-15 12:58:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:41,892 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 540 transitions. [2018-10-15 12:58:41,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:58:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 540 transitions. [2018-10-15 12:58:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-10-15 12:58:41,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:41,896 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:41,896 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:41,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash -346472586, now seen corresponding path program 51 times [2018-10-15 12:58:41,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:45,407 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:45,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:45,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:58:45,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:58:45,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:58:45,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:45,409 INFO L87 Difference]: Start difference. First operand 540 states and 540 transitions. Second operand 105 states. [2018-10-15 12:58:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:51,395 INFO L93 Difference]: Finished difference Result 558 states and 558 transitions. [2018-10-15 12:58:51,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:58:51,395 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 539 [2018-10-15 12:58:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:51,397 INFO L225 Difference]: With dead ends: 558 [2018-10-15 12:58:51,397 INFO L226 Difference]: Without dead ends: 558 [2018-10-15 12:58:51,398 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:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-10-15 12:58:51,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 550. [2018-10-15 12:58:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-10-15 12:58:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 550 transitions. [2018-10-15 12:58:51,403 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 550 transitions. Word has length 539 [2018-10-15 12:58:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:51,403 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 550 transitions. [2018-10-15 12:58:51,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:58:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 550 transitions. [2018-10-15 12:58:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-10-15 12:58:51,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:51,406 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:51,406 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:51,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:51,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1669788532, now seen corresponding path program 52 times [2018-10-15 12:58:51,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:54,998 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:54,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:54,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:58:54,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:58:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:58:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:55,000 INFO L87 Difference]: Start difference. First operand 550 states and 550 transitions. Second operand 107 states. [2018-10-15 12:59:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:01,247 INFO L93 Difference]: Finished difference Result 568 states and 568 transitions. [2018-10-15 12:59:01,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:59:01,248 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 549 [2018-10-15 12:59:01,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:01,249 INFO L225 Difference]: With dead ends: 568 [2018-10-15 12:59:01,250 INFO L226 Difference]: Without dead ends: 568 [2018-10-15 12:59:01,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:59:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-15 12:59:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 560. [2018-10-15 12:59:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-15 12:59:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 560 transitions. [2018-10-15 12:59:01,255 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 560 transitions. Word has length 549 [2018-10-15 12:59:01,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:01,255 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 560 transitions. [2018-10-15 12:59:01,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:59:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 560 transitions. [2018-10-15 12:59:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 12:59:01,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:01,259 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:59:01,259 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:01,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1583090142, now seen corresponding path program 53 times [2018-10-15 12:59:01,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:05,140 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:59:05,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:05,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:59:05,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:59:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:59:05,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:59:05,142 INFO L87 Difference]: Start difference. First operand 560 states and 560 transitions. Second operand 109 states. [2018-10-15 12:59:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:11,650 INFO L93 Difference]: Finished difference Result 578 states and 578 transitions. [2018-10-15 12:59:11,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:59:11,650 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 559 [2018-10-15 12:59:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:11,652 INFO L225 Difference]: With dead ends: 578 [2018-10-15 12:59:11,652 INFO L226 Difference]: Without dead ends: 578 [2018-10-15 12:59:11,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:59:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-10-15 12:59:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 570. [2018-10-15 12:59:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-15 12:59:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 570 transitions. [2018-10-15 12:59:11,658 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 570 transitions. Word has length 559 [2018-10-15 12:59:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:11,659 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 570 transitions. [2018-10-15 12:59:11,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:59:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 570 transitions. [2018-10-15 12:59:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-10-15 12:59:11,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:11,661 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:11,662 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:11,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:11,662 INFO L82 PathProgramCache]: Analyzing trace with hash 520117304, now seen corresponding path program 54 times [2018-10-15 12:59:11,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:15,671 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:15,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:15,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:59:15,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:59:15,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:59:15,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:15,673 INFO L87 Difference]: Start difference. First operand 570 states and 570 transitions. Second operand 111 states. [2018-10-15 12:59:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:22,265 INFO L93 Difference]: Finished difference Result 588 states and 588 transitions. [2018-10-15 12:59:22,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:59:22,266 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 569 [2018-10-15 12:59:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:22,267 INFO L225 Difference]: With dead ends: 588 [2018-10-15 12:59:22,267 INFO L226 Difference]: Without dead ends: 588 [2018-10-15 12:59:22,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:59:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-10-15 12:59:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 580. [2018-10-15 12:59:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-10-15 12:59:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 580 transitions. [2018-10-15 12:59:22,272 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 580 transitions. Word has length 569 [2018-10-15 12:59:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:22,273 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 580 transitions. [2018-10-15 12:59:22,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:59:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 580 transitions. [2018-10-15 12:59:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-15 12:59:22,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:22,276 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:22,276 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:22,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2076401970, now seen corresponding path program 55 times [2018-10-15 12:59:22,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:26,107 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:26,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:26,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:59:26,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:59:26,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:59:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:26,109 INFO L87 Difference]: Start difference. First operand 580 states and 580 transitions. Second operand 113 states. [2018-10-15 12:59:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:33,381 INFO L93 Difference]: Finished difference Result 598 states and 598 transitions. [2018-10-15 12:59:33,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:59:33,381 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 579 [2018-10-15 12:59:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:33,383 INFO L225 Difference]: With dead ends: 598 [2018-10-15 12:59:33,383 INFO L226 Difference]: Without dead ends: 598 [2018-10-15 12:59:33,385 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:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-10-15 12:59:33,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 590. [2018-10-15 12:59:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-15 12:59:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 590 transitions. [2018-10-15 12:59:33,389 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 590 transitions. Word has length 579 [2018-10-15 12:59:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:33,390 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 590 transitions. [2018-10-15 12:59:33,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:59:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 590 transitions. [2018-10-15 12:59:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-10-15 12:59:33,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:33,392 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:33,393 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:33,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1030808092, now seen corresponding path program 56 times [2018-10-15 12:59:33,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:37,457 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:37,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:37,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:59:37,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:59:37,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:59:37,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:37,459 INFO L87 Difference]: Start difference. First operand 590 states and 590 transitions. Second operand 115 states. [2018-10-15 12:59:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:44,820 INFO L93 Difference]: Finished difference Result 608 states and 608 transitions. [2018-10-15 12:59:44,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:59:44,820 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 589 [2018-10-15 12:59:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:44,822 INFO L225 Difference]: With dead ends: 608 [2018-10-15 12:59:44,822 INFO L226 Difference]: Without dead ends: 608 [2018-10-15 12:59:44,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:59:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-15 12:59:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2018-10-15 12:59:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-15 12:59:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 600 transitions. [2018-10-15 12:59:44,828 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 600 transitions. Word has length 589 [2018-10-15 12:59:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:44,829 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 600 transitions. [2018-10-15 12:59:44,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:59:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 600 transitions. [2018-10-15 12:59:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 12:59:44,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:44,831 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:44,832 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:44,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:44,832 INFO L82 PathProgramCache]: Analyzing trace with hash 45496698, now seen corresponding path program 57 times [2018-10-15 12:59:44,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:49,231 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:49,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:49,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:59:49,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:59:49,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:59:49,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:49,233 INFO L87 Difference]: Start difference. First operand 600 states and 600 transitions. Second operand 117 states. [2018-10-15 12:59:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:56,591 INFO L93 Difference]: Finished difference Result 618 states and 618 transitions. [2018-10-15 12:59:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:59:56,592 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 599 [2018-10-15 12:59:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:56,594 INFO L225 Difference]: With dead ends: 618 [2018-10-15 12:59:56,594 INFO L226 Difference]: Without dead ends: 618 [2018-10-15 12:59:56,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:59:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-15 12:59:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2018-10-15 12:59:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-15 12:59:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 610 transitions. [2018-10-15 12:59:56,600 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 610 transitions. Word has length 599 [2018-10-15 12:59:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:56,600 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 610 transitions. [2018-10-15 12:59:56,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:59:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 610 transitions. [2018-10-15 12:59:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-15 12:59:56,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:56,603 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:56,604 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:56,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash -621260400, now seen corresponding path program 58 times [2018-10-15 12:59:56,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:01,164 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 13:00:01,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:01,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 13:00:01,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 13:00:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 13:00:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:00:01,166 INFO L87 Difference]: Start difference. First operand 610 states and 610 transitions. Second operand 119 states. [2018-10-15 13:00:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:08,704 INFO L93 Difference]: Finished difference Result 628 states and 628 transitions. [2018-10-15 13:00:08,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 13:00:08,704 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 609 [2018-10-15 13:00:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:08,707 INFO L225 Difference]: With dead ends: 628 [2018-10-15 13:00:08,707 INFO L226 Difference]: Without dead ends: 628 [2018-10-15 13:00:08,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 13:00:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-15 13:00:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 620. [2018-10-15 13:00:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-10-15 13:00:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 620 transitions. [2018-10-15 13:00:08,714 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 620 transitions. Word has length 609 [2018-10-15 13:00:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:08,714 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 620 transitions. [2018-10-15 13:00:08,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 13:00:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 620 transitions. [2018-10-15 13:00:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-15 13:00:08,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:08,717 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:08,717 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:08,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:08,718 INFO L82 PathProgramCache]: Analyzing trace with hash 86230566, now seen corresponding path program 59 times [2018-10-15 13:00:08,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:13,220 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:13,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:13,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 13:00:13,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 13:00:13,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 13:00:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:00:13,223 INFO L87 Difference]: Start difference. First operand 620 states and 620 transitions. Second operand 121 states. [2018-10-15 13:00:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:21,133 INFO L93 Difference]: Finished difference Result 638 states and 638 transitions. [2018-10-15 13:00:21,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 13:00:21,133 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 619 [2018-10-15 13:00:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:21,135 INFO L225 Difference]: With dead ends: 638 [2018-10-15 13:00:21,136 INFO L226 Difference]: Without dead ends: 638 [2018-10-15 13:00:21,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:00:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-10-15 13:00:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2018-10-15 13:00:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-10-15 13:00:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 630 transitions. [2018-10-15 13:00:21,143 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 630 transitions. Word has length 619 [2018-10-15 13:00:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:21,143 INFO L481 AbstractCegarLoop]: Abstraction has 630 states and 630 transitions. [2018-10-15 13:00:21,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:00:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 630 transitions. [2018-10-15 13:00:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2018-10-15 13:00:21,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:21,146 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:21,146 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:21,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:21,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1802569924, now seen corresponding path program 60 times [2018-10-15 13:00:21,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:25,936 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:25,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:25,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:00:25,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:00:25,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:00:25,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:25,938 INFO L87 Difference]: Start difference. First operand 630 states and 630 transitions. Second operand 123 states. [2018-10-15 13:00:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:34,328 INFO L93 Difference]: Finished difference Result 648 states and 648 transitions. [2018-10-15 13:00:34,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 13:00:34,328 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 629 [2018-10-15 13:00:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:34,331 INFO L225 Difference]: With dead ends: 648 [2018-10-15 13:00:34,331 INFO L226 Difference]: Without dead ends: 648 [2018-10-15 13:00:34,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:00:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-15 13:00:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 640. [2018-10-15 13:00:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-15 13:00:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 640 transitions. [2018-10-15 13:00:34,336 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 640 transitions. Word has length 629 [2018-10-15 13:00:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:34,337 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 640 transitions. [2018-10-15 13:00:34,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:00:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 640 transitions. [2018-10-15 13:00:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-15 13:00:34,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:34,340 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:34,340 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:34,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:34,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1407695662, now seen corresponding path program 61 times [2018-10-15 13:00:34,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:39,909 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:39,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:39,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:00:39,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:00:39,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:00:39,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:39,911 INFO L87 Difference]: Start difference. First operand 640 states and 640 transitions. Second operand 125 states. [2018-10-15 13:00:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:48,002 INFO L93 Difference]: Finished difference Result 658 states and 658 transitions. [2018-10-15 13:00:48,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 13:00:48,003 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 639 [2018-10-15 13:00:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:48,005 INFO L225 Difference]: With dead ends: 658 [2018-10-15 13:00:48,005 INFO L226 Difference]: Without dead ends: 658 [2018-10-15 13:00:48,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 13:00:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-10-15 13:00:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 650. [2018-10-15 13:00:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-10-15 13:00:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 650 transitions. [2018-10-15 13:00:48,012 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 650 transitions. Word has length 639 [2018-10-15 13:00:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:48,012 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 650 transitions. [2018-10-15 13:00:48,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:00:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 650 transitions. [2018-10-15 13:00:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-15 13:00:48,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:48,015 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:48,016 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:48,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:48,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1272574232, now seen corresponding path program 62 times [2018-10-15 13:00:48,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:53,131 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:53,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:53,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:00:53,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:00:53,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:00:53,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:53,133 INFO L87 Difference]: Start difference. First operand 650 states and 650 transitions. Second operand 127 states. [2018-10-15 13:01:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:01,665 INFO L93 Difference]: Finished difference Result 668 states and 668 transitions. [2018-10-15 13:01:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 13:01:01,665 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 649 [2018-10-15 13:01:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:01,668 INFO L225 Difference]: With dead ends: 668 [2018-10-15 13:01:01,668 INFO L226 Difference]: Without dead ends: 668 [2018-10-15 13:01:01,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:01:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-15 13:01:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 660. [2018-10-15 13:01:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-10-15 13:01:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 660 transitions. [2018-10-15 13:01:01,673 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 660 transitions. Word has length 649 [2018-10-15 13:01:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:01,674 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 660 transitions. [2018-10-15 13:01:01,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:01:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 660 transitions. [2018-10-15 13:01:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-10-15 13:01:01,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:01,677 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:01:01,677 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:01,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash 279360894, now seen corresponding path program 63 times [2018-10-15 13:01:01,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:06,949 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:06,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:06,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:01:06,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:01:06,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:01:06,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:01:06,952 INFO L87 Difference]: Start difference. First operand 660 states and 660 transitions. Second operand 129 states. [2018-10-15 13:01:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:15,698 INFO L93 Difference]: Finished difference Result 678 states and 678 transitions. [2018-10-15 13:01:15,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:01:15,699 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 659 [2018-10-15 13:01:15,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:15,701 INFO L225 Difference]: With dead ends: 678 [2018-10-15 13:01:15,701 INFO L226 Difference]: Without dead ends: 678 [2018-10-15 13:01:15,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 13:01:15,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-10-15 13:01:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 670. [2018-10-15 13:01:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-10-15 13:01:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 670 transitions. [2018-10-15 13:01:15,708 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 670 transitions. Word has length 659 [2018-10-15 13:01:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:15,709 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 670 transitions. [2018-10-15 13:01:15,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:01:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 670 transitions. [2018-10-15 13:01:15,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-10-15 13:01:15,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:15,712 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:15,713 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:15,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:15,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1460705428, now seen corresponding path program 64 times [2018-10-15 13:01:15,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:21,160 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:21,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:21,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:01:21,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:01:21,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:01:21,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:01:21,162 INFO L87 Difference]: Start difference. First operand 670 states and 670 transitions. Second operand 131 states. [2018-10-15 13:01:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:29,985 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2018-10-15 13:01:29,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 13:01:29,985 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 669 [2018-10-15 13:01:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:29,987 INFO L225 Difference]: With dead ends: 688 [2018-10-15 13:01:29,987 INFO L226 Difference]: Without dead ends: 688 [2018-10-15 13:01:29,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:01:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-15 13:01:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2018-10-15 13:01:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-15 13:01:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 680 transitions. [2018-10-15 13:01:29,995 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 680 transitions. Word has length 669 [2018-10-15 13:01:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:29,995 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 680 transitions. [2018-10-15 13:01:29,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:01:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 680 transitions. [2018-10-15 13:01:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-10-15 13:01:29,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:29,999 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:29,999 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:29,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash 73537578, now seen corresponding path program 65 times [2018-10-15 13:01:30,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:35,523 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:35,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:35,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:01:35,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:01:35,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:01:35,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:35,525 INFO L87 Difference]: Start difference. First operand 680 states and 680 transitions. Second operand 133 states. [2018-10-15 13:01:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:44,623 INFO L93 Difference]: Finished difference Result 698 states and 698 transitions. [2018-10-15 13:01:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 13:01:44,623 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 679 [2018-10-15 13:01:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:44,625 INFO L225 Difference]: With dead ends: 698 [2018-10-15 13:01:44,625 INFO L226 Difference]: Without dead ends: 698 [2018-10-15 13:01:44,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:01:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-10-15 13:01:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 690. [2018-10-15 13:01:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-15 13:01:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 690 transitions. [2018-10-15 13:01:44,631 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 690 transitions. Word has length 679 [2018-10-15 13:01:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:44,632 INFO L481 AbstractCegarLoop]: Abstraction has 690 states and 690 transitions. [2018-10-15 13:01:44,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:01:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 690 transitions. [2018-10-15 13:01:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-10-15 13:01:44,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:44,635 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:44,635 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:44,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:44,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1289644992, now seen corresponding path program 66 times [2018-10-15 13:01:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:51,322 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:51,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:51,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:01:51,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:01:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:01:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:51,324 INFO L87 Difference]: Start difference. First operand 690 states and 690 transitions. Second operand 135 states. [2018-10-15 13:02:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:00,558 INFO L93 Difference]: Finished difference Result 708 states and 708 transitions. [2018-10-15 13:02:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 13:02:00,559 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 689 [2018-10-15 13:02:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:00,562 INFO L225 Difference]: With dead ends: 708 [2018-10-15 13:02:00,562 INFO L226 Difference]: Without dead ends: 708 [2018-10-15 13:02:00,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 13:02:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-10-15 13:02:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 700. [2018-10-15 13:02:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-15 13:02:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 700 transitions. [2018-10-15 13:02:00,569 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 700 transitions. Word has length 689 [2018-10-15 13:02:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:00,569 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 700 transitions. [2018-10-15 13:02:00,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:02:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 700 transitions. [2018-10-15 13:02:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-15 13:02:00,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:00,573 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:02:00,573 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:00,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash -782406442, now seen corresponding path program 67 times [2018-10-15 13:02:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:06,672 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:06,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:06,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:02:06,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:02:06,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:02:06,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:02:06,674 INFO L87 Difference]: Start difference. First operand 700 states and 700 transitions. Second operand 137 states. [2018-10-15 13:02:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:16,457 INFO L93 Difference]: Finished difference Result 718 states and 718 transitions. [2018-10-15 13:02:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 13:02:16,457 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 699 [2018-10-15 13:02:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:16,461 INFO L225 Difference]: With dead ends: 718 [2018-10-15 13:02:16,461 INFO L226 Difference]: Without dead ends: 718 [2018-10-15 13:02:16,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:02:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-10-15 13:02:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 710. [2018-10-15 13:02:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-10-15 13:02:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 710 transitions. [2018-10-15 13:02:16,470 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 710 transitions. Word has length 699 [2018-10-15 13:02:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:16,470 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 710 transitions. [2018-10-15 13:02:16,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:02:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 710 transitions. [2018-10-15 13:02:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-10-15 13:02:16,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:16,474 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:16,474 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:16,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash -693370388, now seen corresponding path program 68 times [2018-10-15 13:02:16,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:22,549 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:22,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:22,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:02:22,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:02:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:02:22,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:02:22,551 INFO L87 Difference]: Start difference. First operand 710 states and 710 transitions. Second operand 139 states. [2018-10-15 13:02:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:32,625 INFO L93 Difference]: Finished difference Result 728 states and 728 transitions. [2018-10-15 13:02:32,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 13:02:32,625 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 709 [2018-10-15 13:02:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:32,628 INFO L225 Difference]: With dead ends: 728 [2018-10-15 13:02:32,628 INFO L226 Difference]: Without dead ends: 728 [2018-10-15 13:02:32,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:02:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-10-15 13:02:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 720. [2018-10-15 13:02:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-15 13:02:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 720 transitions. [2018-10-15 13:02:32,636 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 720 transitions. Word has length 709 [2018-10-15 13:02:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:32,636 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 720 transitions. [2018-10-15 13:02:32,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:02:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 720 transitions. [2018-10-15 13:02:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-15 13:02:32,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:32,640 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:32,640 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:32,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash -97799294, now seen corresponding path program 69 times [2018-10-15 13:02:32,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:38,878 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:38,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:38,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:02:38,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:02:38,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:02:38,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:38,881 INFO L87 Difference]: Start difference. First operand 720 states and 720 transitions. Second operand 141 states. [2018-10-15 13:02:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:49,658 INFO L93 Difference]: Finished difference Result 738 states and 738 transitions. [2018-10-15 13:02:49,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 13:02:49,659 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 719 [2018-10-15 13:02:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:49,661 INFO L225 Difference]: With dead ends: 738 [2018-10-15 13:02:49,661 INFO L226 Difference]: Without dead ends: 738 [2018-10-15 13:02:49,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 13:02:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-10-15 13:02:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 730. [2018-10-15 13:02:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-10-15 13:02:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 730 transitions. [2018-10-15 13:02:49,668 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 730 transitions. Word has length 719 [2018-10-15 13:02:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:49,668 INFO L481 AbstractCegarLoop]: Abstraction has 730 states and 730 transitions. [2018-10-15 13:02:49,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:02:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 730 transitions. [2018-10-15 13:02:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-10-15 13:02:49,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:49,673 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:49,674 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:49,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1753407896, now seen corresponding path program 70 times [2018-10-15 13:02:49,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:56,022 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:56,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:56,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:02:56,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:02:56,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:02:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:56,024 INFO L87 Difference]: Start difference. First operand 730 states and 730 transitions. Second operand 143 states. [2018-10-15 13:03:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:06,770 INFO L93 Difference]: Finished difference Result 748 states and 748 transitions. [2018-10-15 13:03:06,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:03:06,771 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 729 [2018-10-15 13:03:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:06,773 INFO L225 Difference]: With dead ends: 748 [2018-10-15 13:03:06,773 INFO L226 Difference]: Without dead ends: 748 [2018-10-15 13:03:06,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 13:03:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-15 13:03:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 740. [2018-10-15 13:03:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-10-15 13:03:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 740 transitions. [2018-10-15 13:03:06,780 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 740 transitions. Word has length 729 [2018-10-15 13:03:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:06,780 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 740 transitions. [2018-10-15 13:03:06,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:03:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 740 transitions. [2018-10-15 13:03:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-15 13:03:06,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:06,784 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:06,784 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:06,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:06,785 INFO L82 PathProgramCache]: Analyzing trace with hash -102765522, now seen corresponding path program 71 times [2018-10-15 13:03:06,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:13,652 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:13,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:13,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:03:13,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:03:13,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:03:13,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:03:13,654 INFO L87 Difference]: Start difference. First operand 740 states and 740 transitions. Second operand 145 states. [2018-10-15 13:03:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:24,640 INFO L93 Difference]: Finished difference Result 758 states and 758 transitions. [2018-10-15 13:03:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 13:03:24,641 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 739 [2018-10-15 13:03:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:24,643 INFO L225 Difference]: With dead ends: 758 [2018-10-15 13:03:24,643 INFO L226 Difference]: Without dead ends: 758 [2018-10-15 13:03:24,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 13:03:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-10-15 13:03:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 750. [2018-10-15 13:03:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-10-15 13:03:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 750 transitions. [2018-10-15 13:03:24,651 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 750 transitions. Word has length 739 [2018-10-15 13:03:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:24,652 INFO L481 AbstractCegarLoop]: Abstraction has 750 states and 750 transitions. [2018-10-15 13:03:24,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:03:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 750 transitions. [2018-10-15 13:03:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-15 13:03:24,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:24,656 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:24,656 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:24,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1744384836, now seen corresponding path program 72 times [2018-10-15 13:03:24,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:31,337 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:31,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:31,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:03:31,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:03:31,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:03:31,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:03:31,340 INFO L87 Difference]: Start difference. First operand 750 states and 750 transitions. Second operand 147 states.