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/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 18:06:19,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 18:06:19,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 18:06:19,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 18:06:19,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 18:06:19,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 18:06:19,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 18:06:19,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 18:06:19,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 18:06:19,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 18:06:19,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 18:06:19,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 18:06:19,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 18:06:19,203 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 18:06:19,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 18:06:19,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 18:06:19,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 18:06:19,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 18:06:19,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 18:06:19,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 18:06:19,212 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 18:06:19,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 18:06:19,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 18:06:19,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 18:06:19,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 18:06:19,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 18:06:19,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 18:06:19,224 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 18:06:19,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 18:06:19,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 18:06:19,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 18:06:19,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 18:06:19,231 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 18:06:19,232 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 18:06:19,233 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 18:06:19,234 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 18:06:19,234 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:06:19,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 18:06:19,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 18:06:19,246 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 18:06:19,246 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 18:06:19,246 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 18:06:19,246 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 18:06:19,247 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 18:06:19,247 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 18:06:19,247 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 18:06:19,247 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 18:06:19,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 18:06:19,248 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 18:06:19,248 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 18:06:19,249 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 18:06:19,249 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 18:06:19,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 18:06:19,332 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 18:06:19,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 18:06:19,340 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 18:06:19,341 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 18:06:19,342 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl [2018-10-14 18:06:19,342 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl' [2018-10-14 18:06:19,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 18:06:19,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 18:06:19,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 18:06:19,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 18:06:19,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 18:06:19,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:19" (1/1) ... [2018-10-14 18:06:19,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:19" (1/1) ... [2018-10-14 18:06:19,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:19" (1/1) ... [2018-10-14 18:06:19,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:19" (1/1) ... [2018-10-14 18:06:19,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:19" (1/1) ... [2018-10-14 18:06:19,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:19" (1/1) ... [2018-10-14 18:06:19,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:19" (1/1) ... [2018-10-14 18:06:19,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 18:06:19,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 18:06:19,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 18:06:19,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 18:06:19,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 18:06:19,553 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 18:06:19,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 18:06:19,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 18:06:20,273 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 18:06:20,275 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:06:20 BoogieIcfgContainer [2018-10-14 18:06:20,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 18:06:20,275 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 18:06:20,276 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 18:06:20,277 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 18:06:20,281 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:06:20" (1/1) ... [2018-10-14 18:06:20,290 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 18:06:20,291 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 18:06:20,337 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 18:06:20,429 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 18:06:20,456 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 18:06:20,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 18:07:18,283 INFO L315 AbstractInterpreter]: Visited 110 different actions 480 times. Merged at 91 different actions 357 times. Widened at 6 different actions 9 times. Found 11 fixpoints after 6 different actions. Largest state had 0 variables. [2018-10-14 18:07:18,290 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 18:07:18,296 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 18:07:18,354 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-14 18:07:18,363 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:07:18,364 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:07:18,367 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_13|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:07:18,367 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_13|) |v_ULTIMATE.start_read~int_#ptr.offset_9|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:07:18,392 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_4_1_1| |v_ULTIMATE.start_write~int_#ptr.base_12|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-14 18:07:18,394 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 18:07:18,395 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:07:18,395 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:07:18,395 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:18,395 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:18,395 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:07:18,395 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:18,395 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:18,396 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:07:18,396 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:07:18,396 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:18,396 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:18,397 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:07:18,397 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:18,397 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:18,398 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 18:07:18,423 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:07:18 BasicIcfg [2018-10-14 18:07:18,423 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 18:07:18,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 18:07:18,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 18:07:18,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 18:07:18,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:19" (1/3) ... [2018-10-14 18:07:18,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128cf69 and model type ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:07:18, skipping insertion in model container [2018-10-14 18:07:18,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:06:20" (2/3) ... [2018-10-14 18:07:18,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128cf69 and model type ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:07:18, skipping insertion in model container [2018-10-14 18:07:18,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:07:18" (3/3) ... [2018-10-14 18:07:18,432 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 18:07:18,443 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 18:07:18,451 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 18:07:18,469 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 18:07:18,489 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 18:07:18,490 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 18:07:18,490 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 18:07:18,491 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 18:07:18,491 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 18:07:18,491 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 18:07:18,491 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 18:07:18,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 18:07:18,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 18:07:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-10-14 18:07:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-14 18:07:18,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:18,517 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, 1] [2018-10-14 18:07:18,518 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:18,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:18,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1384560059, now seen corresponding path program 1 times [2018-10-14 18:07:18,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:18,969 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:07:18,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:07:18,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-14 18:07:18,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 18:07:18,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 18:07:18,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 18:07:19,135 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 8 states. [2018-10-14 18:07:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:19,644 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2018-10-14 18:07:19,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 18:07:19,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-10-14 18:07:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:19,668 INFO L225 Difference]: With dead ends: 223 [2018-10-14 18:07:19,668 INFO L226 Difference]: Without dead ends: 223 [2018-10-14 18:07:19,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-14 18:07:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-14 18:07:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 155. [2018-10-14 18:07:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-14 18:07:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2018-10-14 18:07:19,757 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 50 [2018-10-14 18:07:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:19,758 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2018-10-14 18:07:19,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 18:07:19,758 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2018-10-14 18:07:19,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-14 18:07:19,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:19,769 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:19,770 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:19,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:19,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1647669911, now seen corresponding path program 1 times [2018-10-14 18:07:19,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:07:20,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:20,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 18:07:20,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 18:07:20,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 18:07:20,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 18:07:20,058 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand 8 states. [2018-10-14 18:07:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:20,763 INFO L93 Difference]: Finished difference Result 293 states and 298 transitions. [2018-10-14 18:07:20,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 18:07:20,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2018-10-14 18:07:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:20,771 INFO L225 Difference]: With dead ends: 293 [2018-10-14 18:07:20,771 INFO L226 Difference]: Without dead ends: 293 [2018-10-14 18:07:20,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-14 18:07:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-14 18:07:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 200. [2018-10-14 18:07:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-14 18:07:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 203 transitions. [2018-10-14 18:07:20,804 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 203 transitions. Word has length 104 [2018-10-14 18:07:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:20,804 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 203 transitions. [2018-10-14 18:07:20,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 18:07:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 203 transitions. [2018-10-14 18:07:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-14 18:07:20,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:20,812 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:20,813 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:20,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:20,813 INFO L82 PathProgramCache]: Analyzing trace with hash -961609495, now seen corresponding path program 1 times [2018-10-14 18:07:20,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:07:21,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:21,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 18:07:21,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 18:07:21,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 18:07:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-10-14 18:07:21,400 INFO L87 Difference]: Start difference. First operand 200 states and 203 transitions. Second operand 18 states. [2018-10-14 18:07:22,178 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-10-14 18:07:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:24,646 INFO L93 Difference]: Finished difference Result 448 states and 457 transitions. [2018-10-14 18:07:24,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 18:07:24,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-10-14 18:07:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:24,653 INFO L225 Difference]: With dead ends: 448 [2018-10-14 18:07:24,653 INFO L226 Difference]: Without dead ends: 448 [2018-10-14 18:07:24,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=811, Invalid=2611, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 18:07:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-14 18:07:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 233. [2018-10-14 18:07:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-14 18:07:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 238 transitions. [2018-10-14 18:07:24,675 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 238 transitions. Word has length 125 [2018-10-14 18:07:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:24,679 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 238 transitions. [2018-10-14 18:07:24,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 18:07:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 238 transitions. [2018-10-14 18:07:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-14 18:07:24,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:24,684 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:24,684 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:24,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:24,684 INFO L82 PathProgramCache]: Analyzing trace with hash -393191757, now seen corresponding path program 1 times [2018-10-14 18:07:24,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-14 18:07:24,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:24,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 18:07:24,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 18:07:24,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 18:07:24,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-14 18:07:24,871 INFO L87 Difference]: Start difference. First operand 233 states and 238 transitions. Second operand 11 states. [2018-10-14 18:07:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:25,826 INFO L93 Difference]: Finished difference Result 864 states and 885 transitions. [2018-10-14 18:07:25,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 18:07:25,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2018-10-14 18:07:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:25,832 INFO L225 Difference]: With dead ends: 864 [2018-10-14 18:07:25,832 INFO L226 Difference]: Without dead ends: 864 [2018-10-14 18:07:25,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:07:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-10-14 18:07:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 311. [2018-10-14 18:07:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-14 18:07:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 322 transitions. [2018-10-14 18:07:25,849 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 322 transitions. Word has length 139 [2018-10-14 18:07:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:25,849 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 322 transitions. [2018-10-14 18:07:25,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 18:07:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 322 transitions. [2018-10-14 18:07:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-14 18:07:25,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:25,853 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:07:25,853 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:25,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:25,854 INFO L82 PathProgramCache]: Analyzing trace with hash -151249119, now seen corresponding path program 2 times [2018-10-14 18:07:25,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-14 18:07:26,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:26,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 18:07:26,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 18:07:26,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 18:07:26,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:07:26,138 INFO L87 Difference]: Start difference. First operand 311 states and 322 transitions. Second operand 10 states. [2018-10-14 18:07:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:26,596 INFO L93 Difference]: Finished difference Result 357 states and 365 transitions. [2018-10-14 18:07:26,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 18:07:26,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 160 [2018-10-14 18:07:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:26,598 INFO L225 Difference]: With dead ends: 357 [2018-10-14 18:07:26,598 INFO L226 Difference]: Without dead ends: 357 [2018-10-14 18:07:26,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2018-10-14 18:07:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-14 18:07:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 279. [2018-10-14 18:07:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-14 18:07:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 287 transitions. [2018-10-14 18:07:26,607 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 287 transitions. Word has length 160 [2018-10-14 18:07:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:26,608 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 287 transitions. [2018-10-14 18:07:26,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 18:07:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 287 transitions. [2018-10-14 18:07:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-14 18:07:26,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:26,611 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:26,612 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:26,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash -800242117, now seen corresponding path program 2 times [2018-10-14 18:07:26,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 84 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 18:07:26,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:26,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 18:07:26,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 18:07:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 18:07:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:07:26,777 INFO L87 Difference]: Start difference. First operand 279 states and 287 transitions. Second operand 10 states. [2018-10-14 18:07:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:27,068 INFO L93 Difference]: Finished difference Result 383 states and 393 transitions. [2018-10-14 18:07:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 18:07:27,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2018-10-14 18:07:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:27,071 INFO L225 Difference]: With dead ends: 383 [2018-10-14 18:07:27,071 INFO L226 Difference]: Without dead ends: 383 [2018-10-14 18:07:27,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-14 18:07:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-14 18:07:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 279. [2018-10-14 18:07:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-14 18:07:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 286 transitions. [2018-10-14 18:07:27,078 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 286 transitions. Word has length 179 [2018-10-14 18:07:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:27,079 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 286 transitions. [2018-10-14 18:07:27,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 18:07:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 286 transitions. [2018-10-14 18:07:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-14 18:07:27,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:27,082 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:27,083 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:27,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1592928389, now seen corresponding path program 3 times [2018-10-14 18:07:27,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 94 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-14 18:07:27,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:27,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 18:07:27,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 18:07:27,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 18:07:27,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:07:27,395 INFO L87 Difference]: Start difference. First operand 279 states and 286 transitions. Second operand 10 states. [2018-10-14 18:07:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:27,719 INFO L93 Difference]: Finished difference Result 319 states and 325 transitions. [2018-10-14 18:07:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 18:07:27,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2018-10-14 18:07:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:27,722 INFO L225 Difference]: With dead ends: 319 [2018-10-14 18:07:27,723 INFO L226 Difference]: Without dead ends: 319 [2018-10-14 18:07:27,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-14 18:07:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-14 18:07:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 279. [2018-10-14 18:07:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-14 18:07:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 285 transitions. [2018-10-14 18:07:27,729 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 285 transitions. Word has length 193 [2018-10-14 18:07:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:27,730 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 285 transitions. [2018-10-14 18:07:27,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 18:07:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 285 transitions. [2018-10-14 18:07:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-14 18:07:27,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:27,733 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:27,733 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:27,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash -189207621, now seen corresponding path program 4 times [2018-10-14 18:07:27,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 25 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-14 18:07:28,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:28,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 18:07:28,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 18:07:28,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 18:07:28,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:07:28,698 INFO L87 Difference]: Start difference. First operand 279 states and 285 transitions. Second operand 12 states. [2018-10-14 18:07:29,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:29,102 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2018-10-14 18:07:29,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 18:07:29,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 214 [2018-10-14 18:07:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:29,106 INFO L225 Difference]: With dead ends: 296 [2018-10-14 18:07:29,106 INFO L226 Difference]: Without dead ends: 296 [2018-10-14 18:07:29,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-14 18:07:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-14 18:07:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 267. [2018-10-14 18:07:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-14 18:07:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2018-10-14 18:07:29,112 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 214 [2018-10-14 18:07:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:29,113 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2018-10-14 18:07:29,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 18:07:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2018-10-14 18:07:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-14 18:07:29,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:29,116 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-14 18:07:29,116 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:29,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:29,117 INFO L82 PathProgramCache]: Analyzing trace with hash 336553541, now seen corresponding path program 5 times [2018-10-14 18:07:29,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-14 18:07:29,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:07:29,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-14 18:07:29,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 18:07:29,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 18:07:29,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-14 18:07:29,678 INFO L87 Difference]: Start difference. First operand 267 states and 270 transitions. Second operand 16 states. [2018-10-14 18:07:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:30,928 INFO L93 Difference]: Finished difference Result 361 states and 365 transitions. [2018-10-14 18:07:30,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-14 18:07:30,929 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 235 [2018-10-14 18:07:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:30,931 INFO L225 Difference]: With dead ends: 361 [2018-10-14 18:07:30,931 INFO L226 Difference]: Without dead ends: 361 [2018-10-14 18:07:30,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 18:07:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-14 18:07:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 271. [2018-10-14 18:07:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-14 18:07:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 275 transitions. [2018-10-14 18:07:30,937 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 275 transitions. Word has length 235 [2018-10-14 18:07:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:30,938 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 275 transitions. [2018-10-14 18:07:30,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 18:07:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 275 transitions. [2018-10-14 18:07:30,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-14 18:07:30,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:30,940 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-14 18:07:30,940 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:30,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:30,941 INFO L82 PathProgramCache]: Analyzing trace with hash 699806479, now seen corresponding path program 6 times [2018-10-14 18:07:30,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 97 proven. 27 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-14 18:07:31,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:31,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 18:07:31,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 18:07:31,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 18:07:31,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-14 18:07:31,297 INFO L87 Difference]: Start difference. First operand 271 states and 275 transitions. Second operand 16 states. [2018-10-14 18:07:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:33,485 INFO L93 Difference]: Finished difference Result 590 states and 601 transitions. [2018-10-14 18:07:33,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 18:07:33,486 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 249 [2018-10-14 18:07:33,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:33,489 INFO L225 Difference]: With dead ends: 590 [2018-10-14 18:07:33,489 INFO L226 Difference]: Without dead ends: 590 [2018-10-14 18:07:33,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=470, Invalid=1882, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:07:33,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-14 18:07:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 285. [2018-10-14 18:07:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-14 18:07:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 290 transitions. [2018-10-14 18:07:33,497 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 290 transitions. Word has length 249 [2018-10-14 18:07:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:33,498 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 290 transitions. [2018-10-14 18:07:33,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 18:07:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 290 transitions. [2018-10-14 18:07:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-14 18:07:33,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:33,499 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:33,500 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:33,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 615110233, now seen corresponding path program 7 times [2018-10-14 18:07:33,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 11 proven. 208 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-14 18:07:34,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:34,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 18:07:34,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 18:07:34,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 18:07:34,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-10-14 18:07:34,248 INFO L87 Difference]: Start difference. First operand 285 states and 290 transitions. Second operand 16 states. [2018-10-14 18:07:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:35,345 INFO L93 Difference]: Finished difference Result 589 states and 599 transitions. [2018-10-14 18:07:35,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 18:07:35,345 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 263 [2018-10-14 18:07:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:35,348 INFO L225 Difference]: With dead ends: 589 [2018-10-14 18:07:35,348 INFO L226 Difference]: Without dead ends: 589 [2018-10-14 18:07:35,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=632, Invalid=2230, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 18:07:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-14 18:07:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 409. [2018-10-14 18:07:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-14 18:07:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 417 transitions. [2018-10-14 18:07:35,357 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 417 transitions. Word has length 263 [2018-10-14 18:07:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:35,358 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 417 transitions. [2018-10-14 18:07:35,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 18:07:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 417 transitions. [2018-10-14 18:07:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-14 18:07:35,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:35,360 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, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:35,360 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:35,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1932241173, now seen corresponding path program 8 times [2018-10-14 18:07:35,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 211 proven. 37 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-10-14 18:07:36,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:36,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 18:07:36,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 18:07:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 18:07:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:07:36,018 INFO L87 Difference]: Start difference. First operand 409 states and 417 transitions. Second operand 15 states. [2018-10-14 18:07:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:37,234 INFO L93 Difference]: Finished difference Result 867 states and 885 transitions. [2018-10-14 18:07:37,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 18:07:37,238 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 359 [2018-10-14 18:07:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:37,242 INFO L225 Difference]: With dead ends: 867 [2018-10-14 18:07:37,242 INFO L226 Difference]: Without dead ends: 867 [2018-10-14 18:07:37,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=810, Invalid=3746, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 18:07:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-10-14 18:07:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 430. [2018-10-14 18:07:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-14 18:07:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 439 transitions. [2018-10-14 18:07:37,253 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 439 transitions. Word has length 359 [2018-10-14 18:07:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:37,254 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 439 transitions. [2018-10-14 18:07:37,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 18:07:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 439 transitions. [2018-10-14 18:07:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-14 18:07:37,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:37,257 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:37,257 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:37,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:37,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1638131779, now seen corresponding path program 9 times [2018-10-14 18:07:37,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 379 proven. 159 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-14 18:07:37,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:37,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 18:07:37,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 18:07:37,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 18:07:37,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:07:37,731 INFO L87 Difference]: Start difference. First operand 430 states and 439 transitions. Second operand 12 states. [2018-10-14 18:07:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:38,083 INFO L93 Difference]: Finished difference Result 433 states and 440 transitions. [2018-10-14 18:07:38,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 18:07:38,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 380 [2018-10-14 18:07:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:38,087 INFO L225 Difference]: With dead ends: 433 [2018-10-14 18:07:38,087 INFO L226 Difference]: Without dead ends: 433 [2018-10-14 18:07:38,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:07:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-14 18:07:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2018-10-14 18:07:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-14 18:07:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 437 transitions. [2018-10-14 18:07:38,095 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 437 transitions. Word has length 380 [2018-10-14 18:07:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:38,096 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 437 transitions. [2018-10-14 18:07:38,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 18:07:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 437 transitions. [2018-10-14 18:07:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-14 18:07:38,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:38,099 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:38,099 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:38,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1933191117, now seen corresponding path program 10 times [2018-10-14 18:07:38,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 411 proven. 176 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-14 18:07:38,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:38,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 18:07:38,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 18:07:38,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 18:07:38,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-14 18:07:38,713 INFO L87 Difference]: Start difference. First operand 430 states and 437 transitions. Second operand 14 states. [2018-10-14 18:07:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:39,184 INFO L93 Difference]: Finished difference Result 433 states and 438 transitions. [2018-10-14 18:07:39,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-14 18:07:39,184 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 394 [2018-10-14 18:07:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:39,186 INFO L225 Difference]: With dead ends: 433 [2018-10-14 18:07:39,186 INFO L226 Difference]: Without dead ends: 433 [2018-10-14 18:07:39,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2018-10-14 18:07:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-14 18:07:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2018-10-14 18:07:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-14 18:07:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 435 transitions. [2018-10-14 18:07:39,196 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 435 transitions. Word has length 394 [2018-10-14 18:07:39,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:39,197 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 435 transitions. [2018-10-14 18:07:39,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 18:07:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 435 transitions. [2018-10-14 18:07:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-14 18:07:39,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:39,200 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, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:39,200 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:39,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1975348695, now seen corresponding path program 11 times [2018-10-14 18:07:39,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 142 proven. 526 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-14 18:07:40,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:40,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 18:07:40,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 18:07:40,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 18:07:40,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:07:40,442 INFO L87 Difference]: Start difference. First operand 430 states and 435 transitions. Second operand 24 states. [2018-10-14 18:07:43,344 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-14 18:07:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:44,335 INFO L93 Difference]: Finished difference Result 601 states and 608 transitions. [2018-10-14 18:07:44,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-14 18:07:44,335 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 408 [2018-10-14 18:07:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:44,338 INFO L225 Difference]: With dead ends: 601 [2018-10-14 18:07:44,338 INFO L226 Difference]: Without dead ends: 601 [2018-10-14 18:07:44,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=766, Invalid=3140, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 18:07:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-10-14 18:07:44,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 444. [2018-10-14 18:07:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-14 18:07:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 450 transitions. [2018-10-14 18:07:44,347 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 450 transitions. Word has length 408 [2018-10-14 18:07:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:44,348 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 450 transitions. [2018-10-14 18:07:44,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 18:07:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 450 transitions. [2018-10-14 18:07:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-14 18:07:44,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:44,351 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:44,352 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:44,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:44,352 INFO L82 PathProgramCache]: Analyzing trace with hash 753713139, now seen corresponding path program 12 times [2018-10-14 18:07:44,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 36 proven. 697 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-14 18:07:45,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:45,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 18:07:45,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 18:07:45,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 18:07:45,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-10-14 18:07:45,696 INFO L87 Difference]: Start difference. First operand 444 states and 450 transitions. Second operand 20 states. [2018-10-14 18:07:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:47,273 INFO L93 Difference]: Finished difference Result 791 states and 802 transitions. [2018-10-14 18:07:47,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 18:07:47,274 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 422 [2018-10-14 18:07:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:47,278 INFO L225 Difference]: With dead ends: 791 [2018-10-14 18:07:47,278 INFO L226 Difference]: Without dead ends: 791 [2018-10-14 18:07:47,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=954, Invalid=3738, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 18:07:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-10-14 18:07:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 626. [2018-10-14 18:07:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-14 18:07:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 635 transitions. [2018-10-14 18:07:47,289 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 635 transitions. Word has length 422 [2018-10-14 18:07:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:47,290 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 635 transitions. [2018-10-14 18:07:47,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 18:07:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 635 transitions. [2018-10-14 18:07:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-10-14 18:07:47,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:47,294 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:47,294 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:47,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:47,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1729859443, now seen corresponding path program 13 times [2018-10-14 18:07:47,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 917 proven. 326 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-10-14 18:07:48,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:48,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 18:07:48,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 18:07:48,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 18:07:48,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-14 18:07:48,049 INFO L87 Difference]: Start difference. First operand 626 states and 635 transitions. Second operand 16 states. [2018-10-14 18:07:48,794 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 18:07:49,173 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 18:07:49,465 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 18:07:49,801 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 18:07:50,176 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-14 18:07:50,499 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 18:07:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:51,130 INFO L93 Difference]: Finished difference Result 603 states and 610 transitions. [2018-10-14 18:07:51,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 18:07:51,131 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 546 [2018-10-14 18:07:51,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:51,135 INFO L225 Difference]: With dead ends: 603 [2018-10-14 18:07:51,135 INFO L226 Difference]: Without dead ends: 603 [2018-10-14 18:07:51,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:07:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-14 18:07:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2018-10-14 18:07:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-14 18:07:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 610 transitions. [2018-10-14 18:07:51,143 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 610 transitions. Word has length 546 [2018-10-14 18:07:51,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:51,144 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 610 transitions. [2018-10-14 18:07:51,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 18:07:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 610 transitions. [2018-10-14 18:07:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-14 18:07:51,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:51,148 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, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:51,148 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:51,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash 660441635, now seen corresponding path program 14 times [2018-10-14 18:07:51,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1155 proven. 80 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-14 18:07:51,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:51,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 18:07:51,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 18:07:51,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 18:07:51,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:07:51,606 INFO L87 Difference]: Start difference. First operand 603 states and 610 transitions. Second operand 15 states. [2018-10-14 18:07:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:52,627 INFO L93 Difference]: Finished difference Result 699 states and 704 transitions. [2018-10-14 18:07:52,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 18:07:52,628 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 567 [2018-10-14 18:07:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:52,631 INFO L225 Difference]: With dead ends: 699 [2018-10-14 18:07:52,632 INFO L226 Difference]: Without dead ends: 641 [2018-10-14 18:07:52,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=1320, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 18:07:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-10-14 18:07:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 603. [2018-10-14 18:07:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-14 18:07:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 607 transitions. [2018-10-14 18:07:52,640 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 607 transitions. Word has length 567 [2018-10-14 18:07:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:52,640 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 607 transitions. [2018-10-14 18:07:52,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 18:07:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 607 transitions. [2018-10-14 18:07:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2018-10-14 18:07:52,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:52,645 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:52,645 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:52,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:52,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1195719911, now seen corresponding path program 15 times [2018-10-14 18:07:52,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 751 proven. 93 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-10-14 18:07:54,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:54,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 18:07:54,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 18:07:54,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 18:07:54,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-14 18:07:54,265 INFO L87 Difference]: Start difference. First operand 603 states and 607 transitions. Second operand 19 states. [2018-10-14 18:07:54,816 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-14 18:07:55,952 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-14 18:07:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:56,152 INFO L93 Difference]: Finished difference Result 977 states and 985 transitions. [2018-10-14 18:07:56,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 18:07:56,152 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 581 [2018-10-14 18:07:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:56,155 INFO L225 Difference]: With dead ends: 977 [2018-10-14 18:07:56,155 INFO L226 Difference]: Without dead ends: 977 [2018-10-14 18:07:56,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2437 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1174, Invalid=6136, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 18:07:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-10-14 18:07:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 624. [2018-10-14 18:07:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-14 18:07:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 629 transitions. [2018-10-14 18:07:56,165 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 629 transitions. Word has length 581 [2018-10-14 18:07:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:56,166 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 629 transitions. [2018-10-14 18:07:56,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 18:07:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 629 transitions. [2018-10-14 18:07:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-10-14 18:07:56,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:56,170 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, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:56,170 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:56,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:56,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1903038243, now seen corresponding path program 16 times [2018-10-14 18:07:56,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 586 proven. 1161 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-14 18:07:57,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:57,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 18:07:57,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 18:07:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 18:07:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-10-14 18:07:57,256 INFO L87 Difference]: Start difference. First operand 624 states and 629 transitions. Second operand 28 states. [2018-10-14 18:08:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:00,345 INFO L93 Difference]: Finished difference Result 809 states and 816 transitions. [2018-10-14 18:08:00,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 18:08:00,346 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 602 [2018-10-14 18:08:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:00,349 INFO L225 Difference]: With dead ends: 809 [2018-10-14 18:08:00,349 INFO L226 Difference]: Without dead ends: 809 [2018-10-14 18:08:00,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=937, Invalid=4175, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 18:08:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-10-14 18:08:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 638. [2018-10-14 18:08:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-10-14 18:08:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 644 transitions. [2018-10-14 18:08:00,359 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 644 transitions. Word has length 602 [2018-10-14 18:08:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:00,360 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 644 transitions. [2018-10-14 18:08:00,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 18:08:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 644 transitions. [2018-10-14 18:08:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2018-10-14 18:08:00,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:00,365 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:00,365 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:00,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:00,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1265303699, now seen corresponding path program 17 times [2018-10-14 18:08:00,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 1002 proven. 170 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-10-14 18:08:00,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:00,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 18:08:00,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 18:08:00,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 18:08:00,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:08:00,997 INFO L87 Difference]: Start difference. First operand 638 states and 644 transitions. Second operand 23 states. [2018-10-14 18:08:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:03,154 INFO L93 Difference]: Finished difference Result 1151 states and 1164 transitions. [2018-10-14 18:08:03,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 18:08:03,155 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 616 [2018-10-14 18:08:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:03,160 INFO L225 Difference]: With dead ends: 1151 [2018-10-14 18:08:03,160 INFO L226 Difference]: Without dead ends: 1151 [2018-10-14 18:08:03,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1871, Invalid=11011, Unknown=0, NotChecked=0, Total=12882 [2018-10-14 18:08:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2018-10-14 18:08:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 710. [2018-10-14 18:08:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-10-14 18:08:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 718 transitions. [2018-10-14 18:08:03,175 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 718 transitions. Word has length 616 [2018-10-14 18:08:03,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:03,175 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 718 transitions. [2018-10-14 18:08:03,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 18:08:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 718 transitions. [2018-10-14 18:08:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2018-10-14 18:08:03,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:03,180 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, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:03,180 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:03,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1237948637, now seen corresponding path program 18 times [2018-10-14 18:08:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2360 backedges. 696 proven. 1412 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-10-14 18:08:04,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:04,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 18:08:04,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 18:08:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 18:08:04,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:08:04,406 INFO L87 Difference]: Start difference. First operand 710 states and 718 transitions. Second operand 22 states. [2018-10-14 18:08:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:06,053 INFO L93 Difference]: Finished difference Result 1080 states and 1090 transitions. [2018-10-14 18:08:06,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 18:08:06,057 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 637 [2018-10-14 18:08:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:06,060 INFO L225 Difference]: With dead ends: 1080 [2018-10-14 18:08:06,060 INFO L226 Difference]: Without dead ends: 1080 [2018-10-14 18:08:06,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2743 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1546, Invalid=6464, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 18:08:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2018-10-14 18:08:06,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 911. [2018-10-14 18:08:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2018-10-14 18:08:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 920 transitions. [2018-10-14 18:08:06,072 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 920 transitions. Word has length 637 [2018-10-14 18:08:06,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:06,072 INFO L481 AbstractCegarLoop]: Abstraction has 911 states and 920 transitions. [2018-10-14 18:08:06,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 18:08:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 920 transitions. [2018-10-14 18:08:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2018-10-14 18:08:06,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:06,079 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, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:06,079 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:06,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:06,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1128871619, now seen corresponding path program 19 times [2018-10-14 18:08:06,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3889 backedges. 2364 proven. 992 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2018-10-14 18:08:07,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:07,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 18:08:07,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 18:08:07,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 18:08:07,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:08:07,036 INFO L87 Difference]: Start difference. First operand 911 states and 920 transitions. Second operand 22 states. [2018-10-14 18:08:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:08,082 INFO L93 Difference]: Finished difference Result 931 states and 937 transitions. [2018-10-14 18:08:08,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 18:08:08,083 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 796 [2018-10-14 18:08:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:08,087 INFO L225 Difference]: With dead ends: 931 [2018-10-14 18:08:08,087 INFO L226 Difference]: Without dead ends: 877 [2018-10-14 18:08:08,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=469, Invalid=1883, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:08:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-10-14 18:08:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 874. [2018-10-14 18:08:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-10-14 18:08:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 879 transitions. [2018-10-14 18:08:08,096 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 879 transitions. Word has length 796 [2018-10-14 18:08:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:08,097 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 879 transitions. [2018-10-14 18:08:08,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 18:08:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 879 transitions. [2018-10-14 18:08:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-10-14 18:08:08,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:08,104 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, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:08,104 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:08,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1046335081, now seen corresponding path program 20 times [2018-10-14 18:08:08,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:08,740 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:08:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4380 backedges. 1867 proven. 228 refuted. 0 times theorem prover too weak. 2285 trivial. 0 not checked. [2018-10-14 18:08:09,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:09,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 18:08:09,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 18:08:09,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 18:08:09,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2018-10-14 18:08:09,722 INFO L87 Difference]: Start difference. First operand 874 states and 879 transitions. Second operand 28 states. [2018-10-14 18:08:12,670 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-14 18:08:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:13,344 INFO L93 Difference]: Finished difference Result 1102 states and 1109 transitions. [2018-10-14 18:08:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-14 18:08:13,344 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 831 [2018-10-14 18:08:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:13,349 INFO L225 Difference]: With dead ends: 1102 [2018-10-14 18:08:13,349 INFO L226 Difference]: Without dead ends: 1102 [2018-10-14 18:08:13,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=824, Invalid=3868, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 18:08:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2018-10-14 18:08:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 888. [2018-10-14 18:08:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-10-14 18:08:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 894 transitions. [2018-10-14 18:08:13,359 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 894 transitions. Word has length 831 [2018-10-14 18:08:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:13,360 INFO L481 AbstractCegarLoop]: Abstraction has 888 states and 894 transitions. [2018-10-14 18:08:13,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 18:08:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 894 transitions. [2018-10-14 18:08:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2018-10-14 18:08:13,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:13,367 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:13,367 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:13,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:13,368 INFO L82 PathProgramCache]: Analyzing trace with hash -108426189, now seen corresponding path program 21 times [2018-10-14 18:08:13,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4585 backedges. 137 proven. 3863 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-10-14 18:08:14,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:14,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 18:08:14,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 18:08:14,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 18:08:14,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-10-14 18:08:14,705 INFO L87 Difference]: Start difference. First operand 888 states and 894 transitions. Second operand 28 states. [2018-10-14 18:08:17,347 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 18:08:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:17,519 INFO L93 Difference]: Finished difference Result 1403 states and 1414 transitions. [2018-10-14 18:08:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-14 18:08:17,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 845 [2018-10-14 18:08:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:17,525 INFO L225 Difference]: With dead ends: 1403 [2018-10-14 18:08:17,525 INFO L226 Difference]: Without dead ends: 1403 [2018-10-14 18:08:17,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4801 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2389, Invalid=11417, Unknown=0, NotChecked=0, Total=13806 [2018-10-14 18:08:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-14 18:08:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1168. [2018-10-14 18:08:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2018-10-14 18:08:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1177 transitions. [2018-10-14 18:08:17,536 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1177 transitions. Word has length 845 [2018-10-14 18:08:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:17,537 INFO L481 AbstractCegarLoop]: Abstraction has 1168 states and 1177 transitions. [2018-10-14 18:08:17,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 18:08:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1177 transitions. [2018-10-14 18:08:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2018-10-14 18:08:17,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:17,547 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:17,547 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:17,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:17,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2063472505, now seen corresponding path program 22 times [2018-10-14 18:08:17,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7292 backedges. 4825 proven. 1324 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2018-10-14 18:08:19,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:19,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 18:08:19,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 18:08:19,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 18:08:19,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:08:19,609 INFO L87 Difference]: Start difference. First operand 1168 states and 1177 transitions. Second operand 24 states. [2018-10-14 18:08:20,732 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 18:08:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:21,034 INFO L93 Difference]: Finished difference Result 1117 states and 1124 transitions. [2018-10-14 18:08:21,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 18:08:21,034 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1039 [2018-10-14 18:08:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:21,038 INFO L225 Difference]: With dead ends: 1117 [2018-10-14 18:08:21,038 INFO L226 Difference]: Without dead ends: 1117 [2018-10-14 18:08:21,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=564, Invalid=2406, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 18:08:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2018-10-14 18:08:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2018-10-14 18:08:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-14 18:08:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1124 transitions. [2018-10-14 18:08:21,046 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1124 transitions. Word has length 1039 [2018-10-14 18:08:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:21,047 INFO L481 AbstractCegarLoop]: Abstraction has 1117 states and 1124 transitions. [2018-10-14 18:08:21,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 18:08:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1124 transitions. [2018-10-14 18:08:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2018-10-14 18:08:21,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:21,057 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, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:21,057 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:21,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash -612808009, now seen corresponding path program 23 times [2018-10-14 18:08:21,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7698 backedges. 4779 proven. 234 refuted. 0 times theorem prover too weak. 2685 trivial. 0 not checked. [2018-10-14 18:08:22,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:22,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 18:08:22,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 18:08:22,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 18:08:22,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:08:22,019 INFO L87 Difference]: Start difference. First operand 1117 states and 1124 transitions. Second operand 23 states. [2018-10-14 18:08:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:23,948 INFO L93 Difference]: Finished difference Result 1235 states and 1240 transitions. [2018-10-14 18:08:23,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 18:08:23,948 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1060 [2018-10-14 18:08:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:23,954 INFO L225 Difference]: With dead ends: 1235 [2018-10-14 18:08:23,954 INFO L226 Difference]: Without dead ends: 1235 [2018-10-14 18:08:23,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=808, Invalid=3614, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:08:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2018-10-14 18:08:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1117. [2018-10-14 18:08:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-14 18:08:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1122 transitions. [2018-10-14 18:08:23,963 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1122 transitions. Word has length 1060 [2018-10-14 18:08:23,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:23,964 INFO L481 AbstractCegarLoop]: Abstraction has 1117 states and 1122 transitions. [2018-10-14 18:08:23,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 18:08:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1122 transitions. [2018-10-14 18:08:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2018-10-14 18:08:23,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:23,974 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:23,974 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:23,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:23,974 INFO L82 PathProgramCache]: Analyzing trace with hash 209709, now seen corresponding path program 24 times [2018-10-14 18:08:23,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7974 backedges. 2927 proven. 268 refuted. 0 times theorem prover too weak. 4779 trivial. 0 not checked. [2018-10-14 18:08:25,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:25,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 18:08:25,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 18:08:25,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 18:08:25,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:08:25,322 INFO L87 Difference]: Start difference. First operand 1117 states and 1122 transitions. Second operand 27 states. [2018-10-14 18:08:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:28,151 INFO L93 Difference]: Finished difference Result 1669 states and 1678 transitions. [2018-10-14 18:08:28,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-14 18:08:28,152 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1074 [2018-10-14 18:08:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:28,156 INFO L225 Difference]: With dead ends: 1669 [2018-10-14 18:08:28,156 INFO L226 Difference]: Without dead ends: 1669 [2018-10-14 18:08:28,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7278 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2723, Invalid=17017, Unknown=0, NotChecked=0, Total=19740 [2018-10-14 18:08:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2018-10-14 18:08:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1138. [2018-10-14 18:08:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-10-14 18:08:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1144 transitions. [2018-10-14 18:08:28,172 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1144 transitions. Word has length 1074 [2018-10-14 18:08:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:28,173 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1144 transitions. [2018-10-14 18:08:28,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 18:08:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1144 transitions. [2018-10-14 18:08:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-10-14 18:08:28,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:28,184 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, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:28,184 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:28,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:28,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1686790089, now seen corresponding path program 25 times [2018-10-14 18:08:28,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:28,894 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:08:29,122 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:08:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8401 backedges. 3327 proven. 325 refuted. 0 times theorem prover too weak. 4749 trivial. 0 not checked. [2018-10-14 18:08:30,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:30,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 18:08:30,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 18:08:30,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 18:08:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 18:08:30,581 INFO L87 Difference]: Start difference. First operand 1138 states and 1144 transitions. Second operand 34 states. [2018-10-14 18:08:36,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:36,756 INFO L93 Difference]: Finished difference Result 1478 states and 1487 transitions. [2018-10-14 18:08:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 18:08:36,757 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1095 [2018-10-14 18:08:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:36,762 INFO L225 Difference]: With dead ends: 1478 [2018-10-14 18:08:36,762 INFO L226 Difference]: Without dead ends: 1478 [2018-10-14 18:08:36,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1439, Invalid=5701, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 18:08:36,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2018-10-14 18:08:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1152. [2018-10-14 18:08:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-14 18:08:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1159 transitions. [2018-10-14 18:08:36,776 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1159 transitions. Word has length 1095 [2018-10-14 18:08:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:36,777 INFO L481 AbstractCegarLoop]: Abstraction has 1152 states and 1159 transitions. [2018-10-14 18:08:36,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 18:08:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1159 transitions. [2018-10-14 18:08:36,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2018-10-14 18:08:36,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:36,787 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:36,787 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:36,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1834017407, now seen corresponding path program 26 times [2018-10-14 18:08:36,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 3525 proven. 387 refuted. 0 times theorem prover too weak. 4779 trivial. 0 not checked. [2018-10-14 18:08:39,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:39,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 18:08:39,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 18:08:39,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 18:08:39,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:08:39,370 INFO L87 Difference]: Start difference. First operand 1152 states and 1159 transitions. Second operand 31 states. [2018-10-14 18:08:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:43,149 INFO L93 Difference]: Finished difference Result 1871 states and 1885 transitions. [2018-10-14 18:08:43,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-14 18:08:43,159 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1109 [2018-10-14 18:08:43,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:43,166 INFO L225 Difference]: With dead ends: 1871 [2018-10-14 18:08:43,166 INFO L226 Difference]: Without dead ends: 1871 [2018-10-14 18:08:43,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11628 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3946, Invalid=26504, Unknown=0, NotChecked=0, Total=30450 [2018-10-14 18:08:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-10-14 18:08:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1252. [2018-10-14 18:08:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-14 18:08:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1261 transitions. [2018-10-14 18:08:43,184 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1261 transitions. Word has length 1109 [2018-10-14 18:08:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:43,185 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1261 transitions. [2018-10-14 18:08:43,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 18:08:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1261 transitions. [2018-10-14 18:08:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1131 [2018-10-14 18:08:43,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:43,196 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, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:43,196 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:43,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1485454281, now seen corresponding path program 27 times [2018-10-14 18:08:43,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9139 backedges. 2078 proven. 6097 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2018-10-14 18:08:46,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:46,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 18:08:46,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 18:08:46,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 18:08:46,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-14 18:08:46,752 INFO L87 Difference]: Start difference. First operand 1252 states and 1261 transitions. Second operand 30 states. [2018-10-14 18:08:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:50,000 INFO L93 Difference]: Finished difference Result 1748 states and 1759 transitions. [2018-10-14 18:08:50,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-14 18:08:50,000 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1130 [2018-10-14 18:08:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:50,005 INFO L225 Difference]: With dead ends: 1748 [2018-10-14 18:08:50,005 INFO L226 Difference]: Without dead ends: 1748 [2018-10-14 18:08:50,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8106 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3604, Invalid=17566, Unknown=0, NotChecked=0, Total=21170 [2018-10-14 18:08:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2018-10-14 18:08:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1523. [2018-10-14 18:08:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2018-10-14 18:08:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1533 transitions. [2018-10-14 18:08:50,019 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1533 transitions. Word has length 1130 [2018-10-14 18:08:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:50,020 INFO L481 AbstractCegarLoop]: Abstraction has 1523 states and 1533 transitions. [2018-10-14 18:08:50,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 18:08:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1533 transitions. [2018-10-14 18:08:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2018-10-14 18:08:50,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:50,031 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, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:50,031 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:50,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:50,032 INFO L82 PathProgramCache]: Analyzing trace with hash -711936131, now seen corresponding path program 28 times [2018-10-14 18:08:50,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13760 backedges. 9508 proven. 2240 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2018-10-14 18:08:51,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:51,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 18:08:51,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 18:08:51,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 18:08:51,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-14 18:08:51,975 INFO L87 Difference]: Start difference. First operand 1523 states and 1533 transitions. Second operand 28 states. [2018-10-14 18:08:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:53,713 INFO L93 Difference]: Finished difference Result 1458 states and 1466 transitions. [2018-10-14 18:08:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 18:08:53,714 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1359 [2018-10-14 18:08:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:53,719 INFO L225 Difference]: With dead ends: 1458 [2018-10-14 18:08:53,719 INFO L226 Difference]: Without dead ends: 1458 [2018-10-14 18:08:53,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=787, Invalid=3373, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 18:08:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-10-14 18:08:53,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2018-10-14 18:08:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2018-10-14 18:08:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1466 transitions. [2018-10-14 18:08:53,730 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1466 transitions. Word has length 1359 [2018-10-14 18:08:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:53,731 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 1466 transitions. [2018-10-14 18:08:53,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 18:08:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1466 transitions. [2018-10-14 18:08:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1381 [2018-10-14 18:08:53,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:53,742 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, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:53,742 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:53,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:53,743 INFO L82 PathProgramCache]: Analyzing trace with hash -488808781, now seen corresponding path program 29 times [2018-10-14 18:08:53,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14335 backedges. 8542 proven. 332 refuted. 0 times theorem prover too weak. 5461 trivial. 0 not checked. [2018-10-14 18:08:56,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:56,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 18:08:56,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 18:08:56,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 18:08:56,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:08:56,300 INFO L87 Difference]: Start difference. First operand 1458 states and 1466 transitions. Second operand 27 states. [2018-10-14 18:08:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:58,779 INFO L93 Difference]: Finished difference Result 1658 states and 1663 transitions. [2018-10-14 18:08:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 18:08:58,779 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1380 [2018-10-14 18:08:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:58,784 INFO L225 Difference]: With dead ends: 1658 [2018-10-14 18:08:58,784 INFO L226 Difference]: Without dead ends: 1558 [2018-10-14 18:08:58,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1142, Invalid=5178, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 18:08:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2018-10-14 18:08:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1437. [2018-10-14 18:08:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2018-10-14 18:08:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1442 transitions. [2018-10-14 18:08:58,795 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1442 transitions. Word has length 1380 [2018-10-14 18:08:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:58,796 INFO L481 AbstractCegarLoop]: Abstraction has 1437 states and 1442 transitions. [2018-10-14 18:08:58,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 18:08:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1442 transitions. [2018-10-14 18:08:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1395 [2018-10-14 18:08:58,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:58,808 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, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:58,808 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:58,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1227873705, now seen corresponding path program 30 times [2018-10-14 18:08:58,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 14710 backedges. 5398 proven. 436 refuted. 0 times theorem prover too weak. 8876 trivial. 0 not checked. [2018-10-14 18:09:01,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:01,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 18:09:01,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 18:09:01,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 18:09:01,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 18:09:01,494 INFO L87 Difference]: Start difference. First operand 1437 states and 1442 transitions. Second operand 38 states. [2018-10-14 18:09:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:08,895 INFO L93 Difference]: Finished difference Result 1665 states and 1672 transitions. [2018-10-14 18:09:08,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-14 18:09:08,896 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1394 [2018-10-14 18:09:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:08,903 INFO L225 Difference]: With dead ends: 1665 [2018-10-14 18:09:08,903 INFO L226 Difference]: Without dead ends: 1665 [2018-10-14 18:09:08,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1665, Invalid=7077, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 18:09:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2018-10-14 18:09:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1451. [2018-10-14 18:09:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2018-10-14 18:09:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1457 transitions. [2018-10-14 18:09:08,916 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1457 transitions. Word has length 1394 [2018-10-14 18:09:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:08,917 INFO L481 AbstractCegarLoop]: Abstraction has 1451 states and 1457 transitions. [2018-10-14 18:09:08,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 18:09:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1457 transitions. [2018-10-14 18:09:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1409 [2018-10-14 18:09:08,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:08,931 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:08,931 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:08,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:08,931 INFO L82 PathProgramCache]: Analyzing trace with hash -17831053, now seen corresponding path program 31 times [2018-10-14 18:09:08,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15099 backedges. 306 proven. 13078 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2018-10-14 18:09:11,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:11,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 18:09:11,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 18:09:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 18:09:11,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 18:09:11,293 INFO L87 Difference]: Start difference. First operand 1451 states and 1457 transitions. Second operand 36 states. [2018-10-14 18:09:14,856 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-14 18:09:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:16,683 INFO L93 Difference]: Finished difference Result 2134 states and 2145 transitions. [2018-10-14 18:09:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-14 18:09:16,684 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1408 [2018-10-14 18:09:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:16,691 INFO L225 Difference]: With dead ends: 2134 [2018-10-14 18:09:16,691 INFO L226 Difference]: Without dead ends: 2134 [2018-10-14 18:09:16,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12230 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4995, Invalid=26867, Unknown=0, NotChecked=0, Total=31862 [2018-10-14 18:09:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-10-14 18:09:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1829. [2018-10-14 18:09:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2018-10-14 18:09:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 1838 transitions. [2018-10-14 18:09:16,713 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 1838 transitions. Word has length 1408 [2018-10-14 18:09:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:16,714 INFO L481 AbstractCegarLoop]: Abstraction has 1829 states and 1838 transitions. [2018-10-14 18:09:16,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 18:09:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 1838 transitions. [2018-10-14 18:09:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1673 [2018-10-14 18:09:16,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:16,730 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:16,730 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:16,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:16,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1096106853, now seen corresponding path program 32 times [2018-10-14 18:09:16,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 22093 backedges. 15694 proven. 3518 refuted. 0 times theorem prover too weak. 2881 trivial. 0 not checked. [2018-10-14 18:09:19,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:19,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 18:09:19,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 18:09:19,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 18:09:19,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-14 18:09:19,502 INFO L87 Difference]: Start difference. First operand 1829 states and 1838 transitions. Second operand 32 states. [2018-10-14 18:09:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:21,738 INFO L93 Difference]: Finished difference Result 1750 states and 1757 transitions. [2018-10-14 18:09:21,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 18:09:21,738 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1672 [2018-10-14 18:09:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:21,743 INFO L225 Difference]: With dead ends: 1750 [2018-10-14 18:09:21,744 INFO L226 Difference]: Without dead ends: 1750 [2018-10-14 18:09:21,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1048, Invalid=4502, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 18:09:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2018-10-14 18:09:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1750. [2018-10-14 18:09:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-14 18:09:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 1757 transitions. [2018-10-14 18:09:21,764 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 1757 transitions. Word has length 1672 [2018-10-14 18:09:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:21,765 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 1757 transitions. [2018-10-14 18:09:21,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 18:09:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 1757 transitions. [2018-10-14 18:09:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1694 [2018-10-14 18:09:21,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:21,786 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, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:21,786 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:21,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1008950709, now seen corresponding path program 33 times [2018-10-14 18:09:21,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 22816 backedges. 12691 proven. 444 refuted. 0 times theorem prover too weak. 9681 trivial. 0 not checked. [2018-10-14 18:09:24,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:24,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 18:09:24,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 18:09:24,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 18:09:24,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:09:24,296 INFO L87 Difference]: Start difference. First operand 1750 states and 1757 transitions. Second operand 31 states. [2018-10-14 18:09:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:27,689 INFO L93 Difference]: Finished difference Result 1868 states and 1873 transitions. [2018-10-14 18:09:27,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-14 18:09:27,690 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1693 [2018-10-14 18:09:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:27,694 INFO L225 Difference]: With dead ends: 1868 [2018-10-14 18:09:27,694 INFO L226 Difference]: Without dead ends: 1868 [2018-10-14 18:09:27,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1536, Invalid=7020, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 18:09:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2018-10-14 18:09:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1750. [2018-10-14 18:09:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-14 18:09:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 1755 transitions. [2018-10-14 18:09:27,705 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 1755 transitions. Word has length 1693 [2018-10-14 18:09:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:27,706 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 1755 transitions. [2018-10-14 18:09:27,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 18:09:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 1755 transitions. [2018-10-14 18:09:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1708 [2018-10-14 18:09:27,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:27,723 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:27,723 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:27,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:27,723 INFO L82 PathProgramCache]: Analyzing trace with hash 571923009, now seen corresponding path program 34 times [2018-10-14 18:09:27,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 23304 backedges. 7435 proven. 527 refuted. 0 times theorem prover too weak. 15342 trivial. 0 not checked. [2018-10-14 18:09:30,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:30,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 18:09:30,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 18:09:30,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 18:09:30,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:09:30,354 INFO L87 Difference]: Start difference. First operand 1750 states and 1755 transitions. Second operand 35 states. [2018-10-14 18:09:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:35,434 INFO L93 Difference]: Finished difference Result 2400 states and 2409 transitions. [2018-10-14 18:09:35,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-14 18:09:35,434 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1707 [2018-10-14 18:09:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:35,437 INFO L225 Difference]: With dead ends: 2400 [2018-10-14 18:09:35,437 INFO L226 Difference]: Without dead ends: 2400 [2018-10-14 18:09:35,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17008 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5419, Invalid=37637, Unknown=0, NotChecked=0, Total=43056 [2018-10-14 18:09:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-10-14 18:09:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1771. [2018-10-14 18:09:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2018-10-14 18:09:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1777 transitions. [2018-10-14 18:09:35,452 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1777 transitions. Word has length 1707 [2018-10-14 18:09:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:35,453 INFO L481 AbstractCegarLoop]: Abstraction has 1771 states and 1777 transitions. [2018-10-14 18:09:35,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 18:09:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1777 transitions. [2018-10-14 18:09:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1729 [2018-10-14 18:09:35,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:35,470 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, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:35,470 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:35,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash -889303477, now seen corresponding path program 35 times [2018-10-14 18:09:35,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 24048 backedges. 8185 proven. 561 refuted. 0 times theorem prover too weak. 15302 trivial. 0 not checked. [2018-10-14 18:09:38,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:38,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 18:09:38,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 18:09:38,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 18:09:38,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1544, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 18:09:38,468 INFO L87 Difference]: Start difference. First operand 1771 states and 1777 transitions. Second operand 42 states. [2018-10-14 18:09:45,582 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-10-14 18:09:45,768 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-10-14 18:09:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:47,609 INFO L93 Difference]: Finished difference Result 2139 states and 2148 transitions. [2018-10-14 18:09:47,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-14 18:09:47,609 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1728 [2018-10-14 18:09:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:47,614 INFO L225 Difference]: With dead ends: 2139 [2018-10-14 18:09:47,614 INFO L226 Difference]: Without dead ends: 2139 [2018-10-14 18:09:47,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2274, Invalid=9068, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 18:09:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-10-14 18:09:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1785. [2018-10-14 18:09:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2018-10-14 18:09:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 1792 transitions. [2018-10-14 18:09:47,632 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 1792 transitions. Word has length 1728 [2018-10-14 18:09:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:47,633 INFO L481 AbstractCegarLoop]: Abstraction has 1785 states and 1792 transitions. [2018-10-14 18:09:47,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 18:09:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 1792 transitions. [2018-10-14 18:09:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2018-10-14 18:09:47,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:47,659 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:47,659 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:47,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash 462657685, now seen corresponding path program 36 times [2018-10-14 18:09:47,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 24550 backedges. 8520 proven. 688 refuted. 0 times theorem prover too weak. 15342 trivial. 0 not checked. [2018-10-14 18:09:50,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:50,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 18:09:50,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 18:09:50,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 18:09:50,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:09:50,067 INFO L87 Difference]: Start difference. First operand 1785 states and 1792 transitions. Second operand 39 states. [2018-10-14 18:09:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:56,867 INFO L93 Difference]: Finished difference Result 2630 states and 2644 transitions. [2018-10-14 18:09:56,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-10-14 18:09:56,867 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1742 [2018-10-14 18:09:56,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:56,873 INFO L225 Difference]: With dead ends: 2630 [2018-10-14 18:09:56,873 INFO L226 Difference]: Without dead ends: 2630 [2018-10-14 18:09:56,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24773 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=7404, Invalid=53852, Unknown=0, NotChecked=0, Total=61256 [2018-10-14 18:09:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-10-14 18:09:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1913. [2018-10-14 18:09:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1913 states. [2018-10-14 18:09:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 1922 transitions. [2018-10-14 18:09:56,897 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 1922 transitions. Word has length 1742 [2018-10-14 18:09:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:56,898 INFO L481 AbstractCegarLoop]: Abstraction has 1913 states and 1922 transitions. [2018-10-14 18:09:56,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 18:09:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 1922 transitions. [2018-10-14 18:09:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1764 [2018-10-14 18:09:56,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:56,921 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, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:56,921 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:56,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2125473717, now seen corresponding path program 37 times [2018-10-14 18:09:56,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 25315 backedges. 4604 proven. 18271 refuted. 0 times theorem prover too weak. 2440 trivial. 0 not checked. [2018-10-14 18:10:00,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:00,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 18:10:00,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 18:10:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 18:10:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 18:10:00,207 INFO L87 Difference]: Start difference. First operand 1913 states and 1922 transitions. Second operand 38 states. [2018-10-14 18:10:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:05,646 INFO L93 Difference]: Finished difference Result 2535 states and 2546 transitions. [2018-10-14 18:10:05,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-14 18:10:05,646 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1763 [2018-10-14 18:10:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:05,652 INFO L225 Difference]: With dead ends: 2535 [2018-10-14 18:10:05,652 INFO L226 Difference]: Without dead ends: 2535 [2018-10-14 18:10:05,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18146 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6942, Invalid=37368, Unknown=0, NotChecked=0, Total=44310 [2018-10-14 18:10:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2018-10-14 18:10:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2254. [2018-10-14 18:10:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2018-10-14 18:10:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 2264 transitions. [2018-10-14 18:10:05,669 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 2264 transitions. Word has length 1763 [2018-10-14 18:10:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:05,670 INFO L481 AbstractCegarLoop]: Abstraction has 2254 states and 2264 transitions. [2018-10-14 18:10:05,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 18:10:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2264 transitions. [2018-10-14 18:10:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2063 [2018-10-14 18:10:05,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:05,694 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, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:05,694 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:05,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:05,694 INFO L82 PathProgramCache]: Analyzing trace with hash 282244797, now seen corresponding path program 38 times [2018-10-14 18:10:05,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 35712 backedges. 26156 proven. 5221 refuted. 0 times theorem prover too weak. 4335 trivial. 0 not checked. [2018-10-14 18:10:09,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:09,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 18:10:09,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 18:10:09,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 18:10:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 18:10:09,533 INFO L87 Difference]: Start difference. First operand 2254 states and 2264 transitions. Second operand 36 states. [2018-10-14 18:10:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:12,474 INFO L93 Difference]: Finished difference Result 2161 states and 2169 transitions. [2018-10-14 18:10:12,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 18:10:12,474 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 2062 [2018-10-14 18:10:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:12,481 INFO L225 Difference]: With dead ends: 2161 [2018-10-14 18:10:12,481 INFO L226 Difference]: Without dead ends: 2161 [2018-10-14 18:10:12,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1347, Invalid=5793, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 18:10:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2018-10-14 18:10:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2018-10-14 18:10:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2161 states. [2018-10-14 18:10:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2169 transitions. [2018-10-14 18:10:12,499 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2169 transitions. Word has length 2062 [2018-10-14 18:10:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:12,500 INFO L481 AbstractCegarLoop]: Abstraction has 2161 states and 2169 transitions. [2018-10-14 18:10:12,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 18:10:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2169 transitions. [2018-10-14 18:10:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2084 [2018-10-14 18:10:12,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:12,533 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:12,533 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:12,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash 886277747, now seen corresponding path program 39 times [2018-10-14 18:10:12,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 36646 backedges. 19545 proven. 570 refuted. 0 times theorem prover too weak. 16531 trivial. 0 not checked. [2018-10-14 18:10:15,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:15,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 18:10:15,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 18:10:15,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 18:10:15,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:10:15,621 INFO L87 Difference]: Start difference. First operand 2161 states and 2169 transitions. Second operand 35 states. [2018-10-14 18:10:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:19,828 INFO L93 Difference]: Finished difference Result 2389 states and 2394 transitions. [2018-10-14 18:10:19,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 18:10:19,829 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 2083 [2018-10-14 18:10:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:19,833 INFO L225 Difference]: With dead ends: 2389 [2018-10-14 18:10:19,833 INFO L226 Difference]: Without dead ends: 2261 [2018-10-14 18:10:19,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2852 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1990, Invalid=9140, Unknown=0, NotChecked=0, Total=11130 [2018-10-14 18:10:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2018-10-14 18:10:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2140. [2018-10-14 18:10:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2018-10-14 18:10:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2145 transitions. [2018-10-14 18:10:19,850 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2145 transitions. Word has length 2083 [2018-10-14 18:10:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:19,851 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2145 transitions. [2018-10-14 18:10:19,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 18:10:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2145 transitions. [2018-10-14 18:10:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2098 [2018-10-14 18:10:19,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:19,886 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:19,886 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:19,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:19,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1437673495, now seen corresponding path program 40 times [2018-10-14 18:10:19,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 37261 backedges. 11793 proven. 700 refuted. 0 times theorem prover too weak. 24768 trivial. 0 not checked. [2018-10-14 18:10:24,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:24,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 18:10:24,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 18:10:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 18:10:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1720, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:10:24,459 INFO L87 Difference]: Start difference. First operand 2140 states and 2145 transitions. Second operand 44 states. [2018-10-14 18:10:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:32,166 INFO L93 Difference]: Finished difference Result 2368 states and 2375 transitions. [2018-10-14 18:10:32,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-14 18:10:32,166 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2097 [2018-10-14 18:10:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:32,170 INFO L225 Difference]: With dead ends: 2368 [2018-10-14 18:10:32,170 INFO L226 Difference]: Without dead ends: 2368 [2018-10-14 18:10:32,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3045 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1856, Invalid=9916, Unknown=0, NotChecked=0, Total=11772 [2018-10-14 18:10:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2018-10-14 18:10:32,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2154. [2018-10-14 18:10:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2018-10-14 18:10:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2160 transitions. [2018-10-14 18:10:32,183 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2160 transitions. Word has length 2097 [2018-10-14 18:10:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:32,184 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 2160 transitions. [2018-10-14 18:10:32,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 18:10:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2160 transitions. [2018-10-14 18:10:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2112 [2018-10-14 18:10:32,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:32,208 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:32,208 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:32,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:32,209 INFO L82 PathProgramCache]: Analyzing trace with hash -802425421, now seen corresponding path program 41 times [2018-10-14 18:10:32,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 37890 backedges. 543 proven. 33570 refuted. 0 times theorem prover too weak. 3777 trivial. 0 not checked. [2018-10-14 18:10:36,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:36,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 18:10:36,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 18:10:36,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 18:10:36,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1660, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:10:36,102 INFO L87 Difference]: Start difference. First operand 2154 states and 2160 transitions. Second operand 44 states. [2018-10-14 18:10:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:43,923 INFO L93 Difference]: Finished difference Result 3005 states and 3016 transitions. [2018-10-14 18:10:43,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-14 18:10:43,923 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2111 [2018-10-14 18:10:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:43,927 INFO L225 Difference]: With dead ends: 3005 [2018-10-14 18:10:43,927 INFO L226 Difference]: Without dead ends: 3005 [2018-10-14 18:10:43,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25981 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9304, Invalid=53948, Unknown=0, NotChecked=0, Total=63252 [2018-10-14 18:10:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2018-10-14 18:10:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2630. [2018-10-14 18:10:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2018-10-14 18:10:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 2639 transitions. [2018-10-14 18:10:43,948 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 2639 transitions. Word has length 2111 [2018-10-14 18:10:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:43,949 INFO L481 AbstractCegarLoop]: Abstraction has 2630 states and 2639 transitions. [2018-10-14 18:10:43,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 18:10:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 2639 transitions. [2018-10-14 18:10:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2446 [2018-10-14 18:10:43,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:43,996 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:43,997 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:43,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash -805188527, now seen corresponding path program 42 times [2018-10-14 18:10:43,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 52275 backedges. 39088 proven. 7412 refuted. 0 times theorem prover too weak. 5775 trivial. 0 not checked. [2018-10-14 18:10:48,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:48,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 18:10:48,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 18:10:48,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 18:10:48,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 18:10:48,682 INFO L87 Difference]: Start difference. First operand 2630 states and 2639 transitions. Second operand 40 states. [2018-10-14 18:10:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:52,161 INFO L93 Difference]: Finished difference Result 2523 states and 2530 transitions. [2018-10-14 18:10:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-14 18:10:52,162 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2445 [2018-10-14 18:10:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:52,166 INFO L225 Difference]: With dead ends: 2523 [2018-10-14 18:10:52,166 INFO L226 Difference]: Without dead ends: 2523 [2018-10-14 18:10:52,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1684, Invalid=7246, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 18:10:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-10-14 18:10:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2523. [2018-10-14 18:10:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2018-10-14 18:10:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2530 transitions. [2018-10-14 18:10:52,180 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2530 transitions. Word has length 2445 [2018-10-14 18:10:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:52,180 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 2530 transitions. [2018-10-14 18:10:52,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 18:10:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2530 transitions. [2018-10-14 18:10:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2467 [2018-10-14 18:10:52,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:52,212 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:52,212 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:52,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:52,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1611646753, now seen corresponding path program 43 times [2018-10-14 18:10:52,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 53399 backedges. 26571 proven. 710 refuted. 0 times theorem prover too weak. 26118 trivial. 0 not checked. [2018-10-14 18:10:55,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:55,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 18:10:55,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 18:10:55,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 18:10:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:10:55,342 INFO L87 Difference]: Start difference. First operand 2523 states and 2530 transitions. Second operand 39 states. [2018-10-14 18:11:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:00,277 INFO L93 Difference]: Finished difference Result 2641 states and 2646 transitions. [2018-10-14 18:11:00,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-14 18:11:00,277 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 2466 [2018-10-14 18:11:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:00,281 INFO L225 Difference]: With dead ends: 2641 [2018-10-14 18:11:00,281 INFO L226 Difference]: Without dead ends: 2641 [2018-10-14 18:11:00,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3659 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2504, Invalid=11538, Unknown=0, NotChecked=0, Total=14042 [2018-10-14 18:11:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2018-10-14 18:11:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2523. [2018-10-14 18:11:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2018-10-14 18:11:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2528 transitions. [2018-10-14 18:11:00,296 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2528 transitions. Word has length 2466 [2018-10-14 18:11:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:00,297 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 2528 transitions. [2018-10-14 18:11:00,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 18:11:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2528 transitions. [2018-10-14 18:11:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2481 [2018-10-14 18:11:00,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:00,332 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:00,333 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:00,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:00,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1466933163, now seen corresponding path program 44 times [2018-10-14 18:11:00,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 54155 backedges. 15115 proven. 870 refuted. 0 times theorem prover too weak. 38170 trivial. 0 not checked. [2018-10-14 18:11:03,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:03,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 18:11:03,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 18:11:03,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 18:11:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:11:03,581 INFO L87 Difference]: Start difference. First operand 2523 states and 2528 transitions. Second operand 43 states. [2018-10-14 18:11:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:11,421 INFO L93 Difference]: Finished difference Result 3271 states and 3280 transitions. [2018-10-14 18:11:11,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2018-10-14 18:11:11,421 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2480 [2018-10-14 18:11:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:11,426 INFO L225 Difference]: With dead ends: 3271 [2018-10-14 18:11:11,426 INFO L226 Difference]: Without dead ends: 3271 [2018-10-14 18:11:11,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34132 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9762, Invalid=72320, Unknown=0, NotChecked=0, Total=82082 [2018-10-14 18:11:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2018-10-14 18:11:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 2544. [2018-10-14 18:11:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2018-10-14 18:11:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 2550 transitions. [2018-10-14 18:11:11,454 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 2550 transitions. Word has length 2480 [2018-10-14 18:11:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:11,456 INFO L481 AbstractCegarLoop]: Abstraction has 2544 states and 2550 transitions. [2018-10-14 18:11:11,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 18:11:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 2550 transitions. [2018-10-14 18:11:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2502 [2018-10-14 18:11:11,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:11,505 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:11,506 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:11,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:11,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1483764063, now seen corresponding path program 45 times [2018-10-14 18:11:11,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 55300 backedges. 16327 proven. 853 refuted. 0 times theorem prover too weak. 38120 trivial. 0 not checked. [2018-10-14 18:11:16,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:16,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 18:11:16,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 18:11:16,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 18:11:16,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 18:11:16,793 INFO L87 Difference]: Start difference. First operand 2544 states and 2550 transitions. Second operand 50 states. [2018-10-14 18:11:28,055 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-10-14 18:11:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:29,433 INFO L93 Difference]: Finished difference Result 2940 states and 2949 transitions. [2018-10-14 18:11:29,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 18:11:29,434 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2501 [2018-10-14 18:11:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:29,437 INFO L225 Difference]: With dead ends: 2940 [2018-10-14 18:11:29,437 INFO L226 Difference]: Without dead ends: 2940 [2018-10-14 18:11:29,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4090 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3297, Invalid=13215, Unknown=0, NotChecked=0, Total=16512 [2018-10-14 18:11:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2018-10-14 18:11:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2558. [2018-10-14 18:11:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2018-10-14 18:11:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 2565 transitions. [2018-10-14 18:11:29,452 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 2565 transitions. Word has length 2501 [2018-10-14 18:11:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:29,453 INFO L481 AbstractCegarLoop]: Abstraction has 2558 states and 2565 transitions. [2018-10-14 18:11:29,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 18:11:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 2565 transitions. [2018-10-14 18:11:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2516 [2018-10-14 18:11:29,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:29,486 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:29,486 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:29,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:29,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1043384489, now seen corresponding path program 46 times [2018-10-14 18:11:29,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 56070 backedges. 16827 proven. 1073 refuted. 0 times theorem prover too weak. 38170 trivial. 0 not checked. [2018-10-14 18:11:32,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:32,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 18:11:32,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 18:11:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 18:11:32,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:11:32,872 INFO L87 Difference]: Start difference. First operand 2558 states and 2565 transitions. Second operand 47 states. [2018-10-14 18:11:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:42,563 INFO L93 Difference]: Finished difference Result 3529 states and 3543 transitions. [2018-10-14 18:11:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2018-10-14 18:11:42,563 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2515 [2018-10-14 18:11:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:42,568 INFO L225 Difference]: With dead ends: 3529 [2018-10-14 18:11:42,568 INFO L226 Difference]: Without dead ends: 3529 [2018-10-14 18:11:42,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46772 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12801, Invalid=97755, Unknown=0, NotChecked=0, Total=110556 [2018-10-14 18:11:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2018-10-14 18:11:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2714. [2018-10-14 18:11:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2018-10-14 18:11:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 2723 transitions. [2018-10-14 18:11:42,595 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 2723 transitions. Word has length 2515 [2018-10-14 18:11:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:42,596 INFO L481 AbstractCegarLoop]: Abstraction has 2714 states and 2723 transitions. [2018-10-14 18:11:42,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 18:11:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 2723 transitions. [2018-10-14 18:11:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2537 [2018-10-14 18:11:42,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:42,629 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:42,630 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:42,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:42,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1065831263, now seen corresponding path program 47 times [2018-10-14 18:11:42,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 57236 backedges. 8610 proven. 43666 refuted. 0 times theorem prover too weak. 4960 trivial. 0 not checked. [2018-10-14 18:11:47,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:47,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 18:11:47,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 18:11:47,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 18:11:47,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 18:11:47,736 INFO L87 Difference]: Start difference. First operand 2714 states and 2723 transitions. Second operand 46 states. [2018-10-14 18:11:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:56,164 INFO L93 Difference]: Finished difference Result 3462 states and 3473 transitions. [2018-10-14 18:11:56,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2018-10-14 18:11:56,165 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2536 [2018-10-14 18:11:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:56,169 INFO L225 Difference]: With dead ends: 3462 [2018-10-14 18:11:56,169 INFO L226 Difference]: Without dead ends: 3462 [2018-10-14 18:11:56,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35596 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=12251, Invalid=70405, Unknown=0, NotChecked=0, Total=82656 [2018-10-14 18:11:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2018-10-14 18:11:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3125. [2018-10-14 18:11:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2018-10-14 18:11:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 3135 transitions. [2018-10-14 18:11:56,194 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 3135 transitions. Word has length 2536 [2018-10-14 18:11:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:56,195 INFO L481 AbstractCegarLoop]: Abstraction has 3125 states and 3135 transitions. [2018-10-14 18:11:56,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 18:11:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 3135 transitions. [2018-10-14 18:11:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2906 [2018-10-14 18:11:56,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:56,239 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:56,239 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:56,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1197072643, now seen corresponding path program 48 times [2018-10-14 18:11:56,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 76933 backedges. 58825 proven. 10154 refuted. 0 times theorem prover too weak. 7954 trivial. 0 not checked. [2018-10-14 18:12:02,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:02,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 18:12:02,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 18:12:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 18:12:02,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1643, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:12:02,028 INFO L87 Difference]: Start difference. First operand 3125 states and 3135 transitions. Second operand 44 states. [2018-10-14 18:12:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:05,735 INFO L93 Difference]: Finished difference Result 3004 states and 3012 transitions. [2018-10-14 18:12:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-14 18:12:05,735 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2905 [2018-10-14 18:12:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:05,739 INFO L225 Difference]: With dead ends: 3004 [2018-10-14 18:12:05,739 INFO L226 Difference]: Without dead ends: 3004 [2018-10-14 18:12:05,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2059, Invalid=8861, Unknown=0, NotChecked=0, Total=10920 [2018-10-14 18:12:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2018-10-14 18:12:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 3004. [2018-10-14 18:12:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2018-10-14 18:12:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3012 transitions. [2018-10-14 18:12:05,755 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3012 transitions. Word has length 2905 [2018-10-14 18:12:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:05,757 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 3012 transitions. [2018-10-14 18:12:05,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 18:12:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3012 transitions. [2018-10-14 18:12:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2927 [2018-10-14 18:12:05,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:05,805 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 65, 65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:05,805 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:05,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1807032627, now seen corresponding path program 49 times [2018-10-14 18:12:05,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 78310 backedges. 37440 proven. 864 refuted. 0 times theorem prover too weak. 40006 trivial. 0 not checked. [2018-10-14 18:12:10,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:10,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 18:12:10,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 18:12:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 18:12:10,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:12:10,045 INFO L87 Difference]: Start difference. First operand 3004 states and 3012 transitions. Second operand 43 states. [2018-10-14 18:12:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:15,097 INFO L93 Difference]: Finished difference Result 3260 states and 3265 transitions. [2018-10-14 18:12:15,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-14 18:12:15,097 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2926 [2018-10-14 18:12:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:15,101 INFO L225 Difference]: With dead ends: 3260 [2018-10-14 18:12:15,101 INFO L226 Difference]: Without dead ends: 3104 [2018-10-14 18:12:15,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4566 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3078, Invalid=14214, Unknown=0, NotChecked=0, Total=17292 [2018-10-14 18:12:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2018-10-14 18:12:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 2983. [2018-10-14 18:12:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-10-14 18:12:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 2988 transitions. [2018-10-14 18:12:15,116 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 2988 transitions. Word has length 2926 [2018-10-14 18:12:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:15,117 INFO L481 AbstractCegarLoop]: Abstraction has 2983 states and 2988 transitions. [2018-10-14 18:12:15,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 18:12:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 2988 transitions. [2018-10-14 18:12:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2941 [2018-10-14 18:12:15,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:15,163 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:15,163 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:15,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2128354007, now seen corresponding path program 50 times [2018-10-14 18:12:15,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 79221 backedges. 21892 proven. 1020 refuted. 0 times theorem prover too weak. 56309 trivial. 0 not checked. [2018-10-14 18:12:21,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:21,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 18:12:21,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 18:12:21,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 18:12:21,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 18:12:21,664 INFO L87 Difference]: Start difference. First operand 2983 states and 2988 transitions. Second operand 54 states. [2018-10-14 18:12:30,649 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-14 18:12:30,800 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-14 18:12:31,227 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-14 18:12:31,390 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-14 18:12:31,836 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-14 18:12:32,002 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-14 18:12:32,452 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-14 18:12:32,669 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-14 18:12:33,145 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-14 18:12:33,325 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-10-14 18:12:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:35,247 INFO L93 Difference]: Finished difference Result 3211 states and 3218 transitions. [2018-10-14 18:12:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 18:12:35,247 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2940 [2018-10-14 18:12:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:35,251 INFO L225 Difference]: With dead ends: 3211 [2018-10-14 18:12:35,251 INFO L226 Difference]: Without dead ends: 3211 [2018-10-14 18:12:35,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4674 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3643, Invalid=15263, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 18:12:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2018-10-14 18:12:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 2997. [2018-10-14 18:12:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2997 states. [2018-10-14 18:12:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3003 transitions. [2018-10-14 18:12:35,268 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3003 transitions. Word has length 2940 [2018-10-14 18:12:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:35,269 INFO L481 AbstractCegarLoop]: Abstraction has 2997 states and 3003 transitions. [2018-10-14 18:12:35,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 18:12:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3003 transitions. [2018-10-14 18:12:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2955 [2018-10-14 18:12:35,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:35,313 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:35,313 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:35,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:35,313 INFO L82 PathProgramCache]: Analyzing trace with hash 696308467, now seen corresponding path program 51 times [2018-10-14 18:12:35,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 80146 backedges. 848 proven. 72247 refuted. 0 times theorem prover too weak. 7051 trivial. 0 not checked. [2018-10-14 18:12:41,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:41,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 18:12:41,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 18:12:41,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 18:12:41,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2328, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 18:12:41,819 INFO L87 Difference]: Start difference. First operand 2997 states and 3003 transitions. Second operand 52 states. [2018-10-14 18:12:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:53,511 INFO L93 Difference]: Finished difference Result 4016 states and 4027 transitions. [2018-10-14 18:12:53,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 289 states. [2018-10-14 18:12:53,511 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2954 [2018-10-14 18:12:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:53,515 INFO L225 Difference]: With dead ends: 4016 [2018-10-14 18:12:53,515 INFO L226 Difference]: Without dead ends: 4016 [2018-10-14 18:12:53,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48918 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15960, Invalid=97272, Unknown=0, NotChecked=0, Total=113232 [2018-10-14 18:12:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2018-10-14 18:12:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3571. [2018-10-14 18:12:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3571 states. [2018-10-14 18:12:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 3580 transitions. [2018-10-14 18:12:53,543 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 3580 transitions. Word has length 2954 [2018-10-14 18:12:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:53,544 INFO L481 AbstractCegarLoop]: Abstraction has 3571 states and 3580 transitions. [2018-10-14 18:12:53,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 18:12:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 3580 transitions. [2018-10-14 18:12:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3359 [2018-10-14 18:12:53,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:53,600 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:53,601 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:53,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash 251828797, now seen corresponding path program 52 times [2018-10-14 18:12:53,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 105866 backedges. 82251 proven. 13510 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2018-10-14 18:13:01,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:01,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 18:13:01,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 18:13:01,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 18:13:01,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 18:13:01,726 INFO L87 Difference]: Start difference. First operand 3571 states and 3580 transitions. Second operand 48 states. [2018-10-14 18:13:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:05,798 INFO L93 Difference]: Finished difference Result 3436 states and 3443 transitions. [2018-10-14 18:13:05,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 18:13:05,798 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 3358 [2018-10-14 18:13:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:05,801 INFO L225 Difference]: With dead ends: 3436 [2018-10-14 18:13:05,801 INFO L226 Difference]: Without dead ends: 3436 [2018-10-14 18:13:05,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2472, Invalid=10638, Unknown=0, NotChecked=0, Total=13110 [2018-10-14 18:13:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-10-14 18:13:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3436. [2018-10-14 18:13:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-14 18:13:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 3443 transitions. [2018-10-14 18:13:05,818 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 3443 transitions. Word has length 3358 [2018-10-14 18:13:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:05,819 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 3443 transitions. [2018-10-14 18:13:05,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 18:13:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 3443 transitions. [2018-10-14 18:13:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3380 [2018-10-14 18:13:05,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:05,876 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:05,876 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:05,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash -79714701, now seen corresponding path program 53 times [2018-10-14 18:13:05,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 107475 backedges. 48099 proven. 1032 refuted. 0 times theorem prover too weak. 58344 trivial. 0 not checked. [2018-10-14 18:13:13,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:13,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 18:13:13,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 18:13:13,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 18:13:13,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:13:13,007 INFO L87 Difference]: Start difference. First operand 3436 states and 3443 transitions. Second operand 47 states. [2018-10-14 18:13:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:18,968 INFO L93 Difference]: Finished difference Result 3554 states and 3559 transitions. [2018-10-14 18:13:18,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-14 18:13:18,968 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 3379 [2018-10-14 18:13:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:18,972 INFO L225 Difference]: With dead ends: 3554 [2018-10-14 18:13:18,972 INFO L226 Difference]: Without dead ends: 3554 [2018-10-14 18:13:18,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5573 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3712, Invalid=17168, Unknown=0, NotChecked=0, Total=20880 [2018-10-14 18:13:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2018-10-14 18:13:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3436. [2018-10-14 18:13:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-14 18:13:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 3441 transitions. [2018-10-14 18:13:18,989 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 3441 transitions. Word has length 3379 [2018-10-14 18:13:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:18,990 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 3441 transitions. [2018-10-14 18:13:18,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 18:13:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 3441 transitions. [2018-10-14 18:13:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3394 [2018-10-14 18:13:19,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:19,050 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:19,050 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:19,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:19,051 INFO L82 PathProgramCache]: Analyzing trace with hash 793337193, now seen corresponding path program 54 times [2018-10-14 18:13:19,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 108555 backedges. 26807 proven. 1297 refuted. 0 times theorem prover too weak. 80451 trivial. 0 not checked. [2018-10-14 18:13:25,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:25,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 18:13:25,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 18:13:25,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 18:13:25,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:13:25,220 INFO L87 Difference]: Start difference. First operand 3436 states and 3441 transitions. Second operand 51 states. [2018-10-14 18:13:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:37,167 INFO L93 Difference]: Finished difference Result 4282 states and 4291 transitions. [2018-10-14 18:13:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 332 states. [2018-10-14 18:13:37,168 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 3393 [2018-10-14 18:13:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:37,172 INFO L225 Difference]: With dead ends: 4282 [2018-10-14 18:13:37,172 INFO L226 Difference]: Without dead ends: 4282 [2018-10-14 18:13:37,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61714 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=16364, Invalid=126142, Unknown=0, NotChecked=0, Total=142506 [2018-10-14 18:13:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2018-10-14 18:13:37,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 3457. [2018-10-14 18:13:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2018-10-14 18:13:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 3463 transitions. [2018-10-14 18:13:37,210 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 3463 transitions. Word has length 3393 [2018-10-14 18:13:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:37,212 INFO L481 AbstractCegarLoop]: Abstraction has 3457 states and 3463 transitions. [2018-10-14 18:13:37,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 18:13:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 3463 transitions. [2018-10-14 18:13:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3415 [2018-10-14 18:13:37,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:37,290 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:37,290 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:37,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash -391417485, now seen corresponding path program 55 times [2018-10-14 18:13:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:38,608 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:13:38,830 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:13:39,068 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 18:13:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 110185 backedges. 28593 proven. 1201 refuted. 0 times theorem prover too weak. 80391 trivial. 0 not checked. [2018-10-14 18:13:46,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:46,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 18:13:46,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 18:13:46,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 18:13:46,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2960, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 18:13:46,687 INFO L87 Difference]: Start difference. First operand 3457 states and 3463 transitions. Second operand 58 states. [2018-10-14 18:13:56,588 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-10-14 18:13:57,812 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-10-14 18:13:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:59,391 INFO L93 Difference]: Finished difference Result 3881 states and 3890 transitions. [2018-10-14 18:13:59,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 18:13:59,392 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 3414 [2018-10-14 18:13:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:59,396 INFO L225 Difference]: With dead ends: 3881 [2018-10-14 18:13:59,396 INFO L226 Difference]: Without dead ends: 3881 [2018-10-14 18:13:59,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=4508, Invalid=18142, Unknown=0, NotChecked=0, Total=22650 [2018-10-14 18:13:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2018-10-14 18:13:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3471. [2018-10-14 18:13:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2018-10-14 18:13:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 3478 transitions. [2018-10-14 18:13:59,414 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 3478 transitions. Word has length 3414 [2018-10-14 18:13:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:59,415 INFO L481 AbstractCegarLoop]: Abstraction has 3471 states and 3478 transitions. [2018-10-14 18:13:59,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 18:13:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 3478 transitions. [2018-10-14 18:13:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3429 [2018-10-14 18:13:59,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:59,472 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:59,472 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:59,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1347425725, now seen corresponding path program 56 times [2018-10-14 18:13:59,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 111279 backedges. 29286 proven. 1542 refuted. 0 times theorem prover too weak. 80451 trivial. 0 not checked. [2018-10-14 18:14:05,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:05,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 18:14:05,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 18:14:05,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 18:14:05,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2596, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 18:14:05,998 INFO L87 Difference]: Start difference. First operand 3471 states and 3478 transitions. Second operand 55 states. [2018-10-14 18:14:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:20,088 INFO L93 Difference]: Finished difference Result 4568 states and 4582 transitions. [2018-10-14 18:14:20,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 380 states. [2018-10-14 18:14:20,088 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 3428 [2018-10-14 18:14:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:20,094 INFO L225 Difference]: With dead ends: 4568 [2018-10-14 18:14:20,094 INFO L226 Difference]: Without dead ends: 4568 [2018-10-14 18:14:20,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80961 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=20805, Invalid=163665, Unknown=0, NotChecked=0, Total=184470 [2018-10-14 18:14:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4568 states. [2018-10-14 18:14:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4568 to 3655. [2018-10-14 18:14:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3655 states. [2018-10-14 18:14:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 3664 transitions. [2018-10-14 18:14:20,132 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 3664 transitions. Word has length 3428 [2018-10-14 18:14:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:20,133 INFO L481 AbstractCegarLoop]: Abstraction has 3655 states and 3664 transitions. [2018-10-14 18:14:20,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 18:14:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 3664 transitions. [2018-10-14 18:14:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3450 [2018-10-14 18:14:20,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:20,214 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:14:20,214 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:20,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:20,215 INFO L82 PathProgramCache]: Analyzing trace with hash 109950323, now seen corresponding path program 57 times [2018-10-14 18:14:20,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat