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_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 18:40:37,383 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 18:40:37,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 18:40:37,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 18:40:37,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 18:40:37,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 18:40:37,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 18:40:37,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 18:40:37,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 18:40:37,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 18:40:37,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 18:40:37,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 18:40:37,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 18:40:37,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 18:40:37,410 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 18:40:37,411 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 18:40:37,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 18:40:37,413 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 18:40:37,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 18:40:37,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 18:40:37,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 18:40:37,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 18:40:37,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 18:40:37,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 18:40:37,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 18:40:37,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 18:40:37,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 18:40:37,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 18:40:37,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 18:40:37,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 18:40:37,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 18:40:37,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 18:40:37,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 18:40:37,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 18:40:37,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 18:40:37,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 18:40:37,430 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:40:37,441 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 18:40:37,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 18:40:37,444 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 18:40:37,444 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 18:40:37,444 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 18:40:37,445 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 18:40:37,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 18:40:37,446 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 18:40:37,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 18:40:37,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 18:40:37,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 18:40:37,446 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 18:40:37,447 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 18:40:37,451 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 18:40:37,451 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 18:40:37,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 18:40:37,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 18:40:37,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 18:40:37,537 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 18:40:37,538 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 18:40:37,539 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_10.bpl [2018-10-14 18:40:37,539 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_10.bpl' [2018-10-14 18:40:37,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 18:40:37,605 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 18:40:37,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 18:40:37,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 18:40:37,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 18:40:37,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:40:37" (1/1) ... [2018-10-14 18:40:37,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:40:37" (1/1) ... [2018-10-14 18:40:37,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:40:37" (1/1) ... [2018-10-14 18:40:37,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:40:37" (1/1) ... [2018-10-14 18:40:37,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:40:37" (1/1) ... [2018-10-14 18:40:37,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:40:37" (1/1) ... [2018-10-14 18:40:37,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:40:37" (1/1) ... [2018-10-14 18:40:37,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 18:40:37,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 18:40:37,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 18:40:37,687 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 18:40:37,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:40:37" (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:40:37,767 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 18:40:37,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 18:40:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 18:40:38,333 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 18:40:38,334 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:40:38 BoogieIcfgContainer [2018-10-14 18:40:38,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 18:40:38,335 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 18:40:38,335 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 18:40:38,336 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 18:40:38,339 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:40:38" (1/1) ... [2018-10-14 18:40:38,347 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 18:40:38,347 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 18:40:38,385 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 18:40:38,451 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 18:40:38,467 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 18:40:38,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 18:40:49,424 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:40:49,427 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 18:40:49,432 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 18:40:49,491 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_7|) 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:40:49,499 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_12|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:40:49,500 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_12|) |v_ULTIMATE.start_read~int_#ptr.offset_8|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:40:49,503 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_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:40:49,503 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_6|) |v_ULTIMATE.start_read~int_#ptr.offset_4|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:40:49,505 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 18:40:49,505 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:40:49,506 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:40:49,506 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:40:49,506 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:40:49,506 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:40:49,507 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:40:49,507 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:40:49,507 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:40:49,507 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:40:49,507 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:40:49,508 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:40:49,510 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:40:49,510 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:40:49,510 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:40:49,512 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 18:40:49,538 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:40:49 BasicIcfg [2018-10-14 18:40:49,538 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 18:40:49,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 18:40:49,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 18:40:49,545 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 18:40:49,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:40:37" (1/3) ... [2018-10-14 18:40:49,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394be1a8 and model type standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:40:49, skipping insertion in model container [2018-10-14 18:40:49,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:40:38" (2/3) ... [2018-10-14 18:40:49,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394be1a8 and model type standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:40:49, skipping insertion in model container [2018-10-14 18:40:49,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:40:49" (3/3) ... [2018-10-14 18:40:49,550 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 18:40:49,563 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 18:40:49,573 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 18:40:49,594 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 18:40:49,622 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 18:40:49,623 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 18:40:49,623 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 18:40:49,623 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 18:40:49,623 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 18:40:49,623 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 18:40:49,624 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 18:40:49,624 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 18:40:49,624 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 18:40:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-14 18:40:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-14 18:40:49,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:40:49,665 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:40:49,667 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:40:49,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:40:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash 216808173, now seen corresponding path program 1 times [2018-10-14 18:40:49,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:40:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:40:50,738 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-14 18:40:50,970 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:40:50,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:40:50,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-14 18:40:50,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 18:40:50,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 18:40:50,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-14 18:40:50,996 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 8 states. [2018-10-14 18:40:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:40:52,172 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-14 18:40:52,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 18:40:52,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-14 18:40:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:40:52,186 INFO L225 Difference]: With dead ends: 104 [2018-10-14 18:40:52,186 INFO L226 Difference]: Without dead ends: 104 [2018-10-14 18:40:52,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-10-14 18:40:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-14 18:40:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 78. [2018-10-14 18:40:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-14 18:40:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-14 18:40:52,233 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 49 [2018-10-14 18:40:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:40:52,234 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-14 18:40:52,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 18:40:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-14 18:40:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-14 18:40:52,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:40:52,237 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:40:52,238 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:40:52,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:40:52,238 INFO L82 PathProgramCache]: Analyzing trace with hash -783516803, now seen corresponding path program 1 times [2018-10-14 18:40:52,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:40:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:40:53,284 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 18:40:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:40:53,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:40:53,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 18:40:53,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 18:40:53,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 18:40:53,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-14 18:40:53,567 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 13 states. [2018-10-14 18:40:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:40:54,671 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-14 18:40:54,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 18:40:54,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2018-10-14 18:40:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:40:54,677 INFO L225 Difference]: With dead ends: 132 [2018-10-14 18:40:54,677 INFO L226 Difference]: Without dead ends: 132 [2018-10-14 18:40:54,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-10-14 18:40:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-14 18:40:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 106. [2018-10-14 18:40:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-14 18:40:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-14 18:40:54,704 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 77 [2018-10-14 18:40:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:40:54,707 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-14 18:40:54,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 18:40:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-14 18:40:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-14 18:40:54,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:40:54,712 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:40:54,712 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:40:54,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:40:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2076001293, now seen corresponding path program 2 times [2018-10-14 18:40:54,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:40:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:40:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:40:55,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:40:55,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 18:40:55,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 18:40:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 18:40:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-14 18:40:55,192 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 14 states. [2018-10-14 18:40:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:40:55,986 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-14 18:40:55,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-14 18:40:55,990 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2018-10-14 18:40:55,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:40:55,992 INFO L225 Difference]: With dead ends: 160 [2018-10-14 18:40:55,992 INFO L226 Difference]: Without dead ends: 160 [2018-10-14 18:40:55,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:40:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-14 18:40:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 134. [2018-10-14 18:40:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-14 18:40:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-10-14 18:40:56,005 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 105 [2018-10-14 18:40:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:40:56,006 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-10-14 18:40:56,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 18:40:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-10-14 18:40:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-14 18:40:56,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:40:56,009 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:40:56,010 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:40:56,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:40:56,011 INFO L82 PathProgramCache]: Analyzing trace with hash -979200867, now seen corresponding path program 3 times [2018-10-14 18:40:56,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:40:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:40:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:40:56,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:40:56,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 18:40:56,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 18:40:56,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 18:40:56,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:40:56,539 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 15 states. [2018-10-14 18:40:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:40:57,751 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-14 18:40:57,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 18:40:57,752 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 133 [2018-10-14 18:40:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:40:57,754 INFO L225 Difference]: With dead ends: 188 [2018-10-14 18:40:57,754 INFO L226 Difference]: Without dead ends: 188 [2018-10-14 18:40:57,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2018-10-14 18:40:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-14 18:40:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 162. [2018-10-14 18:40:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-14 18:40:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-14 18:40:57,767 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 133 [2018-10-14 18:40:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:40:57,767 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-14 18:40:57,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 18:40:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-14 18:40:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-14 18:40:57,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:40:57,771 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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:40:57,771 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:40:57,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:40:57,771 INFO L82 PathProgramCache]: Analyzing trace with hash 710962477, now seen corresponding path program 4 times [2018-10-14 18:40:57,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:40:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:40:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:40:58,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:40:58,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 18:40:58,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 18:40:58,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 18:40:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-10-14 18:40:58,801 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 16 states. [2018-10-14 18:40:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:40:59,876 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-14 18:40:59,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 18:40:59,877 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 161 [2018-10-14 18:40:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:40:59,878 INFO L225 Difference]: With dead ends: 216 [2018-10-14 18:40:59,879 INFO L226 Difference]: Without dead ends: 216 [2018-10-14 18:40:59,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:40:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-14 18:40:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2018-10-14 18:40:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-14 18:40:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-14 18:40:59,890 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 161 [2018-10-14 18:40:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:40:59,891 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-14 18:40:59,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 18:40:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-14 18:40:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-14 18:40:59,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:40:59,894 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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:40:59,894 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:40:59,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:40:59,895 INFO L82 PathProgramCache]: Analyzing trace with hash -413479491, now seen corresponding path program 5 times [2018-10-14 18:40:59,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:40:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:00,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:00,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 18:41:00,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 18:41:00,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 18:41:00,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-10-14 18:41:00,533 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 17 states. [2018-10-14 18:41:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:01,720 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-14 18:41:01,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 18:41:01,721 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 189 [2018-10-14 18:41:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:01,723 INFO L225 Difference]: With dead ends: 244 [2018-10-14 18:41:01,723 INFO L226 Difference]: Without dead ends: 244 [2018-10-14 18:41:01,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2018-10-14 18:41:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-14 18:41:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 218. [2018-10-14 18:41:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-14 18:41:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-14 18:41:01,733 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 189 [2018-10-14 18:41:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:01,733 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-14 18:41:01,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 18:41:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-14 18:41:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-14 18:41:01,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:01,738 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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:41:01,738 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:01,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash -67783091, now seen corresponding path program 6 times [2018-10-14 18:41:01,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:02,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:02,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 18:41:02,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 18:41:02,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 18:41:02,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-10-14 18:41:02,597 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 18 states. [2018-10-14 18:41:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:03,835 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-14 18:41:03,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 18:41:03,836 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 217 [2018-10-14 18:41:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:03,837 INFO L225 Difference]: With dead ends: 272 [2018-10-14 18:41:03,838 INFO L226 Difference]: Without dead ends: 272 [2018-10-14 18:41:03,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:41:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-14 18:41:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 246. [2018-10-14 18:41:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-14 18:41:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-14 18:41:03,846 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 217 [2018-10-14 18:41:03,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:03,847 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-14 18:41:03,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 18:41:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-14 18:41:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-14 18:41:03,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:03,851 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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:41:03,851 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:03,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash 697640669, now seen corresponding path program 7 times [2018-10-14 18:41:03,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:04,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:04,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 18:41:04,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 18:41:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 18:41:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-10-14 18:41:04,650 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 19 states. [2018-10-14 18:41:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:06,325 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-10-14 18:41:06,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-14 18:41:06,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 245 [2018-10-14 18:41:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:06,329 INFO L225 Difference]: With dead ends: 300 [2018-10-14 18:41:06,330 INFO L226 Difference]: Without dead ends: 300 [2018-10-14 18:41:06,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 18:41:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-14 18:41:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 274. [2018-10-14 18:41:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-14 18:41:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2018-10-14 18:41:06,337 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 245 [2018-10-14 18:41:06,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:06,337 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2018-10-14 18:41:06,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 18:41:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2018-10-14 18:41:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-14 18:41:06,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:06,340 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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:41:06,340 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:06,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:06,340 INFO L82 PathProgramCache]: Analyzing trace with hash -207806611, now seen corresponding path program 8 times [2018-10-14 18:41:06,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:07,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:07,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 18:41:07,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 18:41:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 18:41:07,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-10-14 18:41:07,648 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 20 states. [2018-10-14 18:41:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:09,725 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-14 18:41:09,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-14 18:41:09,726 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 273 [2018-10-14 18:41:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:09,728 INFO L225 Difference]: With dead ends: 328 [2018-10-14 18:41:09,729 INFO L226 Difference]: Without dead ends: 328 [2018-10-14 18:41:09,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=949, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:41:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-14 18:41:09,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 302. [2018-10-14 18:41:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-14 18:41:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-14 18:41:09,735 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 273 [2018-10-14 18:41:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:09,736 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-14 18:41:09,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 18:41:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-14 18:41:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-14 18:41:09,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:09,738 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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:41:09,738 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:09,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1619943427, now seen corresponding path program 9 times [2018-10-14 18:41:09,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 0 proven. 1206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:10,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:10,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 18:41:10,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 18:41:10,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 18:41:10,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-10-14 18:41:10,828 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 21 states. [2018-10-14 18:41:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:12,896 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2018-10-14 18:41:12,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 18:41:12,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 301 [2018-10-14 18:41:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:12,900 INFO L225 Difference]: With dead ends: 356 [2018-10-14 18:41:12,900 INFO L226 Difference]: Without dead ends: 356 [2018-10-14 18:41:12,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 18:41:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-14 18:41:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 330. [2018-10-14 18:41:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-14 18:41:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-10-14 18:41:12,908 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 301 [2018-10-14 18:41:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:12,909 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-10-14 18:41:12,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 18:41:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-10-14 18:41:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-14 18:41:12,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:12,911 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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:41:12,911 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:12,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash 880191629, now seen corresponding path program 10 times [2018-10-14 18:41:12,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 0 proven. 1480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:13,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:13,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 18:41:13,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 18:41:13,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 18:41:13,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:41:13,962 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 22 states. [2018-10-14 18:41:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:16,263 INFO L93 Difference]: Finished difference Result 384 states and 384 transitions. [2018-10-14 18:41:16,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 18:41:16,263 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 329 [2018-10-14 18:41:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:16,267 INFO L225 Difference]: With dead ends: 384 [2018-10-14 18:41:16,267 INFO L226 Difference]: Without dead ends: 384 [2018-10-14 18:41:16,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1209, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:41:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-14 18:41:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 358. [2018-10-14 18:41:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-10-14 18:41:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-10-14 18:41:16,275 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 329 [2018-10-14 18:41:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:16,275 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-10-14 18:41:16,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 18:41:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-10-14 18:41:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-10-14 18:41:16,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:16,278 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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:41:16,278 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:16,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:16,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2081437981, now seen corresponding path program 11 times [2018-10-14 18:41:16,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:17,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:17,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 18:41:17,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 18:41:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 18:41:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:41:17,574 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 23 states. [2018-10-14 18:41:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:20,123 INFO L93 Difference]: Finished difference Result 412 states and 412 transitions. [2018-10-14 18:41:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-14 18:41:20,124 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 357 [2018-10-14 18:41:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:20,127 INFO L225 Difference]: With dead ends: 412 [2018-10-14 18:41:20,128 INFO L226 Difference]: Without dead ends: 412 [2018-10-14 18:41:20,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 18:41:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-14 18:41:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 386. [2018-10-14 18:41:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-14 18:41:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-10-14 18:41:20,136 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 357 [2018-10-14 18:41:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:20,137 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-10-14 18:41:20,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 18:41:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-10-14 18:41:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-14 18:41:20,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:20,140 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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:41:20,140 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:20,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash 27414957, now seen corresponding path program 12 times [2018-10-14 18:41:20,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 2112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:21,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:21,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 18:41:21,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 18:41:21,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 18:41:21,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:41:21,667 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 24 states. [2018-10-14 18:41:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:24,596 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2018-10-14 18:41:24,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 18:41:24,596 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 385 [2018-10-14 18:41:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:24,599 INFO L225 Difference]: With dead ends: 440 [2018-10-14 18:41:24,599 INFO L226 Difference]: Without dead ends: 440 [2018-10-14 18:41:24,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:41:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-14 18:41:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 414. [2018-10-14 18:41:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-14 18:41:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 414 transitions. [2018-10-14 18:41:24,608 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 414 transitions. Word has length 385 [2018-10-14 18:41:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:24,609 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 414 transitions. [2018-10-14 18:41:24,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 18:41:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 414 transitions. [2018-10-14 18:41:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-14 18:41:24,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:24,612 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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:41:24,612 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:24,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash 311489085, now seen corresponding path program 13 times [2018-10-14 18:41:24,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:25,264 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-14 18:41:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 0 proven. 2470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:26,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:26,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 18:41:26,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 18:41:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 18:41:26,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-10-14 18:41:26,476 INFO L87 Difference]: Start difference. First operand 414 states and 414 transitions. Second operand 25 states. [2018-10-14 18:41:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:29,970 INFO L93 Difference]: Finished difference Result 468 states and 468 transitions. [2018-10-14 18:41:29,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 18:41:29,970 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 413 [2018-10-14 18:41:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:29,974 INFO L225 Difference]: With dead ends: 468 [2018-10-14 18:41:29,974 INFO L226 Difference]: Without dead ends: 468 [2018-10-14 18:41:29,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=321, Invalid=1659, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 18:41:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-14 18:41:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 442. [2018-10-14 18:41:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-10-14 18:41:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 442 transitions. [2018-10-14 18:41:29,982 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 442 transitions. Word has length 413 [2018-10-14 18:41:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:29,982 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 442 transitions. [2018-10-14 18:41:29,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 18:41:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 442 transitions. [2018-10-14 18:41:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-10-14 18:41:29,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:29,985 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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:41:29,986 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:29,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1103095091, now seen corresponding path program 14 times [2018-10-14 18:41:29,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 0 proven. 2856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:31,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:31,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 18:41:31,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 18:41:31,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 18:41:31,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2018-10-14 18:41:31,618 INFO L87 Difference]: Start difference. First operand 442 states and 442 transitions. Second operand 26 states. [2018-10-14 18:41:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:35,347 INFO L93 Difference]: Finished difference Result 496 states and 496 transitions. [2018-10-14 18:41:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-14 18:41:35,348 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 441 [2018-10-14 18:41:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:35,352 INFO L225 Difference]: With dead ends: 496 [2018-10-14 18:41:35,352 INFO L226 Difference]: Without dead ends: 496 [2018-10-14 18:41:35,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=337, Invalid=1825, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:41:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-10-14 18:41:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 470. [2018-10-14 18:41:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-14 18:41:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 470 transitions. [2018-10-14 18:41:35,360 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 470 transitions. Word has length 441 [2018-10-14 18:41:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:35,361 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 470 transitions. [2018-10-14 18:41:35,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 18:41:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 470 transitions. [2018-10-14 18:41:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-14 18:41:35,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:35,364 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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:41:35,364 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:35,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:35,365 INFO L82 PathProgramCache]: Analyzing trace with hash -703345827, now seen corresponding path program 15 times [2018-10-14 18:41:35,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:37,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:37,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 18:41:37,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 18:41:37,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 18:41:37,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:41:37,654 INFO L87 Difference]: Start difference. First operand 470 states and 470 transitions. Second operand 27 states. [2018-10-14 18:41:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:41,492 INFO L93 Difference]: Finished difference Result 524 states and 524 transitions. [2018-10-14 18:41:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 18:41:41,492 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 469 [2018-10-14 18:41:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:41,496 INFO L225 Difference]: With dead ends: 524 [2018-10-14 18:41:41,496 INFO L226 Difference]: Without dead ends: 524 [2018-10-14 18:41:41,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=353, Invalid=1999, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:41:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-10-14 18:41:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 498. [2018-10-14 18:41:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-10-14 18:41:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 498 transitions. [2018-10-14 18:41:41,504 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 498 transitions. Word has length 469 [2018-10-14 18:41:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:41,505 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 498 transitions. [2018-10-14 18:41:41,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 18:41:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 498 transitions. [2018-10-14 18:41:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-10-14 18:41:41,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:41,509 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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:41:41,509 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:41,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:41,510 INFO L82 PathProgramCache]: Analyzing trace with hash -311426067, now seen corresponding path program 16 times [2018-10-14 18:41:41,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3712 backedges. 0 proven. 3712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:44,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:44,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 18:41:44,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 18:41:44,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 18:41:44,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-10-14 18:41:44,226 INFO L87 Difference]: Start difference. First operand 498 states and 498 transitions. Second operand 28 states. [2018-10-14 18:41:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:48,899 INFO L93 Difference]: Finished difference Result 552 states and 552 transitions. [2018-10-14 18:41:48,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 18:41:48,899 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 497 [2018-10-14 18:41:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:48,902 INFO L225 Difference]: With dead ends: 552 [2018-10-14 18:41:48,903 INFO L226 Difference]: Without dead ends: 552 [2018-10-14 18:41:48,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=369, Invalid=2181, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:41:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-14 18:41:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 526. [2018-10-14 18:41:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-10-14 18:41:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 526 transitions. [2018-10-14 18:41:48,912 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 526 transitions. Word has length 497 [2018-10-14 18:41:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:48,912 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 526 transitions. [2018-10-14 18:41:48,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 18:41:48,912 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 526 transitions. [2018-10-14 18:41:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2018-10-14 18:41:48,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:48,916 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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:41:48,916 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:48,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1505281149, now seen corresponding path program 17 times [2018-10-14 18:41:48,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:50,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:50,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 18:41:50,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 18:41:50,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 18:41:50,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-10-14 18:41:50,985 INFO L87 Difference]: Start difference. First operand 526 states and 526 transitions. Second operand 29 states. [2018-10-14 18:41:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:41:55,730 INFO L93 Difference]: Finished difference Result 580 states and 580 transitions. [2018-10-14 18:41:55,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 18:41:55,730 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 525 [2018-10-14 18:41:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:41:55,732 INFO L225 Difference]: With dead ends: 580 [2018-10-14 18:41:55,733 INFO L226 Difference]: Without dead ends: 580 [2018-10-14 18:41:55,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=385, Invalid=2371, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 18:41:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-10-14 18:41:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 554. [2018-10-14 18:41:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-14 18:41:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 554 transitions. [2018-10-14 18:41:55,740 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 554 transitions. Word has length 525 [2018-10-14 18:41:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:41:55,741 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 554 transitions. [2018-10-14 18:41:55,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 18:41:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 554 transitions. [2018-10-14 18:41:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-10-14 18:41:55,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:41:55,745 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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:41:55,746 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:41:55,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:41:55,746 INFO L82 PathProgramCache]: Analyzing trace with hash 844238093, now seen corresponding path program 18 times [2018-10-14 18:41:55,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:41:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:41:56,865 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-14 18:41:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4680 backedges. 0 proven. 4680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:41:58,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:41:58,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 18:41:58,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 18:41:58,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 18:41:58,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2018-10-14 18:41:58,593 INFO L87 Difference]: Start difference. First operand 554 states and 554 transitions. Second operand 30 states. [2018-10-14 18:42:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:03,734 INFO L93 Difference]: Finished difference Result 608 states and 608 transitions. [2018-10-14 18:42:03,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 18:42:03,734 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 553 [2018-10-14 18:42:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:03,737 INFO L225 Difference]: With dead ends: 608 [2018-10-14 18:42:03,737 INFO L226 Difference]: Without dead ends: 608 [2018-10-14 18:42:03,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=401, Invalid=2569, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 18:42:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-14 18:42:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 582. [2018-10-14 18:42:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-10-14 18:42:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 582 transitions. [2018-10-14 18:42:03,746 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 582 transitions. Word has length 553 [2018-10-14 18:42:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:03,747 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 582 transitions. [2018-10-14 18:42:03,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 18:42:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 582 transitions. [2018-10-14 18:42:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2018-10-14 18:42:03,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:03,751 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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:42:03,752 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:03,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1352654237, now seen corresponding path program 19 times [2018-10-14 18:42:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:04,982 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-14 18:42:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5206 backedges. 0 proven. 5206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:06,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:06,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 18:42:06,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 18:42:06,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 18:42:06,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:42:06,528 INFO L87 Difference]: Start difference. First operand 582 states and 582 transitions. Second operand 31 states. [2018-10-14 18:42:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:12,062 INFO L93 Difference]: Finished difference Result 636 states and 636 transitions. [2018-10-14 18:42:12,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 18:42:12,063 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 581 [2018-10-14 18:42:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:12,065 INFO L225 Difference]: With dead ends: 636 [2018-10-14 18:42:12,065 INFO L226 Difference]: Without dead ends: 636 [2018-10-14 18:42:12,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=417, Invalid=2775, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 18:42:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-10-14 18:42:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 610. [2018-10-14 18:42:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-14 18:42:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 610 transitions. [2018-10-14 18:42:12,074 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 610 transitions. Word has length 581 [2018-10-14 18:42:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:12,074 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 610 transitions. [2018-10-14 18:42:12,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 18:42:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 610 transitions. [2018-10-14 18:42:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-14 18:42:12,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:12,079 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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:42:12,079 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:12,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1342584365, now seen corresponding path program 20 times [2018-10-14 18:42:12,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5760 backedges. 0 proven. 5760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:14,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:14,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 18:42:14,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 18:42:14,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 18:42:14,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-10-14 18:42:14,424 INFO L87 Difference]: Start difference. First operand 610 states and 610 transitions. Second operand 32 states. [2018-10-14 18:42:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:20,445 INFO L93 Difference]: Finished difference Result 664 states and 664 transitions. [2018-10-14 18:42:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 18:42:20,445 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 609 [2018-10-14 18:42:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:20,448 INFO L225 Difference]: With dead ends: 664 [2018-10-14 18:42:20,448 INFO L226 Difference]: Without dead ends: 664 [2018-10-14 18:42:20,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=433, Invalid=2989, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 18:42:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-10-14 18:42:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 638. [2018-10-14 18:42:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-10-14 18:42:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 638 transitions. [2018-10-14 18:42:20,457 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 638 transitions. Word has length 609 [2018-10-14 18:42:20,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:20,458 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 638 transitions. [2018-10-14 18:42:20,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 18:42:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 638 transitions. [2018-10-14 18:42:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2018-10-14 18:42:20,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:20,463 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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:42:20,463 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:20,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1914104131, now seen corresponding path program 21 times [2018-10-14 18:42:20,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6342 backedges. 0 proven. 6342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:23,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:23,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 18:42:23,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 18:42:23,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 18:42:23,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 18:42:23,338 INFO L87 Difference]: Start difference. First operand 638 states and 638 transitions. Second operand 33 states. [2018-10-14 18:42:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:29,986 INFO L93 Difference]: Finished difference Result 692 states and 692 transitions. [2018-10-14 18:42:29,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 18:42:29,989 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 637 [2018-10-14 18:42:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:29,991 INFO L225 Difference]: With dead ends: 692 [2018-10-14 18:42:29,991 INFO L226 Difference]: Without dead ends: 692 [2018-10-14 18:42:29,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=449, Invalid=3211, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 18:42:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-10-14 18:42:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 666. [2018-10-14 18:42:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-10-14 18:42:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 666 transitions. [2018-10-14 18:42:30,000 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 666 transitions. Word has length 637 [2018-10-14 18:42:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:30,001 INFO L481 AbstractCegarLoop]: Abstraction has 666 states and 666 transitions. [2018-10-14 18:42:30,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 18:42:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 666 transitions. [2018-10-14 18:42:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2018-10-14 18:42:30,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:30,007 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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:42:30,008 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:30,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash 699170637, now seen corresponding path program 22 times [2018-10-14 18:42:30,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6952 backedges. 0 proven. 6952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:32,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:32,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 18:42:32,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 18:42:32,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 18:42:32,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 18:42:32,858 INFO L87 Difference]: Start difference. First operand 666 states and 666 transitions. Second operand 34 states. [2018-10-14 18:42:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:39,880 INFO L93 Difference]: Finished difference Result 720 states and 720 transitions. [2018-10-14 18:42:39,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 18:42:39,880 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 665 [2018-10-14 18:42:39,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:39,883 INFO L225 Difference]: With dead ends: 720 [2018-10-14 18:42:39,883 INFO L226 Difference]: Without dead ends: 720 [2018-10-14 18:42:39,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=465, Invalid=3441, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 18:42:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-14 18:42:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 694. [2018-10-14 18:42:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-14 18:42:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 694 transitions. [2018-10-14 18:42:39,892 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 694 transitions. Word has length 665 [2018-10-14 18:42:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:39,893 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 694 transitions. [2018-10-14 18:42:39,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 18:42:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 694 transitions. [2018-10-14 18:42:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2018-10-14 18:42:39,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:39,898 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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:42:39,899 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:39,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash 78933981, now seen corresponding path program 23 times [2018-10-14 18:42:39,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:43,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:43,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 18:42:43,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 18:42:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 18:42:43,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:42:43,113 INFO L87 Difference]: Start difference. First operand 694 states and 694 transitions. Second operand 35 states. [2018-10-14 18:42:50,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:42:50,792 INFO L93 Difference]: Finished difference Result 748 states and 748 transitions. [2018-10-14 18:42:50,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 18:42:50,792 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 693 [2018-10-14 18:42:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:42:50,795 INFO L225 Difference]: With dead ends: 748 [2018-10-14 18:42:50,795 INFO L226 Difference]: Without dead ends: 748 [2018-10-14 18:42:50,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=481, Invalid=3679, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 18:42:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-14 18:42:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 722. [2018-10-14 18:42:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-10-14 18:42:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 722 transitions. [2018-10-14 18:42:50,805 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 722 transitions. Word has length 693 [2018-10-14 18:42:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:42:50,805 INFO L481 AbstractCegarLoop]: Abstraction has 722 states and 722 transitions. [2018-10-14 18:42:50,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 18:42:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 722 transitions. [2018-10-14 18:42:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2018-10-14 18:42:50,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:42:50,811 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 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:42:50,812 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:42:50,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:42:50,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1033574291, now seen corresponding path program 24 times [2018-10-14 18:42:50,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:42:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:42:52,179 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 18:42:52,475 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-14 18:42:52,925 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-14 18:42:53,254 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-14 18:42:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:42:56,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:42:56,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 18:42:56,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 18:42:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 18:42:56,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 18:42:56,209 INFO L87 Difference]: Start difference. First operand 722 states and 722 transitions. Second operand 36 states. [2018-10-14 18:43:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:04,321 INFO L93 Difference]: Finished difference Result 776 states and 776 transitions. [2018-10-14 18:43:04,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 18:43:04,321 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 721 [2018-10-14 18:43:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:04,324 INFO L225 Difference]: With dead ends: 776 [2018-10-14 18:43:04,324 INFO L226 Difference]: Without dead ends: 776 [2018-10-14 18:43:04,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=497, Invalid=3925, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:43:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-10-14 18:43:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 750. [2018-10-14 18:43:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-10-14 18:43:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 750 transitions. [2018-10-14 18:43:04,332 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 750 transitions. Word has length 721 [2018-10-14 18:43:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:04,333 INFO L481 AbstractCegarLoop]: Abstraction has 750 states and 750 transitions. [2018-10-14 18:43:04,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 18:43:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 750 transitions. [2018-10-14 18:43:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-14 18:43:04,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:04,339 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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:43:04,340 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:04,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:04,340 INFO L82 PathProgramCache]: Analyzing trace with hash -937301763, now seen corresponding path program 25 times [2018-10-14 18:43:04,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8950 backedges. 0 proven. 8950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:07,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:07,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 18:43:07,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 18:43:07,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 18:43:07,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 18:43:07,741 INFO L87 Difference]: Start difference. First operand 750 states and 750 transitions. Second operand 37 states. [2018-10-14 18:43:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:16,614 INFO L93 Difference]: Finished difference Result 804 states and 804 transitions. [2018-10-14 18:43:16,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 18:43:16,614 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 749 [2018-10-14 18:43:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:16,617 INFO L225 Difference]: With dead ends: 804 [2018-10-14 18:43:16,617 INFO L226 Difference]: Without dead ends: 804 [2018-10-14 18:43:16,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=513, Invalid=4179, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 18:43:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-14 18:43:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 778. [2018-10-14 18:43:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-10-14 18:43:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 778 transitions. [2018-10-14 18:43:16,626 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 778 transitions. Word has length 749 [2018-10-14 18:43:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:16,627 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 778 transitions. [2018-10-14 18:43:16,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 18:43:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 778 transitions. [2018-10-14 18:43:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2018-10-14 18:43:16,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:16,633 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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:43:16,634 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:16,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1028616589, now seen corresponding path program 26 times [2018-10-14 18:43:16,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9672 backedges. 0 proven. 9672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:20,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:20,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 18:43:20,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 18:43:20,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 18:43:20,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 18:43:20,830 INFO L87 Difference]: Start difference. First operand 778 states and 778 transitions. Second operand 38 states. [2018-10-14 18:43:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:30,166 INFO L93 Difference]: Finished difference Result 832 states and 832 transitions. [2018-10-14 18:43:30,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 18:43:30,166 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 777 [2018-10-14 18:43:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:30,169 INFO L225 Difference]: With dead ends: 832 [2018-10-14 18:43:30,169 INFO L226 Difference]: Without dead ends: 832 [2018-10-14 18:43:30,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=529, Invalid=4441, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 18:43:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2018-10-14 18:43:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 806. [2018-10-14 18:43:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-14 18:43:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 806 transitions. [2018-10-14 18:43:30,177 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 806 transitions. Word has length 777 [2018-10-14 18:43:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:30,178 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 806 transitions. [2018-10-14 18:43:30,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 18:43:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 806 transitions. [2018-10-14 18:43:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2018-10-14 18:43:30,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:30,185 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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:43:30,185 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:30,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash 189891101, now seen corresponding path program 27 times [2018-10-14 18:43:30,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:30,958 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-14 18:43:31,174 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-14 18:43:31,649 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 18:43:31,938 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-14 18:43:32,390 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-14 18:43:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10422 backedges. 0 proven. 10422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:36,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:36,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 18:43:36,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 18:43:36,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 18:43:36,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1340, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:43:36,030 INFO L87 Difference]: Start difference. First operand 806 states and 806 transitions. Second operand 39 states. [2018-10-14 18:43:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:43:46,095 INFO L93 Difference]: Finished difference Result 860 states and 860 transitions. [2018-10-14 18:43:46,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 18:43:46,095 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 805 [2018-10-14 18:43:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:43:46,098 INFO L225 Difference]: With dead ends: 860 [2018-10-14 18:43:46,099 INFO L226 Difference]: Without dead ends: 860 [2018-10-14 18:43:46,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=545, Invalid=4711, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 18:43:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-10-14 18:43:46,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 834. [2018-10-14 18:43:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-10-14 18:43:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 834 transitions. [2018-10-14 18:43:46,106 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 834 transitions. Word has length 805 [2018-10-14 18:43:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:43:46,106 INFO L481 AbstractCegarLoop]: Abstraction has 834 states and 834 transitions. [2018-10-14 18:43:46,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 18:43:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 834 transitions. [2018-10-14 18:43:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2018-10-14 18:43:46,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:43:46,113 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 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:43:46,114 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:43:46,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:43:46,114 INFO L82 PathProgramCache]: Analyzing trace with hash -578020691, now seen corresponding path program 28 times [2018-10-14 18:43:46,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:43:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:43:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11200 backedges. 0 proven. 11200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:43:50,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:43:50,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 18:43:50,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 18:43:50,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 18:43:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1414, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 18:43:50,541 INFO L87 Difference]: Start difference. First operand 834 states and 834 transitions. Second operand 40 states. [2018-10-14 18:44:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:44:01,164 INFO L93 Difference]: Finished difference Result 888 states and 888 transitions. [2018-10-14 18:44:01,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 18:44:01,164 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 833 [2018-10-14 18:44:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:44:01,167 INFO L225 Difference]: With dead ends: 888 [2018-10-14 18:44:01,167 INFO L226 Difference]: Without dead ends: 888 [2018-10-14 18:44:01,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=561, Invalid=4989, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 18:44:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-10-14 18:44:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 862. [2018-10-14 18:44:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-10-14 18:44:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 862 transitions. [2018-10-14 18:44:01,176 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 862 transitions. Word has length 833 [2018-10-14 18:44:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:44:01,176 INFO L481 AbstractCegarLoop]: Abstraction has 862 states and 862 transitions. [2018-10-14 18:44:01,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 18:44:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 862 transitions. [2018-10-14 18:44:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2018-10-14 18:44:01,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:44:01,184 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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:44:01,184 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:44:01,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:44:01,185 INFO L82 PathProgramCache]: Analyzing trace with hash 560151357, now seen corresponding path program 29 times [2018-10-14 18:44:01,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:44:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:44:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:44:05,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:44:05,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 18:44:05,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 18:44:05,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 18:44:05,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 18:44:05,661 INFO L87 Difference]: Start difference. First operand 862 states and 862 transitions. Second operand 41 states. [2018-10-14 18:44:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:44:16,866 INFO L93 Difference]: Finished difference Result 916 states and 916 transitions. [2018-10-14 18:44:16,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-14 18:44:16,866 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 861 [2018-10-14 18:44:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:44:16,870 INFO L225 Difference]: With dead ends: 916 [2018-10-14 18:44:16,870 INFO L226 Difference]: Without dead ends: 916 [2018-10-14 18:44:16,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=577, Invalid=5275, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 18:44:16,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-10-14 18:44:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 890. [2018-10-14 18:44:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-10-14 18:44:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 890 transitions. [2018-10-14 18:44:16,878 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 890 transitions. Word has length 861 [2018-10-14 18:44:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:44:16,879 INFO L481 AbstractCegarLoop]: Abstraction has 890 states and 890 transitions. [2018-10-14 18:44:16,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 18:44:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 890 transitions. [2018-10-14 18:44:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 890 [2018-10-14 18:44:16,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:44:16,887 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 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:44:16,887 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:44:16,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:44:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash 104522701, now seen corresponding path program 30 times [2018-10-14 18:44:16,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:44:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:44:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12840 backedges. 0 proven. 12840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:44:21,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:44:21,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 18:44:21,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 18:44:21,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 18:44:21,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1568, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 18:44:21,388 INFO L87 Difference]: Start difference. First operand 890 states and 890 transitions. Second operand 42 states. [2018-10-14 18:44:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:44:33,250 INFO L93 Difference]: Finished difference Result 944 states and 944 transitions. [2018-10-14 18:44:33,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 18:44:33,250 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 889 [2018-10-14 18:44:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:44:33,254 INFO L225 Difference]: With dead ends: 944 [2018-10-14 18:44:33,254 INFO L226 Difference]: Without dead ends: 944 [2018-10-14 18:44:33,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=593, Invalid=5569, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 18:44:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-10-14 18:44:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 918. [2018-10-14 18:44:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2018-10-14 18:44:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 918 transitions. [2018-10-14 18:44:33,262 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 918 transitions. Word has length 889 [2018-10-14 18:44:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:44:33,263 INFO L481 AbstractCegarLoop]: Abstraction has 918 states and 918 transitions. [2018-10-14 18:44:33,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 18:44:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 918 transitions. [2018-10-14 18:44:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2018-10-14 18:44:33,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:44:33,270 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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:44:33,270 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:44:33,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:44:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2104955997, now seen corresponding path program 31 times [2018-10-14 18:44:33,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:44:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:44:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13702 backedges. 0 proven. 13702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:44:38,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:44:38,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 18:44:38,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 18:44:38,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 18:44:38,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1648, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:44:38,118 INFO L87 Difference]: Start difference. First operand 918 states and 918 transitions. Second operand 43 states. [2018-10-14 18:44:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:44:50,849 INFO L93 Difference]: Finished difference Result 972 states and 972 transitions. [2018-10-14 18:44:50,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 18:44:50,855 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 917 [2018-10-14 18:44:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:44:50,859 INFO L225 Difference]: With dead ends: 972 [2018-10-14 18:44:50,859 INFO L226 Difference]: Without dead ends: 972 [2018-10-14 18:44:50,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=609, Invalid=5871, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 18:44:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2018-10-14 18:44:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 946. [2018-10-14 18:44:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-10-14 18:44:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 946 transitions. [2018-10-14 18:44:50,869 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 946 transitions. Word has length 917 [2018-10-14 18:44:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:44:50,870 INFO L481 AbstractCegarLoop]: Abstraction has 946 states and 946 transitions. [2018-10-14 18:44:50,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 18:44:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 946 transitions. [2018-10-14 18:44:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2018-10-14 18:44:50,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:44:50,879 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 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:44:50,879 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:44:50,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:44:50,880 INFO L82 PathProgramCache]: Analyzing trace with hash 981191917, now seen corresponding path program 32 times [2018-10-14 18:44:50,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:44:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:44:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14592 backedges. 0 proven. 14592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:44:55,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:44:55,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 18:44:55,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 18:44:55,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 18:44:55,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1730, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:44:55,814 INFO L87 Difference]: Start difference. First operand 946 states and 946 transitions. Second operand 44 states. [2018-10-14 18:45:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:45:09,229 INFO L93 Difference]: Finished difference Result 1000 states and 1000 transitions. [2018-10-14 18:45:09,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-14 18:45:09,229 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 945 [2018-10-14 18:45:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:45:09,233 INFO L225 Difference]: With dead ends: 1000 [2018-10-14 18:45:09,233 INFO L226 Difference]: Without dead ends: 1000 [2018-10-14 18:45:09,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=625, Invalid=6181, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 18:45:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-10-14 18:45:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 974. [2018-10-14 18:45:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-10-14 18:45:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 974 transitions. [2018-10-14 18:45:09,241 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 974 transitions. Word has length 945 [2018-10-14 18:45:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:45:09,242 INFO L481 AbstractCegarLoop]: Abstraction has 974 states and 974 transitions. [2018-10-14 18:45:09,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 18:45:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 974 transitions. [2018-10-14 18:45:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 974 [2018-10-14 18:45:09,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:45:09,249 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 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:45:09,249 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:45:09,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:45:09,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1297281667, now seen corresponding path program 33 times [2018-10-14 18:45:09,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:45:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:45:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15510 backedges. 0 proven. 15510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:45:14,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:45:14,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 18:45:14,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 18:45:14,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 18:45:14,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1814, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 18:45:14,684 INFO L87 Difference]: Start difference. First operand 974 states and 974 transitions. Second operand 45 states. [2018-10-14 18:45:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:45:29,151 INFO L93 Difference]: Finished difference Result 1028 states and 1028 transitions. [2018-10-14 18:45:29,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 18:45:29,151 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 973 [2018-10-14 18:45:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:45:29,155 INFO L225 Difference]: With dead ends: 1028 [2018-10-14 18:45:29,155 INFO L226 Difference]: Without dead ends: 1028 [2018-10-14 18:45:29,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=641, Invalid=6499, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 18:45:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-10-14 18:45:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1002. [2018-10-14 18:45:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2018-10-14 18:45:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1002 transitions. [2018-10-14 18:45:29,163 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1002 transitions. Word has length 973 [2018-10-14 18:45:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:45:29,163 INFO L481 AbstractCegarLoop]: Abstraction has 1002 states and 1002 transitions. [2018-10-14 18:45:29,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 18:45:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1002 transitions. [2018-10-14 18:45:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2018-10-14 18:45:29,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:45:29,171 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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:45:29,171 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:45:29,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:45:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash 493803021, now seen corresponding path program 34 times [2018-10-14 18:45:29,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:45:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:45:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16456 backedges. 0 proven. 16456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:45:35,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:45:35,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 18:45:35,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 18:45:35,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 18:45:35,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1900, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 18:45:35,088 INFO L87 Difference]: Start difference. First operand 1002 states and 1002 transitions. Second operand 46 states. [2018-10-14 18:45:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:45:50,146 INFO L93 Difference]: Finished difference Result 1056 states and 1056 transitions. [2018-10-14 18:45:50,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 18:45:50,147 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1001 [2018-10-14 18:45:50,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:45:50,151 INFO L225 Difference]: With dead ends: 1056 [2018-10-14 18:45:50,152 INFO L226 Difference]: Without dead ends: 1056 [2018-10-14 18:45:50,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=657, Invalid=6825, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:45:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-10-14 18:45:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1030. [2018-10-14 18:45:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2018-10-14 18:45:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1030 transitions. [2018-10-14 18:45:50,161 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1030 transitions. Word has length 1001 [2018-10-14 18:45:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:45:50,161 INFO L481 AbstractCegarLoop]: Abstraction has 1030 states and 1030 transitions. [2018-10-14 18:45:50,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 18:45:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1030 transitions. [2018-10-14 18:45:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2018-10-14 18:45:50,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:45:50,169 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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:45:50,169 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:45:50,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:45:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1948591773, now seen corresponding path program 35 times [2018-10-14 18:45:50,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:45:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:45:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 17430 backedges. 0 proven. 17430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:45:56,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:45:56,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 18:45:56,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 18:45:56,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 18:45:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1988, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:45:56,489 INFO L87 Difference]: Start difference. First operand 1030 states and 1030 transitions. Second operand 47 states. [2018-10-14 18:46:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:46:12,219 INFO L93 Difference]: Finished difference Result 1084 states and 1084 transitions. [2018-10-14 18:46:12,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-14 18:46:12,219 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1029 [2018-10-14 18:46:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:46:12,223 INFO L225 Difference]: With dead ends: 1084 [2018-10-14 18:46:12,223 INFO L226 Difference]: Without dead ends: 1084 [2018-10-14 18:46:12,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=673, Invalid=7159, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 18:46:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2018-10-14 18:46:12,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1058. [2018-10-14 18:46:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2018-10-14 18:46:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1058 transitions. [2018-10-14 18:46:12,231 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1058 transitions. Word has length 1029 [2018-10-14 18:46:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:46:12,232 INFO L481 AbstractCegarLoop]: Abstraction has 1058 states and 1058 transitions. [2018-10-14 18:46:12,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 18:46:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1058 transitions. [2018-10-14 18:46:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2018-10-14 18:46:12,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:46:12,240 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 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:46:12,240 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:46:12,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:46:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1916010285, now seen corresponding path program 36 times [2018-10-14 18:46:12,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:46:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:46:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18432 backedges. 0 proven. 18432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:46:18,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:46:18,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 18:46:18,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 18:46:18,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 18:46:18,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2078, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 18:46:18,328 INFO L87 Difference]: Start difference. First operand 1058 states and 1058 transitions. Second operand 48 states. [2018-10-14 18:46:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:46:35,055 INFO L93 Difference]: Finished difference Result 1112 states and 1112 transitions. [2018-10-14 18:46:35,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 18:46:35,055 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1057 [2018-10-14 18:46:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:46:35,059 INFO L225 Difference]: With dead ends: 1112 [2018-10-14 18:46:35,059 INFO L226 Difference]: Without dead ends: 1112 [2018-10-14 18:46:35,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=689, Invalid=7501, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 18:46:35,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2018-10-14 18:46:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1086. [2018-10-14 18:46:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-10-14 18:46:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1086 transitions. [2018-10-14 18:46:35,068 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1086 transitions. Word has length 1057 [2018-10-14 18:46:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:46:35,068 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1086 transitions. [2018-10-14 18:46:35,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 18:46:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1086 transitions. [2018-10-14 18:46:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1086 [2018-10-14 18:46:35,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:46:35,078 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 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:46:35,078 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:46:35,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:46:35,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1795203139, now seen corresponding path program 37 times [2018-10-14 18:46:35,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:46:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:46:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 19462 backedges. 0 proven. 19462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:46:41,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:46:41,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 18:46:41,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 18:46:41,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 18:46:41,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2170, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:46:41,458 INFO L87 Difference]: Start difference. First operand 1086 states and 1086 transitions. Second operand 49 states. [2018-10-14 18:46:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:46:58,861 INFO L93 Difference]: Finished difference Result 1140 states and 1140 transitions. [2018-10-14 18:46:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 18:46:58,862 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1085 [2018-10-14 18:46:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:46:58,865 INFO L225 Difference]: With dead ends: 1140 [2018-10-14 18:46:58,865 INFO L226 Difference]: Without dead ends: 1140 [2018-10-14 18:46:58,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=705, Invalid=7851, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 18:46:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-10-14 18:46:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1114. [2018-10-14 18:46:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2018-10-14 18:46:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1114 transitions. [2018-10-14 18:46:58,874 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1114 transitions. Word has length 1085 [2018-10-14 18:46:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:46:58,874 INFO L481 AbstractCegarLoop]: Abstraction has 1114 states and 1114 transitions. [2018-10-14 18:46:58,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 18:46:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1114 transitions. [2018-10-14 18:46:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2018-10-14 18:46:58,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:46:58,883 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 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:46:58,883 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:46:58,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:46:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash 468404301, now seen corresponding path program 38 times [2018-10-14 18:46:58,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:46:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:47:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 20520 backedges. 0 proven. 20520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:47:05,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:47:05,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 18:47:05,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 18:47:05,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 18:47:05,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2264, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 18:47:05,439 INFO L87 Difference]: Start difference. First operand 1114 states and 1114 transitions. Second operand 50 states. [2018-10-14 18:47:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:47:23,502 INFO L93 Difference]: Finished difference Result 1168 states and 1168 transitions. [2018-10-14 18:47:23,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 18:47:23,503 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1113 [2018-10-14 18:47:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:47:23,506 INFO L225 Difference]: With dead ends: 1168 [2018-10-14 18:47:23,506 INFO L226 Difference]: Without dead ends: 1168 [2018-10-14 18:47:23,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=721, Invalid=8209, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 18:47:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-14 18:47:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1142. [2018-10-14 18:47:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2018-10-14 18:47:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1142 transitions. [2018-10-14 18:47:23,516 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1142 transitions. Word has length 1113 [2018-10-14 18:47:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:47:23,517 INFO L481 AbstractCegarLoop]: Abstraction has 1142 states and 1142 transitions. [2018-10-14 18:47:23,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 18:47:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1142 transitions. [2018-10-14 18:47:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2018-10-14 18:47:23,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:47:23,526 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:47:23,526 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:47:23,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:47:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash 140228829, now seen corresponding path program 39 times [2018-10-14 18:47:23,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:47:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:47:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21606 backedges. 0 proven. 21606 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:47:30,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:47:30,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 18:47:30,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 18:47:30,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 18:47:30,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2360, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:47:30,414 INFO L87 Difference]: Start difference. First operand 1142 states and 1142 transitions. Second operand 51 states. [2018-10-14 18:47:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:47:49,403 INFO L93 Difference]: Finished difference Result 1196 states and 1196 transitions. [2018-10-14 18:47:49,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 18:47:49,404 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1141 [2018-10-14 18:47:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:47:49,408 INFO L225 Difference]: With dead ends: 1196 [2018-10-14 18:47:49,408 INFO L226 Difference]: Without dead ends: 1196 [2018-10-14 18:47:49,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=737, Invalid=8575, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 18:47:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-10-14 18:47:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1170. [2018-10-14 18:47:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2018-10-14 18:47:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1170 transitions. [2018-10-14 18:47:49,417 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1170 transitions. Word has length 1141 [2018-10-14 18:47:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:47:49,417 INFO L481 AbstractCegarLoop]: Abstraction has 1170 states and 1170 transitions. [2018-10-14 18:47:49,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 18:47:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1170 transitions. [2018-10-14 18:47:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1170 [2018-10-14 18:47:49,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:47:49,427 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:47:49,427 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:47:49,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:47:49,428 INFO L82 PathProgramCache]: Analyzing trace with hash 498381165, now seen corresponding path program 40 times [2018-10-14 18:47:49,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:47:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:47:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 22720 backedges. 0 proven. 22720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:47:56,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:47:56,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 18:47:56,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 18:47:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 18:47:56,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2458, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 18:47:56,753 INFO L87 Difference]: Start difference. First operand 1170 states and 1170 transitions. Second operand 52 states. [2018-10-14 18:48:04,188 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-14 18:48:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:48:16,700 INFO L93 Difference]: Finished difference Result 1224 states and 1224 transitions. [2018-10-14 18:48:16,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 18:48:16,700 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1169 [2018-10-14 18:48:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:48:16,704 INFO L225 Difference]: With dead ends: 1224 [2018-10-14 18:48:16,704 INFO L226 Difference]: Without dead ends: 1224 [2018-10-14 18:48:16,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=753, Invalid=8949, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 18:48:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2018-10-14 18:48:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1198. [2018-10-14 18:48:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2018-10-14 18:48:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1198 transitions. [2018-10-14 18:48:16,713 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1198 transitions. Word has length 1169 [2018-10-14 18:48:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:48:16,714 INFO L481 AbstractCegarLoop]: Abstraction has 1198 states and 1198 transitions. [2018-10-14 18:48:16,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 18:48:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1198 transitions. [2018-10-14 18:48:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1198 [2018-10-14 18:48:16,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:48:16,724 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:48:16,724 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:48:16,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:48:16,724 INFO L82 PathProgramCache]: Analyzing trace with hash -514182659, now seen corresponding path program 41 times [2018-10-14 18:48:16,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:48:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:48:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 23862 backedges. 0 proven. 23862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:48:24,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:48:24,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 18:48:24,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 18:48:24,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 18:48:24,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 18:48:24,225 INFO L87 Difference]: Start difference. First operand 1198 states and 1198 transitions. Second operand 53 states. [2018-10-14 18:48:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:48:44,779 INFO L93 Difference]: Finished difference Result 1252 states and 1252 transitions. [2018-10-14 18:48:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 18:48:44,780 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1197 [2018-10-14 18:48:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:48:44,784 INFO L225 Difference]: With dead ends: 1252 [2018-10-14 18:48:44,784 INFO L226 Difference]: Without dead ends: 1252 [2018-10-14 18:48:44,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=769, Invalid=9331, Unknown=0, NotChecked=0, Total=10100 [2018-10-14 18:48:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-10-14 18:48:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1226. [2018-10-14 18:48:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-10-14 18:48:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1226 transitions. [2018-10-14 18:48:44,793 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1226 transitions. Word has length 1197 [2018-10-14 18:48:44,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:48:44,793 INFO L481 AbstractCegarLoop]: Abstraction has 1226 states and 1226 transitions. [2018-10-14 18:48:44,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 18:48:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1226 transitions. [2018-10-14 18:48:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1226 [2018-10-14 18:48:44,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:48:44,804 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:48:44,804 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:48:44,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:48:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1699726707, now seen corresponding path program 42 times [2018-10-14 18:48:44,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:48:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:48:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 25032 backedges. 0 proven. 25032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:48:52,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:48:52,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 18:48:52,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 18:48:52,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 18:48:52,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 18:48:52,699 INFO L87 Difference]: Start difference. First operand 1226 states and 1226 transitions. Second operand 54 states. [2018-10-14 18:49:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:49:14,459 INFO L93 Difference]: Finished difference Result 1280 states and 1280 transitions. [2018-10-14 18:49:14,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 18:49:14,460 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1225 [2018-10-14 18:49:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:49:14,464 INFO L225 Difference]: With dead ends: 1280 [2018-10-14 18:49:14,464 INFO L226 Difference]: Without dead ends: 1280 [2018-10-14 18:49:14,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=785, Invalid=9721, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 18:49:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2018-10-14 18:49:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1254. [2018-10-14 18:49:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-10-14 18:49:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1254 transitions. [2018-10-14 18:49:14,476 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1254 transitions. Word has length 1225 [2018-10-14 18:49:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:49:14,476 INFO L481 AbstractCegarLoop]: Abstraction has 1254 states and 1254 transitions. [2018-10-14 18:49:14,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 18:49:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1254 transitions. [2018-10-14 18:49:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1254 [2018-10-14 18:49:14,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:49:14,487 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:49:14,487 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:49:14,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:49:14,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1394264861, now seen corresponding path program 43 times [2018-10-14 18:49:14,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:49:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat