java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 18:42:02,147 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 18:42:02,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 18:42:02,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 18:42:02,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 18:42:02,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 18:42:02,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 18:42:02,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 18:42:02,166 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 18:42:02,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 18:42:02,170 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 18:42:02,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 18:42:02,171 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 18:42:02,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 18:42:02,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 18:42:02,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 18:42:02,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 18:42:02,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 18:42:02,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 18:42:02,195 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 18:42:02,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 18:42:02,199 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 18:42:02,201 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 18:42:02,201 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 18:42:02,201 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 18:42:02,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 18:42:02,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 18:42:02,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 18:42:02,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 18:42:02,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 18:42:02,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 18:42:02,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 18:42:02,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 18:42:02,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 18:42:02,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 18:42:02,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 18:42:02,210 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-14 18:42:02,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 18:42:02,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 18:42:02,226 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 18:42:02,226 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 18:42:02,227 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 18:42:02,227 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 18:42:02,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 18:42:02,228 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 18:42:02,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 18:42:02,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 18:42:02,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 18:42:02,229 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 18:42:02,229 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 18:42:02,230 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 18:42:02,230 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 18:42:02,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 18:42:02,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 18:42:02,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 18:42:02,305 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 18:42:02,306 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 18:42:02,306 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl [2018-10-14 18:42:02,307 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl' [2018-10-14 18:42:02,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 18:42:02,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 18:42:02,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 18:42:02,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 18:42:02,391 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 18:42:02,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:42:02" (1/1) ... [2018-10-14 18:42:02,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:42:02" (1/1) ... [2018-10-14 18:42:02,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:42:02" (1/1) ... [2018-10-14 18:42:02,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:42:02" (1/1) ... [2018-10-14 18:42:02,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:42:02" (1/1) ... [2018-10-14 18:42:02,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:42:02" (1/1) ... [2018-10-14 18:42:02,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:42:02" (1/1) ... [2018-10-14 18:42:02,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 18:42:02,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 18:42:02,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 18:42:02,475 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 18:42:02,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:42:02" (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-14 18:42:02,563 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 18:42:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 18:42:02,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 18:42:03,179 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 18:42:03,179 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:42:03 BoogieIcfgContainer [2018-10-14 18:42:03,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 18:42:03,180 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 18:42:03,180 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 18:42:03,181 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 18:42:03,186 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:42:03" (1/1) ... [2018-10-14 18:42:03,194 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 18:42:03,195 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 18:42:03,234 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 18:42:03,287 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 18:42:03,303 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 18:42:03,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 18:42:13,208 INFO L315 AbstractInterpreter]: Visited 58 different actions 120 times. Merged at 30 different actions 60 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-10-14 18:42:13,210 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 18:42:13,214 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 18:42:13,225 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_7|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:42:13,227 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_7|) |v_ULTIMATE.start_read~int_#ptr.offset_5|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:42:13,233 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_13|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:42:13,233 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_13|) |v_ULTIMATE.start_read~int_#ptr.offset_9|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:42:13,308 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-14 18:42:13,309 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 18:42:13,310 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:42:13,310 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:42:13,310 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:42:13,311 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:42:13,311 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:42:13,311 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:42:13,311 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:42:13,311 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:42:13,312 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:42:13,312 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:42:13,312 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:42:13,312 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:42:13,313 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:42:13,313 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:42:13,315 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 18:42:13,334 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:42:13 BasicIcfg [2018-10-14 18:42:13,334 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 18:42:13,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 18:42:13,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 18:42:13,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 18:42:13,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:42:02" (1/3) ... [2018-10-14 18:42:13,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e314d86 and model type standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:42:13, skipping insertion in model container [2018-10-14 18:42:13,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:42:03" (2/3) ... [2018-10-14 18:42:13,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e314d86 and model type standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:42:13, skipping insertion in model container [2018-10-14 18:42:13,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:42:13" (3/3) ... [2018-10-14 18:42:13,344 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 18:42:13,356 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 18:42:13,366 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 18:42:13,384 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 18:42:13,411 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 18:42:13,412 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 18:42:13,412 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 18:42:13,412 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 18:42:13,413 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 18:42:13,413 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 18:42:13,413 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 18:42:13,413 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 18:42:13,413 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 18:42:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-14 18:42:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-14 18:42:13,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:13,435 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:13,437 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:13,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash 935810993, now seen corresponding path program 1 times [2018-10-14 18:42:13,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:14,544 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-14 18:42:14,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:42:14,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-14 18:42:14,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 18:42:14,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 18:42:14,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:42:14,567 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 12 states. [2018-10-14 18:42:15,263 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-14 18:42:15,605 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-14 18:42:15,933 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-14 18:42:16,446 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-14 18:42:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:16,718 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-14 18:42:16,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 18:42:16,720 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-10-14 18:42:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:16,732 INFO L225 Difference]: With dead ends: 85 [2018-10-14 18:42:16,733 INFO L226 Difference]: Without dead ends: 85 [2018-10-14 18:42:16,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:42:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-14 18:42:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2018-10-14 18:42:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-14 18:42:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-14 18:42:16,778 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 30 [2018-10-14 18:42:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:16,779 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-14 18:42:16,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 18:42:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-14 18:42:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-14 18:42:16,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:16,781 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:16,782 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:16,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash 465255713, now seen corresponding path program 1 times [2018-10-14 18:42:16,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:17,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:17,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 18:42:17,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 18:42:17,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 18:42:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:42:17,362 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 15 states. [2018-10-14 18:42:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:18,574 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-14 18:42:18,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 18:42:18,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-14 18:42:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:18,577 INFO L225 Difference]: With dead ends: 113 [2018-10-14 18:42:18,577 INFO L226 Difference]: Without dead ends: 113 [2018-10-14 18:42:18,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:42:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-14 18:42:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2018-10-14 18:42:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-14 18:42:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-14 18:42:18,588 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 58 [2018-10-14 18:42:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:18,589 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-14 18:42:18,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 18:42:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-14 18:42:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-14 18:42:18,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:18,592 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:18,592 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:18,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:18,593 INFO L82 PathProgramCache]: Analyzing trace with hash -276194671, now seen corresponding path program 2 times [2018-10-14 18:42:18,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:19,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:19,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 18:42:19,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 18:42:19,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 18:42:19,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-14 18:42:19,071 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 16 states. [2018-10-14 18:42:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:20,205 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-14 18:42:20,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 18:42:20,206 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-10-14 18:42:20,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:20,208 INFO L225 Difference]: With dead ends: 141 [2018-10-14 18:42:20,209 INFO L226 Difference]: Without dead ends: 141 [2018-10-14 18:42:20,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 18:42:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-14 18:42:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2018-10-14 18:42:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-14 18:42:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-14 18:42:20,222 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 86 [2018-10-14 18:42:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:20,222 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-14 18:42:20,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 18:42:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-14 18:42:20,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-14 18:42:20,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:20,227 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:20,227 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:20,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:20,227 INFO L82 PathProgramCache]: Analyzing trace with hash 994996225, now seen corresponding path program 3 times [2018-10-14 18:42:20,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:20,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:20,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 18:42:20,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 18:42:20,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 18:42:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-10-14 18:42:20,853 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 17 states. [2018-10-14 18:42:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:22,630 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-14 18:42:22,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-14 18:42:22,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-10-14 18:42:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:22,640 INFO L225 Difference]: With dead ends: 169 [2018-10-14 18:42:22,640 INFO L226 Difference]: Without dead ends: 169 [2018-10-14 18:42:22,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:42:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-14 18:42:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2018-10-14 18:42:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-14 18:42:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-14 18:42:22,661 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 114 [2018-10-14 18:42:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:22,662 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-14 18:42:22,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 18:42:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-14 18:42:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-14 18:42:22,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:22,665 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:22,665 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:22,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2061124239, now seen corresponding path program 4 times [2018-10-14 18:42:22,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:23,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:23,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 18:42:23,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 18:42:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 18:42:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-10-14 18:42:23,775 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 18 states. [2018-10-14 18:42:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:25,424 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-14 18:42:25,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 18:42:25,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-10-14 18:42:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:25,436 INFO L225 Difference]: With dead ends: 197 [2018-10-14 18:42:25,436 INFO L226 Difference]: Without dead ends: 197 [2018-10-14 18:42:25,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 18:42:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-14 18:42:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 171. [2018-10-14 18:42:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-14 18:42:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-14 18:42:25,449 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 142 [2018-10-14 18:42:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:25,449 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-14 18:42:25,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 18:42:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-14 18:42:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-14 18:42:25,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:25,453 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:25,453 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:25,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1361806049, now seen corresponding path program 5 times [2018-10-14 18:42:25,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:26,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:26,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 18:42:26,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 18:42:26,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 18:42:26,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-14 18:42:26,304 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 19 states. [2018-10-14 18:42:28,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:28,317 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-14 18:42:28,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 18:42:28,319 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 170 [2018-10-14 18:42:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:28,321 INFO L225 Difference]: With dead ends: 225 [2018-10-14 18:42:28,321 INFO L226 Difference]: Without dead ends: 225 [2018-10-14 18:42:28,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:42:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-14 18:42:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2018-10-14 18:42:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-14 18:42:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-14 18:42:28,333 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 170 [2018-10-14 18:42:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:28,334 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-14 18:42:28,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 18:42:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-14 18:42:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-14 18:42:28,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:28,337 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:28,337 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:28,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:28,338 INFO L82 PathProgramCache]: Analyzing trace with hash 561758289, now seen corresponding path program 6 times [2018-10-14 18:42:28,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:29,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:29,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 18:42:29,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 18:42:29,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 18:42:29,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-14 18:42:29,365 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 20 states. [2018-10-14 18:42:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:31,687 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-14 18:42:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-14 18:42:31,688 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 198 [2018-10-14 18:42:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:31,690 INFO L225 Difference]: With dead ends: 253 [2018-10-14 18:42:31,690 INFO L226 Difference]: Without dead ends: 253 [2018-10-14 18:42:31,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=380, Invalid=1260, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 18:42:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-14 18:42:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2018-10-14 18:42:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-14 18:42:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-14 18:42:31,698 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 198 [2018-10-14 18:42:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:31,699 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-14 18:42:31,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 18:42:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-14 18:42:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-14 18:42:31,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:31,702 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:31,702 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:31,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:31,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1983018433, now seen corresponding path program 7 times [2018-10-14 18:42:31,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:33,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:33,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 18:42:33,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 18:42:33,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 18:42:33,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-14 18:42:33,011 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 21 states. [2018-10-14 18:42:35,481 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-14 18:42:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:35,863 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-14 18:42:35,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 18:42:35,865 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 226 [2018-10-14 18:42:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:35,867 INFO L225 Difference]: With dead ends: 281 [2018-10-14 18:42:35,867 INFO L226 Difference]: Without dead ends: 281 [2018-10-14 18:42:35,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:42:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-14 18:42:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 255. [2018-10-14 18:42:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-14 18:42:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-14 18:42:35,874 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 226 [2018-10-14 18:42:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:35,874 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-14 18:42:35,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 18:42:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-14 18:42:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-14 18:42:35,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:35,878 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:35,878 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:35,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:35,878 INFO L82 PathProgramCache]: Analyzing trace with hash -848583887, now seen corresponding path program 8 times [2018-10-14 18:42:35,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:36,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:36,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 18:42:36,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 18:42:36,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 18:42:36,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:42:36,979 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 22 states. [2018-10-14 18:42:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:39,952 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-14 18:42:39,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 18:42:39,953 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 254 [2018-10-14 18:42:39,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:39,955 INFO L225 Difference]: With dead ends: 309 [2018-10-14 18:42:39,955 INFO L226 Difference]: Without dead ends: 309 [2018-10-14 18:42:39,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 18:42:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-14 18:42:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2018-10-14 18:42:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-14 18:42:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-14 18:42:39,962 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 254 [2018-10-14 18:42:39,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:39,962 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-14 18:42:39,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 18:42:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-14 18:42:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-14 18:42:39,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:39,966 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:39,966 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:39,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:39,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1555871583, now seen corresponding path program 9 times [2018-10-14 18:42:39,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:40,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:40,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 18:42:40,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 18:42:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 18:42:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:42:40,822 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 23 states. [2018-10-14 18:42:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:43,921 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-14 18:42:43,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 18:42:43,922 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 282 [2018-10-14 18:42:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:43,924 INFO L225 Difference]: With dead ends: 337 [2018-10-14 18:42:43,924 INFO L226 Difference]: Without dead ends: 337 [2018-10-14 18:42:43,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:42:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-14 18:42:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 311. [2018-10-14 18:42:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-14 18:42:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-14 18:42:43,931 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 282 [2018-10-14 18:42:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:43,932 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-14 18:42:43,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 18:42:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-14 18:42:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-14 18:42:43,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:43,934 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:43,934 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:43,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:43,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1909810705, now seen corresponding path program 10 times [2018-10-14 18:42:43,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 0 proven. 1290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:45,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:45,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 18:42:45,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 18:42:45,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 18:42:45,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:42:45,219 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 24 states. [2018-10-14 18:42:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:48,691 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-14 18:42:48,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 18:42:48,692 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 310 [2018-10-14 18:42:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:48,695 INFO L225 Difference]: With dead ends: 365 [2018-10-14 18:42:48,695 INFO L226 Difference]: Without dead ends: 365 [2018-10-14 18:42:48,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=476, Invalid=1876, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:42:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-14 18:42:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 339. [2018-10-14 18:42:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-14 18:42:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-14 18:42:48,702 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 310 [2018-10-14 18:42:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:48,702 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-14 18:42:48,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 18:42:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-14 18:42:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-14 18:42:48,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:48,705 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:48,705 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:48,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1321337983, now seen corresponding path program 11 times [2018-10-14 18:42:48,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1573 backedges. 0 proven. 1573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:49,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:49,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 18:42:49,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 18:42:49,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 18:42:49,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-10-14 18:42:49,767 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 25 states. [2018-10-14 18:42:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:54,017 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-14 18:42:54,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 18:42:54,020 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 338 [2018-10-14 18:42:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:54,022 INFO L225 Difference]: With dead ends: 393 [2018-10-14 18:42:54,022 INFO L226 Difference]: Without dead ends: 393 [2018-10-14 18:42:54,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:42:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-14 18:42:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 367. [2018-10-14 18:42:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-14 18:42:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-14 18:42:54,029 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 338 [2018-10-14 18:42:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:54,030 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-14 18:42:54,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 18:42:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-14 18:42:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-14 18:42:54,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:54,032 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:42:54,033 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:54,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash -677836559, now seen corresponding path program 12 times [2018-10-14 18:42:54,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1884 backedges. 0 proven. 1884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:55,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:55,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 18:42:55,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 18:42:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 18:42:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-10-14 18:42:55,762 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 26 states. [2018-10-14 18:43:00,611 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-14 18:43:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:00,960 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-14 18:43:00,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 18:43:00,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 366 [2018-10-14 18:43:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:00,963 INFO L225 Difference]: With dead ends: 421 [2018-10-14 18:43:00,963 INFO L226 Difference]: Without dead ends: 421 [2018-10-14 18:43:00,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 18:43:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-14 18:43:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 395. [2018-10-14 18:43:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-14 18:43:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-14 18:43:00,971 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 366 [2018-10-14 18:43:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:00,972 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-14 18:43:00,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 18:43:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-14 18:43:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-14 18:43:00,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:00,975 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:43:00,975 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:00,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:00,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1493339745, now seen corresponding path program 13 times [2018-10-14 18:43:00,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:02,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:02,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 18:43:02,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 18:43:02,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 18:43:02,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:43:02,377 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 27 states. [2018-10-14 18:43:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:07,512 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-14 18:43:07,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 18:43:07,513 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 394 [2018-10-14 18:43:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:07,516 INFO L225 Difference]: With dead ends: 449 [2018-10-14 18:43:07,516 INFO L226 Difference]: Without dead ends: 449 [2018-10-14 18:43:07,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=548, Invalid=2422, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 18:43:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-14 18:43:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 423. [2018-10-14 18:43:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-14 18:43:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-14 18:43:07,524 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 394 [2018-10-14 18:43:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:07,525 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-14 18:43:07,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 18:43:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-14 18:43:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-14 18:43:07,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:07,528 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:43:07,529 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:07,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:07,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1483306031, now seen corresponding path program 14 times [2018-10-14 18:43:07,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2590 backedges. 0 proven. 2590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:09,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:09,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 18:43:09,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 18:43:09,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 18:43:09,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-14 18:43:09,801 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 28 states. [2018-10-14 18:43:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:15,414 INFO L93 Difference]: Finished difference Result 477 states and 477 transitions. [2018-10-14 18:43:15,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 18:43:15,415 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 422 [2018-10-14 18:43:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:15,417 INFO L225 Difference]: With dead ends: 477 [2018-10-14 18:43:15,417 INFO L226 Difference]: Without dead ends: 477 [2018-10-14 18:43:15,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=572, Invalid=2620, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 18:43:15,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-14 18:43:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 451. [2018-10-14 18:43:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-14 18:43:15,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-14 18:43:15,425 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 422 [2018-10-14 18:43:15,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:15,426 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-14 18:43:15,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 18:43:15,426 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-14 18:43:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-14 18:43:15,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:15,429 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:43:15,429 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:15,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:15,430 INFO L82 PathProgramCache]: Analyzing trace with hash 863043905, now seen corresponding path program 15 times [2018-10-14 18:43:15,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2985 backedges. 0 proven. 2985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:17,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:17,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 18:43:17,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 18:43:17,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 18:43:17,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-10-14 18:43:17,457 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 29 states. [2018-10-14 18:43:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:23,548 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-10-14 18:43:23,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 18:43:23,549 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 450 [2018-10-14 18:43:23,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:23,552 INFO L225 Difference]: With dead ends: 505 [2018-10-14 18:43:23,552 INFO L226 Difference]: Without dead ends: 505 [2018-10-14 18:43:23,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=596, Invalid=2826, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 18:43:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-14 18:43:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 479. [2018-10-14 18:43:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-14 18:43:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-14 18:43:23,560 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 450 [2018-10-14 18:43:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:23,561 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-14 18:43:23,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 18:43:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-14 18:43:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-14 18:43:23,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:23,565 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:43:23,565 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:23,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1789783729, now seen corresponding path program 16 times [2018-10-14 18:43:23,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3408 backedges. 0 proven. 3408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:25,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:25,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 18:43:25,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 18:43:25,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 18:43:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2018-10-14 18:43:25,619 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 30 states. [2018-10-14 18:43:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:32,545 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-14 18:43:32,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 18:43:32,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 478 [2018-10-14 18:43:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:32,549 INFO L225 Difference]: With dead ends: 533 [2018-10-14 18:43:32,549 INFO L226 Difference]: Without dead ends: 533 [2018-10-14 18:43:32,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=620, Invalid=3040, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 18:43:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-14 18:43:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 507. [2018-10-14 18:43:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-14 18:43:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2018-10-14 18:43:32,557 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 478 [2018-10-14 18:43:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:32,558 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 507 transitions. [2018-10-14 18:43:32,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 18:43:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 507 transitions. [2018-10-14 18:43:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-14 18:43:32,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:32,561 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:43:32,562 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:32,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:32,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1184279519, now seen corresponding path program 17 times [2018-10-14 18:43:32,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:33,156 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 18:43:33,340 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 18:43:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3859 backedges. 0 proven. 3859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:34,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:34,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 18:43:34,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 18:43:34,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 18:43:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:43:34,870 INFO L87 Difference]: Start difference. First operand 507 states and 507 transitions. Second operand 31 states. [2018-10-14 18:43:38,882 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-14 18:43:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:42,583 INFO L93 Difference]: Finished difference Result 561 states and 561 transitions. [2018-10-14 18:43:42,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 18:43:42,583 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 506 [2018-10-14 18:43:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:42,586 INFO L225 Difference]: With dead ends: 561 [2018-10-14 18:43:42,586 INFO L226 Difference]: Without dead ends: 561 [2018-10-14 18:43:42,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=644, Invalid=3262, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 18:43:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-14 18:43:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 535. [2018-10-14 18:43:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-14 18:43:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 535 transitions. [2018-10-14 18:43:42,595 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 535 transitions. Word has length 506 [2018-10-14 18:43:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:42,596 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 535 transitions. [2018-10-14 18:43:42,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 18:43:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 535 transitions. [2018-10-14 18:43:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-14 18:43:42,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:42,600 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:43:42,601 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:42,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:42,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1983958639, now seen corresponding path program 18 times [2018-10-14 18:43:42,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:43,350 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 18:43:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4338 backedges. 0 proven. 4338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:44,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:44,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 18:43:44,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 18:43:44,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 18:43:44,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-10-14 18:43:44,998 INFO L87 Difference]: Start difference. First operand 535 states and 535 transitions. Second operand 32 states. [2018-10-14 18:43:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:52,930 INFO L93 Difference]: Finished difference Result 589 states and 589 transitions. [2018-10-14 18:43:52,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 18:43:52,931 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 534 [2018-10-14 18:43:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:52,934 INFO L225 Difference]: With dead ends: 589 [2018-10-14 18:43:52,934 INFO L226 Difference]: Without dead ends: 589 [2018-10-14 18:43:52,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=668, Invalid=3492, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 18:43:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-14 18:43:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 563. [2018-10-14 18:43:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-14 18:43:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-14 18:43:52,942 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 534 [2018-10-14 18:43:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:52,942 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-14 18:43:52,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 18:43:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-14 18:43:52,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-14 18:43:52,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:52,947 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:43:52,947 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:52,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:52,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1137411841, now seen corresponding path program 19 times [2018-10-14 18:43:52,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:55,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:55,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 18:43:55,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 18:43:55,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 18:43:55,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 18:43:55,075 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 33 states. [2018-10-14 18:44:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:44:04,251 INFO L93 Difference]: Finished difference Result 617 states and 617 transitions. [2018-10-14 18:44:04,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 18:44:04,252 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 562 [2018-10-14 18:44:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:44:04,257 INFO L225 Difference]: With dead ends: 617 [2018-10-14 18:44:04,257 INFO L226 Difference]: Without dead ends: 617 [2018-10-14 18:44:04,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=692, Invalid=3730, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:44:04,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-14 18:44:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 591. [2018-10-14 18:44:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-14 18:44:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 591 transitions. [2018-10-14 18:44:04,269 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 591 transitions. Word has length 562 [2018-10-14 18:44:04,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:44:04,269 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 591 transitions. [2018-10-14 18:44:04,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 18:44:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 591 transitions. [2018-10-14 18:44:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-10-14 18:44:04,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:44:04,276 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:44:04,276 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:44:04,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:44:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1303008369, now seen corresponding path program 20 times [2018-10-14 18:44:04,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:44:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:44:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 5380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:44:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:44:06,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 18:44:06,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 18:44:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 18:44:06,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 18:44:06,774 INFO L87 Difference]: Start difference. First operand 591 states and 591 transitions. Second operand 34 states. [2018-10-14 18:44:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:44:16,712 INFO L93 Difference]: Finished difference Result 645 states and 645 transitions. [2018-10-14 18:44:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 18:44:16,712 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 590 [2018-10-14 18:44:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:44:16,715 INFO L225 Difference]: With dead ends: 645 [2018-10-14 18:44:16,715 INFO L226 Difference]: Without dead ends: 645 [2018-10-14 18:44:16,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=716, Invalid=3976, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 18:44:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-10-14 18:44:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2018-10-14 18:44:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-14 18:44:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 619 transitions. [2018-10-14 18:44:16,724 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 619 transitions. Word has length 590 [2018-10-14 18:44:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:44:16,724 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 619 transitions. [2018-10-14 18:44:16,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 18:44:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 619 transitions. [2018-10-14 18:44:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-14 18:44:16,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:44:16,729 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:44:16,729 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:44:16,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:44:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 192387553, now seen corresponding path program 21 times [2018-10-14 18:44:16,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:44:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:44:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5943 backedges. 0 proven. 5943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:44:19,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:44:19,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 18:44:19,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 18:44:19,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 18:44:19,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:44:19,162 INFO L87 Difference]: Start difference. First operand 619 states and 619 transitions. Second operand 35 states. [2018-10-14 18:44:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:44:29,525 INFO L93 Difference]: Finished difference Result 673 states and 673 transitions. [2018-10-14 18:44:29,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-14 18:44:29,527 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 618 [2018-10-14 18:44:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:44:29,531 INFO L225 Difference]: With dead ends: 673 [2018-10-14 18:44:29,531 INFO L226 Difference]: Without dead ends: 673 [2018-10-14 18:44:29,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=740, Invalid=4230, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 18:44:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-14 18:44:29,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 647. [2018-10-14 18:44:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-10-14 18:44:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 647 transitions. [2018-10-14 18:44:29,539 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 647 transitions. Word has length 618 [2018-10-14 18:44:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:44:29,540 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 647 transitions. [2018-10-14 18:44:29,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 18:44:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 647 transitions. [2018-10-14 18:44:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-14 18:44:29,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:44:29,545 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:44:29,545 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:44:29,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:44:29,546 INFO L82 PathProgramCache]: Analyzing trace with hash -548448431, now seen corresponding path program 22 times [2018-10-14 18:44:29,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:44:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:44:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6534 backedges. 0 proven. 6534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:44:32,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:44:32,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 18:44:32,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 18:44:32,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 18:44:32,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 18:44:32,375 INFO L87 Difference]: Start difference. First operand 647 states and 647 transitions. Second operand 36 states. [2018-10-14 18:44:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:44:43,347 INFO L93 Difference]: Finished difference Result 701 states and 701 transitions. [2018-10-14 18:44:43,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 18:44:43,347 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 646 [2018-10-14 18:44:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:44:43,350 INFO L225 Difference]: With dead ends: 701 [2018-10-14 18:44:43,350 INFO L226 Difference]: Without dead ends: 701 [2018-10-14 18:44:43,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=764, Invalid=4492, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 18:44:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-10-14 18:44:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 675. [2018-10-14 18:44:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-14 18:44:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 675 transitions. [2018-10-14 18:44:43,358 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 675 transitions. Word has length 646 [2018-10-14 18:44:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:44:43,358 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 675 transitions. [2018-10-14 18:44:43,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 18:44:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 675 transitions. [2018-10-14 18:44:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-14 18:44:43,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:44:43,364 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:44:43,364 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:44:43,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:44:43,364 INFO L82 PathProgramCache]: Analyzing trace with hash 692948161, now seen corresponding path program 23 times [2018-10-14 18:44:43,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:44:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:44:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7153 backedges. 0 proven. 7153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:44:46,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:44:46,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 18:44:46,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 18:44:46,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 18:44:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 18:44:46,214 INFO L87 Difference]: Start difference. First operand 675 states and 675 transitions. Second operand 37 states. [2018-10-14 18:44:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:44:58,207 INFO L93 Difference]: Finished difference Result 729 states and 729 transitions. [2018-10-14 18:44:58,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 18:44:58,208 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 674 [2018-10-14 18:44:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:44:58,211 INFO L225 Difference]: With dead ends: 729 [2018-10-14 18:44:58,211 INFO L226 Difference]: Without dead ends: 729 [2018-10-14 18:44:58,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=788, Invalid=4762, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 18:44:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-14 18:44:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2018-10-14 18:44:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-14 18:44:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 703 transitions. [2018-10-14 18:44:58,219 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 703 transitions. Word has length 674 [2018-10-14 18:44:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:44:58,219 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 703 transitions. [2018-10-14 18:44:58,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 18:44:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 703 transitions. [2018-10-14 18:44:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-10-14 18:44:58,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:44:58,225 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:44:58,225 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:44:58,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:44:58,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1200503345, now seen corresponding path program 24 times [2018-10-14 18:44:58,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:44:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:45:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7800 backedges. 0 proven. 7800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:45:02,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:45:02,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 18:45:02,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 18:45:02,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 18:45:02,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 18:45:02,189 INFO L87 Difference]: Start difference. First operand 703 states and 703 transitions. Second operand 38 states. [2018-10-14 18:45:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:45:14,984 INFO L93 Difference]: Finished difference Result 757 states and 757 transitions. [2018-10-14 18:45:14,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-14 18:45:14,984 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 702 [2018-10-14 18:45:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:45:14,987 INFO L225 Difference]: With dead ends: 757 [2018-10-14 18:45:14,987 INFO L226 Difference]: Without dead ends: 757 [2018-10-14 18:45:14,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=812, Invalid=5040, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 18:45:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-14 18:45:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 731. [2018-10-14 18:45:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-10-14 18:45:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 731 transitions. [2018-10-14 18:45:14,998 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 731 transitions. Word has length 702 [2018-10-14 18:45:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:45:14,998 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 731 transitions. [2018-10-14 18:45:14,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 18:45:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 731 transitions. [2018-10-14 18:45:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-10-14 18:45:15,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:45:15,004 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:45:15,004 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:45:15,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:45:15,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1775411295, now seen corresponding path program 25 times [2018-10-14 18:45:15,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:45:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:45:15,675 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 18:45:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:45:18,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:45:18,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 18:45:18,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 18:45:18,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 18:45:18,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:45:18,500 INFO L87 Difference]: Start difference. First operand 731 states and 731 transitions. Second operand 39 states. [2018-10-14 18:45:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:45:33,232 INFO L93 Difference]: Finished difference Result 785 states and 785 transitions. [2018-10-14 18:45:33,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 18:45:33,232 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 730 [2018-10-14 18:45:33,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:45:33,235 INFO L225 Difference]: With dead ends: 785 [2018-10-14 18:45:33,235 INFO L226 Difference]: Without dead ends: 785 [2018-10-14 18:45:33,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=836, Invalid=5326, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 18:45:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-14 18:45:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 759. [2018-10-14 18:45:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-14 18:45:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 759 transitions. [2018-10-14 18:45:33,243 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 759 transitions. Word has length 730 [2018-10-14 18:45:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:45:33,243 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 759 transitions. [2018-10-14 18:45:33,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 18:45:33,244 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 759 transitions. [2018-10-14 18:45:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-14 18:45:33,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:45:33,250 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:45:33,250 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:45:33,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:45:33,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1866923281, now seen corresponding path program 26 times [2018-10-14 18:45:33,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:45:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:45:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9178 backedges. 0 proven. 9178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:45:36,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:45:36,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 18:45:36,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 18:45:36,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 18:45:36,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 18:45:36,678 INFO L87 Difference]: Start difference. First operand 759 states and 759 transitions. Second operand 40 states. [2018-10-14 18:45:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:45:51,787 INFO L93 Difference]: Finished difference Result 813 states and 813 transitions. [2018-10-14 18:45:51,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 18:45:51,788 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 758 [2018-10-14 18:45:51,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:45:51,790 INFO L225 Difference]: With dead ends: 813 [2018-10-14 18:45:51,790 INFO L226 Difference]: Without dead ends: 813 [2018-10-14 18:45:51,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=860, Invalid=5620, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 18:45:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-10-14 18:45:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 787. [2018-10-14 18:45:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-10-14 18:45:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 787 transitions. [2018-10-14 18:45:51,799 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 787 transitions. Word has length 758 [2018-10-14 18:45:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:45:51,800 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 787 transitions. [2018-10-14 18:45:51,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 18:45:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 787 transitions. [2018-10-14 18:45:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2018-10-14 18:45:51,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:45:51,807 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:45:51,807 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:45:51,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:45:51,808 INFO L82 PathProgramCache]: Analyzing trace with hash 720835201, now seen corresponding path program 27 times [2018-10-14 18:45:51,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:45:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:45:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9909 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:45:55,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:45:55,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 18:45:55,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 18:45:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 18:45:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 18:45:55,303 INFO L87 Difference]: Start difference. First operand 787 states and 787 transitions. Second operand 41 states. [2018-10-14 18:46:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:46:10,721 INFO L93 Difference]: Finished difference Result 841 states and 841 transitions. [2018-10-14 18:46:10,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-14 18:46:10,722 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 786 [2018-10-14 18:46:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:46:10,724 INFO L225 Difference]: With dead ends: 841 [2018-10-14 18:46:10,725 INFO L226 Difference]: Without dead ends: 841 [2018-10-14 18:46:10,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=884, Invalid=5922, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 18:46:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-14 18:46:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 815. [2018-10-14 18:46:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-10-14 18:46:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 815 transitions. [2018-10-14 18:46:10,734 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 815 transitions. Word has length 786 [2018-10-14 18:46:10,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:46:10,734 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 815 transitions. [2018-10-14 18:46:10,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 18:46:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 815 transitions. [2018-10-14 18:46:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-10-14 18:46:10,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:46:10,741 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:46:10,742 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:46:10,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:46:10,742 INFO L82 PathProgramCache]: Analyzing trace with hash 525967345, now seen corresponding path program 28 times [2018-10-14 18:46:10,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:46:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:46:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10668 backedges. 0 proven. 10668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:46:14,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:46:14,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 18:46:14,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 18:46:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 18:46:14,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 18:46:14,505 INFO L87 Difference]: Start difference. First operand 815 states and 815 transitions. Second operand 42 states. [2018-10-14 18:46:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:46:30,889 INFO L93 Difference]: Finished difference Result 869 states and 869 transitions. [2018-10-14 18:46:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 18:46:30,889 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 814 [2018-10-14 18:46:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:46:30,892 INFO L225 Difference]: With dead ends: 869 [2018-10-14 18:46:30,892 INFO L226 Difference]: Without dead ends: 869 [2018-10-14 18:46:30,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=908, Invalid=6232, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 18:46:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-10-14 18:46:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 843. [2018-10-14 18:46:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-10-14 18:46:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 843 transitions. [2018-10-14 18:46:30,901 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 843 transitions. Word has length 814 [2018-10-14 18:46:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:46:30,902 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 843 transitions. [2018-10-14 18:46:30,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 18:46:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 843 transitions. [2018-10-14 18:46:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2018-10-14 18:46:30,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:46:30,909 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:46:30,909 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:46:30,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:46:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1601526431, now seen corresponding path program 29 times [2018-10-14 18:46:30,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:46:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:46:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11455 backedges. 0 proven. 11455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:46:35,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:46:35,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 18:46:35,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 18:46:35,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 18:46:35,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:46:35,243 INFO L87 Difference]: Start difference. First operand 843 states and 843 transitions. Second operand 43 states. [2018-10-14 18:46:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:46:52,768 INFO L93 Difference]: Finished difference Result 897 states and 897 transitions. [2018-10-14 18:46:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 18:46:52,768 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 842 [2018-10-14 18:46:52,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:46:52,771 INFO L225 Difference]: With dead ends: 897 [2018-10-14 18:46:52,771 INFO L226 Difference]: Without dead ends: 897 [2018-10-14 18:46:52,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=932, Invalid=6550, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:46:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-10-14 18:46:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 871. [2018-10-14 18:46:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-10-14 18:46:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 871 transitions. [2018-10-14 18:46:52,779 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 871 transitions. Word has length 842 [2018-10-14 18:46:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:46:52,779 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 871 transitions. [2018-10-14 18:46:52,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 18:46:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 871 transitions. [2018-10-14 18:46:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2018-10-14 18:46:52,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:46:52,787 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:46:52,787 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:46:52,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:46:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash 10887889, now seen corresponding path program 30 times [2018-10-14 18:46:52,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:46:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:46:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12270 backedges. 0 proven. 12270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:46:57,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:46:57,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 18:46:57,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 18:46:57,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 18:46:57,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:46:57,086 INFO L87 Difference]: Start difference. First operand 871 states and 871 transitions. Second operand 44 states. [2018-10-14 18:47:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:47:15,399 INFO L93 Difference]: Finished difference Result 925 states and 925 transitions. [2018-10-14 18:47:15,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 18:47:15,400 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 870 [2018-10-14 18:47:15,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:47:15,403 INFO L225 Difference]: With dead ends: 925 [2018-10-14 18:47:15,403 INFO L226 Difference]: Without dead ends: 925 [2018-10-14 18:47:15,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=956, Invalid=6876, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 18:47:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-10-14 18:47:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 899. [2018-10-14 18:47:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-14 18:47:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 899 transitions. [2018-10-14 18:47:15,410 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 899 transitions. Word has length 870 [2018-10-14 18:47:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:47:15,410 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 899 transitions. [2018-10-14 18:47:15,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 18:47:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 899 transitions. [2018-10-14 18:47:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-10-14 18:47:15,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:47:15,416 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:47:15,417 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:47:15,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:47:15,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1882711999, now seen corresponding path program 31 times [2018-10-14 18:47:15,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:47:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:47:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 0 proven. 13113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:47:19,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:47:19,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 18:47:19,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 18:47:19,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 18:47:19,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 18:47:19,945 INFO L87 Difference]: Start difference. First operand 899 states and 899 transitions. Second operand 45 states. [2018-10-14 18:47:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:47:39,485 INFO L93 Difference]: Finished difference Result 953 states and 953 transitions. [2018-10-14 18:47:39,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 18:47:39,486 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 898 [2018-10-14 18:47:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:47:39,489 INFO L225 Difference]: With dead ends: 953 [2018-10-14 18:47:39,489 INFO L226 Difference]: Without dead ends: 953 [2018-10-14 18:47:39,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=980, Invalid=7210, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 18:47:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-10-14 18:47:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 927. [2018-10-14 18:47:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-14 18:47:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 927 transitions. [2018-10-14 18:47:39,497 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 927 transitions. Word has length 898 [2018-10-14 18:47:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:47:39,497 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 927 transitions. [2018-10-14 18:47:39,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 18:47:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 927 transitions. [2018-10-14 18:47:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-10-14 18:47:39,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:47:39,504 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:47:39,504 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:47:39,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:47:39,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1676900943, now seen corresponding path program 32 times [2018-10-14 18:47:39,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:47:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:47:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13984 backedges. 0 proven. 13984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:47:44,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:47:44,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 18:47:44,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 18:47:44,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 18:47:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 18:47:44,168 INFO L87 Difference]: Start difference. First operand 927 states and 927 transitions. Second operand 46 states. [2018-10-14 18:48:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:48:04,326 INFO L93 Difference]: Finished difference Result 981 states and 981 transitions. [2018-10-14 18:48:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 18:48:04,332 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 926 [2018-10-14 18:48:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:48:04,335 INFO L225 Difference]: With dead ends: 981 [2018-10-14 18:48:04,335 INFO L226 Difference]: Without dead ends: 981 [2018-10-14 18:48:04,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1004, Invalid=7552, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 18:48:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-14 18:48:04,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 955. [2018-10-14 18:48:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-14 18:48:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 955 transitions. [2018-10-14 18:48:04,344 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 955 transitions. Word has length 926 [2018-10-14 18:48:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:48:04,345 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 955 transitions. [2018-10-14 18:48:04,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 18:48:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 955 transitions. [2018-10-14 18:48:04,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-10-14 18:48:04,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:48:04,352 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:48:04,352 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:48:04,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:48:04,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1905224481, now seen corresponding path program 33 times [2018-10-14 18:48:04,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:48:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:48:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 14883 backedges. 0 proven. 14883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:48:09,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:48:09,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 18:48:09,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 18:48:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 18:48:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:48:09,323 INFO L87 Difference]: Start difference. First operand 955 states and 955 transitions. Second operand 47 states. [2018-10-14 18:48:30,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:48:30,767 INFO L93 Difference]: Finished difference Result 1009 states and 1009 transitions. [2018-10-14 18:48:30,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 18:48:30,768 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 954 [2018-10-14 18:48:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:48:30,771 INFO L225 Difference]: With dead ends: 1009 [2018-10-14 18:48:30,771 INFO L226 Difference]: Without dead ends: 1009 [2018-10-14 18:48:30,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1028, Invalid=7902, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 18:48:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-10-14 18:48:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 983. [2018-10-14 18:48:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-10-14 18:48:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 983 transitions. [2018-10-14 18:48:30,778 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 983 transitions. Word has length 954 [2018-10-14 18:48:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:48:30,779 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 983 transitions. [2018-10-14 18:48:30,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 18:48:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 983 transitions. [2018-10-14 18:48:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-10-14 18:48:30,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:48:30,787 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:48:30,787 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:48:30,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:48:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1517078673, now seen corresponding path program 34 times [2018-10-14 18:48:30,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:48:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:48:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15810 backedges. 0 proven. 15810 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:48:36,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:48:36,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 18:48:36,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 18:48:36,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 18:48:36,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 18:48:36,151 INFO L87 Difference]: Start difference. First operand 983 states and 983 transitions. Second operand 48 states. [2018-10-14 18:48:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:48:58,650 INFO L93 Difference]: Finished difference Result 1037 states and 1037 transitions. [2018-10-14 18:48:58,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 18:48:58,650 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 982 [2018-10-14 18:48:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:48:58,654 INFO L225 Difference]: With dead ends: 1037 [2018-10-14 18:48:58,654 INFO L226 Difference]: Without dead ends: 1037 [2018-10-14 18:48:58,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1052, Invalid=8260, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 18:48:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-10-14 18:48:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1011. [2018-10-14 18:48:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-14 18:48:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1011 transitions. [2018-10-14 18:48:58,662 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1011 transitions. Word has length 982 [2018-10-14 18:48:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:48:58,662 INFO L481 AbstractCegarLoop]: Abstraction has 1011 states and 1011 transitions. [2018-10-14 18:48:58,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 18:48:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1011 transitions. [2018-10-14 18:48:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1011 [2018-10-14 18:48:58,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:48:58,670 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:48:58,670 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:48:58,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:48:58,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1631543807, now seen corresponding path program 35 times [2018-10-14 18:48:58,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:48:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:49:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16765 backedges. 0 proven. 16765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:49:04,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:49:04,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 18:49:04,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 18:49:04,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 18:49:04,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:49:04,029 INFO L87 Difference]: Start difference. First operand 1011 states and 1011 transitions. Second operand 49 states. [2018-10-14 18:49:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:49:27,989 INFO L93 Difference]: Finished difference Result 1065 states and 1065 transitions. [2018-10-14 18:49:27,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 18:49:27,990 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1010 [2018-10-14 18:49:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:49:27,993 INFO L225 Difference]: With dead ends: 1065 [2018-10-14 18:49:27,993 INFO L226 Difference]: Without dead ends: 1065 [2018-10-14 18:49:27,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1076, Invalid=8626, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 18:49:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-10-14 18:49:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1039. [2018-10-14 18:49:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-10-14 18:49:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1039 transitions. [2018-10-14 18:49:28,001 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1039 transitions. Word has length 1010 [2018-10-14 18:49:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:49:28,001 INFO L481 AbstractCegarLoop]: Abstraction has 1039 states and 1039 transitions. [2018-10-14 18:49:28,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 18:49:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1039 transitions. [2018-10-14 18:49:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-14 18:49:28,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:49:28,008 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:49:28,008 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:49:28,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:49:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2069435535, now seen corresponding path program 36 times [2018-10-14 18:49:28,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:49:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:49:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17748 backedges. 0 proven. 17748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:49:33,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:49:33,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 18:49:33,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 18:49:33,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 18:49:33,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 18:49:33,576 INFO L87 Difference]: Start difference. First operand 1039 states and 1039 transitions. Second operand 50 states. [2018-10-14 18:49:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:49:58,382 INFO L93 Difference]: Finished difference Result 1093 states and 1093 transitions. [2018-10-14 18:49:58,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-14 18:49:58,382 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1038 [2018-10-14 18:49:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:49:58,385 INFO L225 Difference]: With dead ends: 1093 [2018-10-14 18:49:58,386 INFO L226 Difference]: Without dead ends: 1093 [2018-10-14 18:49:58,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1100, Invalid=9000, Unknown=0, NotChecked=0, Total=10100 [2018-10-14 18:49:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-14 18:49:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1067. [2018-10-14 18:49:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2018-10-14 18:49:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1067 transitions. [2018-10-14 18:49:58,393 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1067 transitions. Word has length 1038 [2018-10-14 18:49:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:49:58,394 INFO L481 AbstractCegarLoop]: Abstraction has 1067 states and 1067 transitions. [2018-10-14 18:49:58,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 18:49:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1067 transitions. [2018-10-14 18:49:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2018-10-14 18:49:58,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:49:58,402 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:49:58,403 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:49:58,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:49:58,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1346089185, now seen corresponding path program 37 times [2018-10-14 18:49:58,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:49:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:50:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18759 backedges. 0 proven. 18759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:50:04,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:50:04,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 18:50:04,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 18:50:04,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 18:50:04,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:50:04,312 INFO L87 Difference]: Start difference. First operand 1067 states and 1067 transitions. Second operand 51 states. [2018-10-14 18:50:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:50:30,302 INFO L93 Difference]: Finished difference Result 1121 states and 1121 transitions. [2018-10-14 18:50:30,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 18:50:30,303 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1066 [2018-10-14 18:50:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:50:30,306 INFO L225 Difference]: With dead ends: 1121 [2018-10-14 18:50:30,306 INFO L226 Difference]: Without dead ends: 1121 [2018-10-14 18:50:30,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1124, Invalid=9382, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 18:50:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-10-14 18:50:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1095. [2018-10-14 18:50:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-10-14 18:50:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1095 transitions. [2018-10-14 18:50:30,315 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1095 transitions. Word has length 1066 [2018-10-14 18:50:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:50:30,315 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 1095 transitions. [2018-10-14 18:50:30,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 18:50:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1095 transitions. [2018-10-14 18:50:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2018-10-14 18:50:30,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:50:30,323 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:50:30,323 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:50:30,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:50:30,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1134227025, now seen corresponding path program 38 times [2018-10-14 18:50:30,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:50:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:50:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 19798 backedges. 0 proven. 19798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:50:36,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:50:36,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 18:50:36,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 18:50:36,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 18:50:36,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 18:50:36,492 INFO L87 Difference]: Start difference. First operand 1095 states and 1095 transitions. Second operand 52 states.