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_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:21:30,530 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:21:30,532 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:21:30,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:21:30,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:21:30,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:21:30,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:21:30,550 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:21:30,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:21:30,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:21:30,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:21:30,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:21:30,554 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:21:30,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:21:30,557 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:21:30,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:21:30,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:21:30,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:21:30,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:21:30,564 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:21:30,565 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:21:30,566 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:21:30,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:21:30,569 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:21:30,569 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:21:30,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:21:30,571 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:21:30,572 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:21:30,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:21:30,574 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:21:30,574 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:21:30,575 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:21:30,575 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:21:30,575 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:21:30,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:21:30,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:21:30,577 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-10 16:21:30,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:21:30,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:21:30,588 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:21:30,588 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:21:30,588 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:21:30,589 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:21:30,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:21:30,590 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:21:30,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:21:30,590 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:21:30,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:21:30,590 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:21:30,591 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:21:30,591 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:21:30,592 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:21:30,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:21:30,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:21:30,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:21:30,664 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:21:30,664 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:21:30,665 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_20.bpl [2018-10-10 16:21:30,666 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl' [2018-10-10 16:21:30,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:21:30,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:21:30,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:21:30,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:21:30,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:21:30,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:30" (1/1) ... [2018-10-10 16:21:30,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:30" (1/1) ... [2018-10-10 16:21:30,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:30" (1/1) ... [2018-10-10 16:21:30,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:30" (1/1) ... [2018-10-10 16:21:30,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:30" (1/1) ... [2018-10-10 16:21:30,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:30" (1/1) ... [2018-10-10 16:21:30,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:30" (1/1) ... [2018-10-10 16:21:30,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:21:30,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:21:30,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:21:30,813 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:21:30,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:30" (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-10 16:21:30,887 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:21:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:21:30,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:21:31,581 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:21:31,581 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:21:31 BoogieIcfgContainer [2018-10-10 16:21:31,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:21:31,582 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:21:31,582 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:21:31,583 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:21:31,587 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:21:31" (1/1) ... [2018-10-10 16:21:31,597 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:21:31,597 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:21:31,644 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:21:31,691 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:21:31,709 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:21:31,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:22:32,373 INFO L315 AbstractInterpreter]: Visited 110 different actions 474 times. Merged at 91 different actions 353 times. Widened at 5 different actions 6 times. Found 11 fixpoints after 6 different actions. Largest state had 0 variables. [2018-10-10 16:22:32,377 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:22:32,381 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:22:32,397 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_7|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:22:32,399 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_7|) |v_ULTIMATE.start_read~int_#ptr.offset_5|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:22:32,440 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-10 16:22:32,443 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-10 16:22:32,444 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-10 16:22:32,507 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-10 16:22:32,510 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:22:32,510 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:32,511 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:32,512 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-10 16:22:32,512 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:32,512 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:32,512 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-10 16:22:32,513 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:32,513 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:32,513 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:32,513 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-10 16:22:32,515 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:32,516 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:32,516 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-10 16:22:32,516 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:32,518 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:22:32,569 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:32 BasicIcfg [2018-10-10 16:22:32,569 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:22:32,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:22:32,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:22:32,578 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:22:32,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:30" (1/3) ... [2018-10-10 16:22:32,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444e422f and model type ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:22:32, skipping insertion in model container [2018-10-10 16:22:32,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:21:31" (2/3) ... [2018-10-10 16:22:32,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444e422f and model type ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:22:32, skipping insertion in model container [2018-10-10 16:22:32,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:32" (3/3) ... [2018-10-10 16:22:32,584 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:22:32,595 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:22:32,612 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:22:32,632 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:22:32,664 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:22:32,665 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:22:32,666 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:22:32,666 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:22:32,666 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:22:32,666 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:22:32,666 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:22:32,666 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:22:32,667 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:22:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-10-10 16:22:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 16:22:32,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:32,709 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] [2018-10-10 16:22:32,710 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:32,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash 219326866, now seen corresponding path program 1 times [2018-10-10 16:22:32,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:33,278 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-10 16:22:33,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:22:33,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 16:22:33,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 16:22:33,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 16:22:33,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:22:33,302 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 6 states. [2018-10-10 16:22:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:33,983 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-10-10 16:22:33,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 16:22:33,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-10-10 16:22:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:34,003 INFO L225 Difference]: With dead ends: 177 [2018-10-10 16:22:34,004 INFO L226 Difference]: Without dead ends: 177 [2018-10-10 16:22:34,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-10 16:22:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 126. [2018-10-10 16:22:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-10 16:22:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-10-10 16:22:34,068 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 41 [2018-10-10 16:22:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:34,069 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-10-10 16:22:34,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 16:22:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-10-10 16:22:34,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 16:22:34,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:34,077 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 16:22:34,077 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:34,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:34,078 INFO L82 PathProgramCache]: Analyzing trace with hash 269123840, now seen corresponding path program 1 times [2018-10-10 16:22:34,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 16:22:35,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:35,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:22:35,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:22:35,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:22:35,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:22:35,366 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 19 states. [2018-10-10 16:22:37,755 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-10 16:22:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:37,897 INFO L93 Difference]: Finished difference Result 246 states and 252 transitions. [2018-10-10 16:22:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 16:22:37,898 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 95 [2018-10-10 16:22:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:37,902 INFO L225 Difference]: With dead ends: 246 [2018-10-10 16:22:37,902 INFO L226 Difference]: Without dead ends: 246 [2018-10-10 16:22:37,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=461, Invalid=1891, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:22:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-10 16:22:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 130. [2018-10-10 16:22:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-10 16:22:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2018-10-10 16:22:37,916 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 95 [2018-10-10 16:22:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:37,917 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2018-10-10 16:22:37,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:22:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2018-10-10 16:22:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 16:22:37,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:37,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:22:37,922 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:37,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:37,922 INFO L82 PathProgramCache]: Analyzing trace with hash -630936978, now seen corresponding path program 1 times [2018-10-10 16:22:37,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:22:38,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:38,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:38,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:38,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:38,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:38,136 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand 10 states. [2018-10-10 16:22:38,747 WARN L178 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-10 16:22:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:39,072 INFO L93 Difference]: Finished difference Result 320 states and 327 transitions. [2018-10-10 16:22:39,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:22:39,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-10-10 16:22:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:39,076 INFO L225 Difference]: With dead ends: 320 [2018-10-10 16:22:39,076 INFO L226 Difference]: Without dead ends: 320 [2018-10-10 16:22:39,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:22:39,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-10 16:22:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 218. [2018-10-10 16:22:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-10 16:22:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 223 transitions. [2018-10-10 16:22:39,100 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 223 transitions. Word has length 116 [2018-10-10 16:22:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:39,101 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 223 transitions. [2018-10-10 16:22:39,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-10-10 16:22:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 16:22:39,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:39,104 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:22:39,105 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:39,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:39,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1008595520, now seen corresponding path program 2 times [2018-10-10 16:22:39,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 16:22:39,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:39,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:22:39,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:22:39,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:22:39,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:22:39,290 INFO L87 Difference]: Start difference. First operand 218 states and 223 transitions. Second operand 8 states. [2018-10-10 16:22:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:39,589 INFO L93 Difference]: Finished difference Result 269 states and 274 transitions. [2018-10-10 16:22:39,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:22:39,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2018-10-10 16:22:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:39,592 INFO L225 Difference]: With dead ends: 269 [2018-10-10 16:22:39,592 INFO L226 Difference]: Without dead ends: 269 [2018-10-10 16:22:39,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:22:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-10 16:22:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-10-10 16:22:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-10 16:22:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 222 transitions. [2018-10-10 16:22:39,604 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 222 transitions. Word has length 170 [2018-10-10 16:22:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:39,604 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 222 transitions. [2018-10-10 16:22:39,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:22:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2018-10-10 16:22:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 16:22:39,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:39,608 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:39,609 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:39,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1102948370, now seen corresponding path program 3 times [2018-10-10 16:22:39,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 92 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-10 16:22:39,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:39,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:39,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:39,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:39,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:39,894 INFO L87 Difference]: Start difference. First operand 218 states and 222 transitions. Second operand 10 states. [2018-10-10 16:22:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:40,271 INFO L93 Difference]: Finished difference Result 327 states and 334 transitions. [2018-10-10 16:22:40,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 16:22:40,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2018-10-10 16:22:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:40,274 INFO L225 Difference]: With dead ends: 327 [2018-10-10 16:22:40,274 INFO L226 Difference]: Without dead ends: 327 [2018-10-10 16:22:40,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:22:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-10 16:22:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 227. [2018-10-10 16:22:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-10 16:22:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2018-10-10 16:22:40,284 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 191 [2018-10-10 16:22:40,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:40,284 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2018-10-10 16:22:40,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2018-10-10 16:22:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-10 16:22:40,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:40,289 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, 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, 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] [2018-10-10 16:22:40,289 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:40,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash 123824574, now seen corresponding path program 1 times [2018-10-10 16:22:40,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:41,191 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-10-10 16:22:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:22:41,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:41,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:22:41,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:22:41,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:22:41,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:22:41,690 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 23 states. [2018-10-10 16:22:42,769 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-10 16:22:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:45,075 INFO L93 Difference]: Finished difference Result 552 states and 565 transitions. [2018-10-10 16:22:45,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:22:45,077 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 205 [2018-10-10 16:22:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:45,082 INFO L225 Difference]: With dead ends: 552 [2018-10-10 16:22:45,082 INFO L226 Difference]: Without dead ends: 552 [2018-10-10 16:22:45,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=480, Invalid=3060, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:22:45,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-10 16:22:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 306. [2018-10-10 16:22:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-10 16:22:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 312 transitions. [2018-10-10 16:22:45,095 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 312 transitions. Word has length 205 [2018-10-10 16:22:45,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:45,096 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 312 transitions. [2018-10-10 16:22:45,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:22:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 312 transitions. [2018-10-10 16:22:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-10 16:22:45,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:45,101 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, 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] [2018-10-10 16:22:45,101 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:45,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:45,101 INFO L82 PathProgramCache]: Analyzing trace with hash -47233936, now seen corresponding path program 2 times [2018-10-10 16:22:45,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 11 proven. 164 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 16:22:45,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:45,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:22:45,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:22:45,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:22:45,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:22:45,972 INFO L87 Difference]: Start difference. First operand 306 states and 312 transitions. Second operand 14 states. [2018-10-10 16:22:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:46,774 INFO L93 Difference]: Finished difference Result 430 states and 439 transitions. [2018-10-10 16:22:46,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:22:46,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 226 [2018-10-10 16:22:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:46,778 INFO L225 Difference]: With dead ends: 430 [2018-10-10 16:22:46,778 INFO L226 Difference]: Without dead ends: 430 [2018-10-10 16:22:46,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:22:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-10 16:22:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 328. [2018-10-10 16:22:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-10 16:22:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 335 transitions. [2018-10-10 16:22:46,787 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 335 transitions. Word has length 226 [2018-10-10 16:22:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:46,788 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 335 transitions. [2018-10-10 16:22:46,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:22:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 335 transitions. [2018-10-10 16:22:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-10 16:22:46,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:46,792 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 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] [2018-10-10 16:22:46,792 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:46,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash 705697168, now seen corresponding path program 3 times [2018-10-10 16:22:46,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 160 proven. 94 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-10 16:22:47,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:47,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:47,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:47,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:47,013 INFO L87 Difference]: Start difference. First operand 328 states and 335 transitions. Second operand 10 states. [2018-10-10 16:22:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:47,280 INFO L93 Difference]: Finished difference Result 344 states and 349 transitions. [2018-10-10 16:22:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:22:47,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-10-10 16:22:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:47,289 INFO L225 Difference]: With dead ends: 344 [2018-10-10 16:22:47,289 INFO L226 Difference]: Without dead ends: 344 [2018-10-10 16:22:47,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:22:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-10 16:22:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 328. [2018-10-10 16:22:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-10 16:22:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 333 transitions. [2018-10-10 16:22:47,297 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 333 transitions. Word has length 259 [2018-10-10 16:22:47,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:47,297 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 333 transitions. [2018-10-10 16:22:47,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:47,297 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 333 transitions. [2018-10-10 16:22:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-10 16:22:47,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:47,299 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:22:47,300 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:47,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:47,300 INFO L82 PathProgramCache]: Analyzing trace with hash 827963074, now seen corresponding path program 4 times [2018-10-10 16:22:47,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 185 proven. 118 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-10 16:22:48,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:48,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:22:48,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:22:48,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:22:48,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:22:48,113 INFO L87 Difference]: Start difference. First operand 328 states and 333 transitions. Second operand 12 states. [2018-10-10 16:22:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:48,470 INFO L93 Difference]: Finished difference Result 346 states and 350 transitions. [2018-10-10 16:22:48,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 16:22:48,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 280 [2018-10-10 16:22:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:48,473 INFO L225 Difference]: With dead ends: 346 [2018-10-10 16:22:48,473 INFO L226 Difference]: Without dead ends: 346 [2018-10-10 16:22:48,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:22:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-10 16:22:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-10-10 16:22:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-10 16:22:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2018-10-10 16:22:48,480 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 280 [2018-10-10 16:22:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:48,481 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2018-10-10 16:22:48,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:22:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2018-10-10 16:22:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-10 16:22:48,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:48,483 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:48,483 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:48,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:48,483 INFO L82 PathProgramCache]: Analyzing trace with hash 573384912, now seen corresponding path program 5 times [2018-10-10 16:22:48,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 191 proven. 159 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-10 16:22:49,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:22:49,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:22:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:22:49,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:22:49,004 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 12 states. [2018-10-10 16:22:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:49,449 INFO L93 Difference]: Finished difference Result 362 states and 366 transitions. [2018-10-10 16:22:49,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:22:49,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 301 [2018-10-10 16:22:49,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:49,452 INFO L225 Difference]: With dead ends: 362 [2018-10-10 16:22:49,452 INFO L226 Difference]: Without dead ends: 362 [2018-10-10 16:22:49,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:22:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-10 16:22:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 347. [2018-10-10 16:22:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-10 16:22:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2018-10-10 16:22:49,460 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 301 [2018-10-10 16:22:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:49,461 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2018-10-10 16:22:49,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:22:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2018-10-10 16:22:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-10 16:22:49,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:49,463 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:49,463 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:49,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1602864636, now seen corresponding path program 6 times [2018-10-10 16:22:49,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 191 proven. 176 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-10 16:22:50,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:50,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:22:50,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:22:50,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:22:50,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:22:50,077 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 14 states. [2018-10-10 16:22:50,702 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-10 16:22:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:51,102 INFO L93 Difference]: Finished difference Result 364 states and 368 transitions. [2018-10-10 16:22:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:22:51,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 315 [2018-10-10 16:22:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:51,106 INFO L225 Difference]: With dead ends: 364 [2018-10-10 16:22:51,106 INFO L226 Difference]: Without dead ends: 364 [2018-10-10 16:22:51,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:22:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-10 16:22:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2018-10-10 16:22:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-10 16:22:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 365 transitions. [2018-10-10 16:22:51,114 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 365 transitions. Word has length 315 [2018-10-10 16:22:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:51,115 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 365 transitions. [2018-10-10 16:22:51,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:22:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 365 transitions. [2018-10-10 16:22:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-10 16:22:51,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:51,117 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:51,118 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:51,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:51,118 INFO L82 PathProgramCache]: Analyzing trace with hash 231073320, now seen corresponding path program 7 times [2018-10-10 16:22:51,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:51,661 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:22:51,888 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:22:52,141 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-10 16:22:52,431 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-10 16:22:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 121 proven. 286 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-10 16:22:53,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:53,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:22:53,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:22:53,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:22:53,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:22:53,195 INFO L87 Difference]: Start difference. First operand 361 states and 365 transitions. Second operand 26 states. [2018-10-10 16:22:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:57,190 INFO L93 Difference]: Finished difference Result 459 states and 465 transitions. [2018-10-10 16:22:57,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:22:57,191 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 329 [2018-10-10 16:22:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:57,195 INFO L225 Difference]: With dead ends: 459 [2018-10-10 16:22:57,196 INFO L226 Difference]: Without dead ends: 459 [2018-10-10 16:22:57,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=849, Invalid=3441, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 16:22:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-10 16:22:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 364. [2018-10-10 16:22:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-10 16:22:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 368 transitions. [2018-10-10 16:22:57,205 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 368 transitions. Word has length 329 [2018-10-10 16:22:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:57,206 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 368 transitions. [2018-10-10 16:22:57,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:22:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 368 transitions. [2018-10-10 16:22:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-10 16:22:57,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:57,209 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:57,209 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:57,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash 386895430, now seen corresponding path program 8 times [2018-10-10 16:22:57,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 2 proven. 485 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-10 16:22:59,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:59,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:22:59,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:22:59,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:22:59,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2268, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:22:59,466 INFO L87 Difference]: Start difference. First operand 364 states and 368 transitions. Second operand 50 states. [2018-10-10 16:23:00,604 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 16:23:01,049 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-10-10 16:23:01,437 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-10-10 16:23:04,557 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-10-10 16:23:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:11,887 INFO L93 Difference]: Finished difference Result 587 states and 595 transitions. [2018-10-10 16:23:11,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-10 16:23:11,888 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 350 [2018-10-10 16:23:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:11,890 INFO L225 Difference]: With dead ends: 587 [2018-10-10 16:23:11,890 INFO L226 Difference]: Without dead ends: 587 [2018-10-10 16:23:11,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5558 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2037, Invalid=16323, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 16:23:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-10-10 16:23:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 488. [2018-10-10 16:23:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-10 16:23:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 494 transitions. [2018-10-10 16:23:11,905 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 494 transitions. Word has length 350 [2018-10-10 16:23:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:11,906 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 494 transitions. [2018-10-10 16:23:11,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:23:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 494 transitions. [2018-10-10 16:23:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-10 16:23:11,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:11,909 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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-10 16:23:11,909 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:11,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:11,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1182192412, now seen corresponding path program 9 times [2018-10-10 16:23:11,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 649 proven. 326 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-10 16:23:12,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:12,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:23:12,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:23:12,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:23:12,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:23:12,358 INFO L87 Difference]: Start difference. First operand 488 states and 494 transitions. Second operand 16 states. [2018-10-10 16:23:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:12,945 INFO L93 Difference]: Finished difference Result 527 states and 533 transitions. [2018-10-10 16:23:12,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:23:12,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 474 [2018-10-10 16:23:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:12,950 INFO L225 Difference]: With dead ends: 527 [2018-10-10 16:23:12,950 INFO L226 Difference]: Without dead ends: 527 [2018-10-10 16:23:12,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:23:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-10 16:23:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-10-10 16:23:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-10 16:23:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 533 transitions. [2018-10-10 16:23:12,959 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 533 transitions. Word has length 474 [2018-10-10 16:23:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:12,960 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 533 transitions. [2018-10-10 16:23:12,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:23:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 533 transitions. [2018-10-10 16:23:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-10-10 16:23:12,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:12,963 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, 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, 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, 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-10 16:23:12,964 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:12,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -399603010, now seen corresponding path program 10 times [2018-10-10 16:23:12,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 765 proven. 80 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-10-10 16:23:13,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:13,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:23:13,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:23:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:23:13,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:23:13,626 INFO L87 Difference]: Start difference. First operand 527 states and 533 transitions. Second operand 15 states. [2018-10-10 16:23:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:14,690 INFO L93 Difference]: Finished difference Result 544 states and 550 transitions. [2018-10-10 16:23:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 16:23:14,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 495 [2018-10-10 16:23:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:14,694 INFO L225 Difference]: With dead ends: 544 [2018-10-10 16:23:14,694 INFO L226 Difference]: Without dead ends: 544 [2018-10-10 16:23:14,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:23:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-10-10 16:23:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 541. [2018-10-10 16:23:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-10-10 16:23:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 547 transitions. [2018-10-10 16:23:14,703 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 547 transitions. Word has length 495 [2018-10-10 16:23:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:14,704 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 547 transitions. [2018-10-10 16:23:14,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:23:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 547 transitions. [2018-10-10 16:23:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-10 16:23:14,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:14,707 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:14,708 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:14,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:14,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1632430354, now seen corresponding path program 11 times [2018-10-10 16:23:14,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:15,319 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:23:15,580 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:23:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 553 proven. 635 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-10 16:23:16,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:16,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:23:16,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:23:16,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:23:16,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:23:16,632 INFO L87 Difference]: Start difference. First operand 541 states and 547 transitions. Second operand 31 states. [2018-10-10 16:23:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:21,169 INFO L93 Difference]: Finished difference Result 653 states and 661 transitions. [2018-10-10 16:23:21,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:23:21,169 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 509 [2018-10-10 16:23:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:21,173 INFO L225 Difference]: With dead ends: 653 [2018-10-10 16:23:21,173 INFO L226 Difference]: Without dead ends: 653 [2018-10-10 16:23:21,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1067, Invalid=4785, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 16:23:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-10-10 16:23:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 544. [2018-10-10 16:23:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-10 16:23:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 550 transitions. [2018-10-10 16:23:21,182 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 550 transitions. Word has length 509 [2018-10-10 16:23:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:21,183 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 550 transitions. [2018-10-10 16:23:21,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:23:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 550 transitions. [2018-10-10 16:23:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-10 16:23:21,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:21,187 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:21,187 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:21,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:21,188 INFO L82 PathProgramCache]: Analyzing trace with hash 261775772, now seen corresponding path program 12 times [2018-10-10 16:23:21,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1466 backedges. 553 proven. 811 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-10 16:23:22,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:22,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 16:23:22,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 16:23:22,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 16:23:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:23:22,688 INFO L87 Difference]: Start difference. First operand 544 states and 550 transitions. Second operand 33 states. [2018-10-10 16:23:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:28,740 INFO L93 Difference]: Finished difference Result 754 states and 764 transitions. [2018-10-10 16:23:28,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 16:23:28,741 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 530 [2018-10-10 16:23:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:28,743 INFO L225 Difference]: With dead ends: 754 [2018-10-10 16:23:28,743 INFO L226 Difference]: Without dead ends: 754 [2018-10-10 16:23:28,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1371, Invalid=6285, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 16:23:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-10 16:23:28,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 565. [2018-10-10 16:23:28,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-10 16:23:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 572 transitions. [2018-10-10 16:23:28,754 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 572 transitions. Word has length 530 [2018-10-10 16:23:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:28,755 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 572 transitions. [2018-10-10 16:23:28,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 16:23:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 572 transitions. [2018-10-10 16:23:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-10-10 16:23:28,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:28,759 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:28,759 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:28,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:28,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1996391250, now seen corresponding path program 13 times [2018-10-10 16:23:28,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 99 proven. 1412 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-10 16:23:30,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:30,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:23:30,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:23:30,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:23:30,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:23:30,211 INFO L87 Difference]: Start difference. First operand 565 states and 572 transitions. Second operand 22 states. [2018-10-10 16:23:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:31,952 INFO L93 Difference]: Finished difference Result 846 states and 856 transitions. [2018-10-10 16:23:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 16:23:31,953 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 551 [2018-10-10 16:23:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:31,957 INFO L225 Difference]: With dead ends: 846 [2018-10-10 16:23:31,957 INFO L226 Difference]: Without dead ends: 846 [2018-10-10 16:23:31,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2287 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1320, Invalid=5652, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 16:23:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-10-10 16:23:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 766. [2018-10-10 16:23:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-10-10 16:23:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 775 transitions. [2018-10-10 16:23:31,969 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 775 transitions. Word has length 551 [2018-10-10 16:23:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:31,969 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 775 transitions. [2018-10-10 16:23:31,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:23:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 775 transitions. [2018-10-10 16:23:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2018-10-10 16:23:31,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:31,993 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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-10 16:23:31,993 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:31,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:31,994 INFO L82 PathProgramCache]: Analyzing trace with hash -459428346, now seen corresponding path program 14 times [2018-10-10 16:23:31,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 1592 proven. 992 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-10-10 16:23:32,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:32,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:23:32,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:23:32,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:23:32,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:23:32,849 INFO L87 Difference]: Start difference. First operand 766 states and 775 transitions. Second operand 22 states. [2018-10-10 16:23:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:34,943 INFO L93 Difference]: Finished difference Result 783 states and 792 transitions. [2018-10-10 16:23:34,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 16:23:34,948 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 710 [2018-10-10 16:23:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:34,951 INFO L225 Difference]: With dead ends: 783 [2018-10-10 16:23:34,951 INFO L226 Difference]: Without dead ends: 783 [2018-10-10 16:23:34,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=473, Invalid=1977, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:23:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-10 16:23:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 780. [2018-10-10 16:23:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-10-10 16:23:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 789 transitions. [2018-10-10 16:23:34,961 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 789 transitions. Word has length 710 [2018-10-10 16:23:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:34,962 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 789 transitions. [2018-10-10 16:23:34,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:23:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 789 transitions. [2018-10-10 16:23:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2018-10-10 16:23:34,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:34,968 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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-10 16:23:34,968 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:34,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:34,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2028849830, now seen corresponding path program 15 times [2018-10-10 16:23:34,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 1867 proven. 93 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-10-10 16:23:35,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:35,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:23:35,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:23:35,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:23:35,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:23:35,569 INFO L87 Difference]: Start difference. First operand 780 states and 789 transitions. Second operand 19 states. [2018-10-10 16:23:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:37,638 INFO L93 Difference]: Finished difference Result 1173 states and 1185 transitions. [2018-10-10 16:23:37,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 16:23:37,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 724 [2018-10-10 16:23:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:37,645 INFO L225 Difference]: With dead ends: 1173 [2018-10-10 16:23:37,645 INFO L226 Difference]: Without dead ends: 1119 [2018-10-10 16:23:37,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3508 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1659, Invalid=8043, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 16:23:37,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-10 16:23:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 902. [2018-10-10 16:23:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-10 16:23:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 912 transitions. [2018-10-10 16:23:37,659 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 912 transitions. Word has length 724 [2018-10-10 16:23:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:37,660 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 912 transitions. [2018-10-10 16:23:37,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:23:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 912 transitions. [2018-10-10 16:23:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2018-10-10 16:23:37,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:37,666 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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-10 16:23:37,666 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:37,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:37,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2105626224, now seen corresponding path program 16 times [2018-10-10 16:23:37,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3357 backedges. 1582 proven. 1484 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-10-10 16:23:39,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:39,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:23:39,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:23:39,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:23:39,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:23:39,911 INFO L87 Difference]: Start difference. First operand 902 states and 912 transitions. Second operand 37 states. [2018-10-10 16:23:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:46,902 INFO L93 Difference]: Finished difference Result 1140 states and 1154 transitions. [2018-10-10 16:23:46,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 16:23:46,902 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 745 [2018-10-10 16:23:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:46,906 INFO L225 Difference]: With dead ends: 1140 [2018-10-10 16:23:46,906 INFO L226 Difference]: Without dead ends: 1140 [2018-10-10 16:23:46,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2319 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1629, Invalid=7877, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 16:23:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-10-10 16:23:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 923. [2018-10-10 16:23:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-10 16:23:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 934 transitions. [2018-10-10 16:23:46,918 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 934 transitions. Word has length 745 [2018-10-10 16:23:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:46,918 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 934 transitions. [2018-10-10 16:23:46,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:23:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 934 transitions. [2018-10-10 16:23:46,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2018-10-10 16:23:46,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:46,925 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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-10 16:23:46,925 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:46,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:46,926 INFO L82 PathProgramCache]: Analyzing trace with hash -156797986, now seen corresponding path program 17 times [2018-10-10 16:23:46,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 179 proven. 3111 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-10-10 16:23:47,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:47,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:23:47,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:23:47,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:23:47,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:23:47,952 INFO L87 Difference]: Start difference. First operand 923 states and 934 transitions. Second operand 26 states. [2018-10-10 16:23:50,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:50,024 INFO L93 Difference]: Finished difference Result 1232 states and 1246 transitions. [2018-10-10 16:23:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 16:23:50,027 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 766 [2018-10-10 16:23:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:50,031 INFO L225 Difference]: With dead ends: 1232 [2018-10-10 16:23:50,032 INFO L226 Difference]: Without dead ends: 1232 [2018-10-10 16:23:50,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2122, Invalid=9868, Unknown=0, NotChecked=0, Total=11990 [2018-10-10 16:23:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2018-10-10 16:23:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1138. [2018-10-10 16:23:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-10-10 16:23:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1151 transitions. [2018-10-10 16:23:50,045 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1151 transitions. Word has length 766 [2018-10-10 16:23:50,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:50,046 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1151 transitions. [2018-10-10 16:23:50,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:23:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1151 transitions. [2018-10-10 16:23:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2018-10-10 16:23:50,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:50,055 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, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 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-10 16:23:50,056 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:50,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:50,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1659834400, now seen corresponding path program 18 times [2018-10-10 16:23:50,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 4057 proven. 1324 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-10-10 16:23:51,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:51,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:23:51,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:23:51,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:23:51,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:23:51,338 INFO L87 Difference]: Start difference. First operand 1138 states and 1151 transitions. Second operand 24 states. [2018-10-10 16:23:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:52,627 INFO L93 Difference]: Finished difference Result 1138 states and 1149 transitions. [2018-10-10 16:23:52,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 16:23:52,627 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 960 [2018-10-10 16:23:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:52,632 INFO L225 Difference]: With dead ends: 1138 [2018-10-10 16:23:52,632 INFO L226 Difference]: Without dead ends: 1138 [2018-10-10 16:23:52,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:23:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2018-10-10 16:23:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2018-10-10 16:23:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-10-10 16:23:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1149 transitions. [2018-10-10 16:23:52,644 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1149 transitions. Word has length 960 [2018-10-10 16:23:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:52,645 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1149 transitions. [2018-10-10 16:23:52,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:23:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1149 transitions. [2018-10-10 16:23:52,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2018-10-10 16:23:52,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:52,655 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, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 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-10 16:23:52,655 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:52,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1898825170, now seen corresponding path program 19 times [2018-10-10 16:23:52,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6478 backedges. 3704 proven. 234 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2018-10-10 16:23:53,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:53,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:23:53,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:23:53,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:23:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:23:53,564 INFO L87 Difference]: Start difference. First operand 1138 states and 1149 transitions. Second operand 23 states. [2018-10-10 16:23:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:55,505 INFO L93 Difference]: Finished difference Result 1184 states and 1195 transitions. [2018-10-10 16:23:55,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:23:55,505 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 981 [2018-10-10 16:23:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:55,511 INFO L225 Difference]: With dead ends: 1184 [2018-10-10 16:23:55,511 INFO L226 Difference]: Without dead ends: 1184 [2018-10-10 16:23:55,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=812, Invalid=3744, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:23:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-10 16:23:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1152. [2018-10-10 16:23:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-10 16:23:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1163 transitions. [2018-10-10 16:23:55,524 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1163 transitions. Word has length 981 [2018-10-10 16:23:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:55,525 INFO L481 AbstractCegarLoop]: Abstraction has 1152 states and 1163 transitions. [2018-10-10 16:23:55,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:23:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1163 transitions. [2018-10-10 16:23:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-10-10 16:23:55,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:55,535 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, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 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-10 16:23:55,535 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:55,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:55,536 INFO L82 PathProgramCache]: Analyzing trace with hash 268134782, now seen corresponding path program 20 times [2018-10-10 16:23:55,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:56,309 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:23:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 3599 proven. 2459 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-10-10 16:23:58,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:58,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:23:58,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:23:58,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:23:58,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1632, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:23:58,966 INFO L87 Difference]: Start difference. First operand 1152 states and 1163 transitions. Second operand 43 states. [2018-10-10 16:24:04,374 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-10 16:24:04,521 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-10 16:24:04,948 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:24:05,513 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:24:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:08,122 INFO L93 Difference]: Finished difference Result 1418 states and 1433 transitions. [2018-10-10 16:24:08,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 16:24:08,122 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 995 [2018-10-10 16:24:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:08,126 INFO L225 Difference]: With dead ends: 1418 [2018-10-10 16:24:08,126 INFO L226 Difference]: Without dead ends: 1418 [2018-10-10 16:24:08,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3086 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2278, Invalid=10378, Unknown=0, NotChecked=0, Total=12656 [2018-10-10 16:24:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-10-10 16:24:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1173. [2018-10-10 16:24:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-10-10 16:24:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1185 transitions. [2018-10-10 16:24:08,138 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1185 transitions. Word has length 995 [2018-10-10 16:24:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:08,139 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1185 transitions. [2018-10-10 16:24:08,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:24:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1185 transitions. [2018-10-10 16:24:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1017 [2018-10-10 16:24:08,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:08,149 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, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 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-10 16:24:08,150 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:08,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:08,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1754882896, now seen corresponding path program 21 times [2018-10-10 16:24:08,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7110 backedges. 283 proven. 6097 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2018-10-10 16:24:09,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:09,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:24:09,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:24:09,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:24:09,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:24:09,442 INFO L87 Difference]: Start difference. First operand 1173 states and 1185 transitions. Second operand 30 states. [2018-10-10 16:24:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:12,650 INFO L93 Difference]: Finished difference Result 1531 states and 1546 transitions. [2018-10-10 16:24:12,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-10 16:24:12,650 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1016 [2018-10-10 16:24:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:12,657 INFO L225 Difference]: With dead ends: 1531 [2018-10-10 16:24:12,657 INFO L226 Difference]: Without dead ends: 1531 [2018-10-10 16:24:12,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7074 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3171, Invalid=15735, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 16:24:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2018-10-10 16:24:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1423. [2018-10-10 16:24:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-10-10 16:24:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1437 transitions. [2018-10-10 16:24:12,669 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1437 transitions. Word has length 1016 [2018-10-10 16:24:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:12,669 INFO L481 AbstractCegarLoop]: Abstraction has 1423 states and 1437 transitions. [2018-10-10 16:24:12,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:24:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1437 transitions. [2018-10-10 16:24:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1246 [2018-10-10 16:24:12,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:12,684 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 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-10 16:24:12,684 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:12,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1154959952, now seen corresponding path program 22 times [2018-10-10 16:24:12,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 11185 backedges. 7731 proven. 2240 refuted. 0 times theorem prover too weak. 1214 trivial. 0 not checked. [2018-10-10 16:24:14,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:14,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:24:14,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:24:14,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:24:14,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:24:14,513 INFO L87 Difference]: Start difference. First operand 1423 states and 1437 transitions. Second operand 28 states. [2018-10-10 16:24:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:16,136 INFO L93 Difference]: Finished difference Result 1423 states and 1435 transitions. [2018-10-10 16:24:16,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:24:16,137 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1245 [2018-10-10 16:24:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:16,142 INFO L225 Difference]: With dead ends: 1423 [2018-10-10 16:24:16,142 INFO L226 Difference]: Without dead ends: 1423 [2018-10-10 16:24:16,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=783, Invalid=3249, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:24:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2018-10-10 16:24:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1423. [2018-10-10 16:24:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-10-10 16:24:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1435 transitions. [2018-10-10 16:24:16,155 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1435 transitions. Word has length 1245 [2018-10-10 16:24:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:16,155 INFO L481 AbstractCegarLoop]: Abstraction has 1423 states and 1435 transitions. [2018-10-10 16:24:16,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:24:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1435 transitions. [2018-10-10 16:24:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-10-10 16:24:16,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:16,171 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 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-10 16:24:16,171 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:16,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1540158718, now seen corresponding path program 23 times [2018-10-10 16:24:16,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11742 backedges. 6292 proven. 332 refuted. 0 times theorem prover too weak. 5118 trivial. 0 not checked. [2018-10-10 16:24:17,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:17,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:24:17,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:24:17,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:24:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:24:17,781 INFO L87 Difference]: Start difference. First operand 1423 states and 1435 transitions. Second operand 27 states. [2018-10-10 16:24:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:20,194 INFO L93 Difference]: Finished difference Result 1469 states and 1481 transitions. [2018-10-10 16:24:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 16:24:20,194 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1266 [2018-10-10 16:24:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:20,201 INFO L225 Difference]: With dead ends: 1469 [2018-10-10 16:24:20,201 INFO L226 Difference]: Without dead ends: 1469 [2018-10-10 16:24:20,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1146, Invalid=5334, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 16:24:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-10 16:24:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1437. [2018-10-10 16:24:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2018-10-10 16:24:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1449 transitions. [2018-10-10 16:24:20,211 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1449 transitions. Word has length 1266 [2018-10-10 16:24:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:20,212 INFO L481 AbstractCegarLoop]: Abstraction has 1437 states and 1449 transitions. [2018-10-10 16:24:20,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:24:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1449 transitions. [2018-10-10 16:24:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-10-10 16:24:20,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:20,226 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 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-10 16:24:20,227 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:20,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:20,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2137788330, now seen corresponding path program 24 times [2018-10-10 16:24:20,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:21,088 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:24:21,315 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:24:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12029 backedges. 7100 proven. 3799 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2018-10-10 16:24:25,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:25,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 16:24:25,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 16:24:25,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 16:24:25,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1965, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:24:25,061 INFO L87 Difference]: Start difference. First operand 1437 states and 1449 transitions. Second operand 47 states. [2018-10-10 16:24:32,409 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-10 16:24:32,587 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-10-10 16:24:33,055 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-10-10 16:24:33,211 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-10 16:24:33,638 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-10-10 16:24:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:36,086 INFO L93 Difference]: Finished difference Result 1731 states and 1747 transitions. [2018-10-10 16:24:36,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 16:24:36,086 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1280 [2018-10-10 16:24:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:36,092 INFO L225 Difference]: With dead ends: 1731 [2018-10-10 16:24:36,092 INFO L226 Difference]: Without dead ends: 1731 [2018-10-10 16:24:36,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3616 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2564, Invalid=12198, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 16:24:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2018-10-10 16:24:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1458. [2018-10-10 16:24:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2018-10-10 16:24:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1471 transitions. [2018-10-10 16:24:36,106 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1471 transitions. Word has length 1280 [2018-10-10 16:24:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:36,107 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 1471 transitions. [2018-10-10 16:24:36,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 16:24:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1471 transitions. [2018-10-10 16:24:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1302 [2018-10-10 16:24:36,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:36,118 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, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 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-10 16:24:36,118 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:36,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1985170648, now seen corresponding path program 25 times [2018-10-10 16:24:36,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12607 backedges. 411 proven. 10929 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2018-10-10 16:24:38,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:38,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:24:38,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:24:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:24:38,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:24:38,343 INFO L87 Difference]: Start difference. First operand 1458 states and 1471 transitions. Second operand 34 states. [2018-10-10 16:24:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:42,631 INFO L93 Difference]: Finished difference Result 1865 states and 1881 transitions. [2018-10-10 16:24:42,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-10 16:24:42,631 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1301 [2018-10-10 16:24:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:42,638 INFO L225 Difference]: With dead ends: 1865 [2018-10-10 16:24:42,638 INFO L226 Difference]: Without dead ends: 1865 [2018-10-10 16:24:42,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11090 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4561, Invalid=23831, Unknown=0, NotChecked=0, Total=28392 [2018-10-10 16:24:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2018-10-10 16:24:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1743. [2018-10-10 16:24:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2018-10-10 16:24:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 1758 transitions. [2018-10-10 16:24:42,654 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 1758 transitions. Word has length 1301 [2018-10-10 16:24:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:42,654 INFO L481 AbstractCegarLoop]: Abstraction has 1743 states and 1758 transitions. [2018-10-10 16:24:42,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:24:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 1758 transitions. [2018-10-10 16:24:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1566 [2018-10-10 16:24:42,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:42,669 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, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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, 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-10 16:24:42,669 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:42,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:42,670 INFO L82 PathProgramCache]: Analyzing trace with hash -638917902, now seen corresponding path program 26 times [2018-10-10 16:24:42,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 18991 backedges. 13521 proven. 3518 refuted. 0 times theorem prover too weak. 1952 trivial. 0 not checked. [2018-10-10 16:24:45,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:45,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:24:45,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:24:45,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:24:45,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:24:45,344 INFO L87 Difference]: Start difference. First operand 1743 states and 1758 transitions. Second operand 32 states. [2018-10-10 16:24:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:46,975 INFO L93 Difference]: Finished difference Result 1743 states and 1756 transitions. [2018-10-10 16:24:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:24:46,976 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1565 [2018-10-10 16:24:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:46,982 INFO L225 Difference]: With dead ends: 1743 [2018-10-10 16:24:46,983 INFO L226 Difference]: Without dead ends: 1743 [2018-10-10 16:24:46,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1044, Invalid=4358, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 16:24:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2018-10-10 16:24:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2018-10-10 16:24:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2018-10-10 16:24:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 1756 transitions. [2018-10-10 16:24:46,998 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 1756 transitions. Word has length 1565 [2018-10-10 16:24:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:46,999 INFO L481 AbstractCegarLoop]: Abstraction has 1743 states and 1756 transitions. [2018-10-10 16:24:46,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:24:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 1756 transitions. [2018-10-10 16:24:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1587 [2018-10-10 16:24:47,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:47,015 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, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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, 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-10 16:24:47,015 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:47,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash -971739728, now seen corresponding path program 27 times [2018-10-10 16:24:47,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 19717 backedges. 9893 proven. 444 refuted. 0 times theorem prover too weak. 9380 trivial. 0 not checked. [2018-10-10 16:24:48,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:48,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:24:48,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:24:48,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:24:48,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:24:48,861 INFO L87 Difference]: Start difference. First operand 1743 states and 1756 transitions. Second operand 31 states. [2018-10-10 16:24:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:52,094 INFO L93 Difference]: Finished difference Result 1789 states and 1802 transitions. [2018-10-10 16:24:52,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 16:24:52,095 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1586 [2018-10-10 16:24:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:52,102 INFO L225 Difference]: With dead ends: 1789 [2018-10-10 16:24:52,102 INFO L226 Difference]: Without dead ends: 1789 [2018-10-10 16:24:52,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=7202, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 16:24:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-10-10 16:24:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1757. [2018-10-10 16:24:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1757 states. [2018-10-10 16:24:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 1770 transitions. [2018-10-10 16:24:52,116 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 1770 transitions. Word has length 1586 [2018-10-10 16:24:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:52,117 INFO L481 AbstractCegarLoop]: Abstraction has 1757 states and 1770 transitions. [2018-10-10 16:24:52,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:24:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 1770 transitions. [2018-10-10 16:24:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1601 [2018-10-10 16:24:52,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:52,132 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, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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, 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-10 16:24:52,133 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:52,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:52,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1485409756, now seen corresponding path program 28 times [2018-10-10 16:24:52,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 20103 backedges. 12686 proven. 5567 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2018-10-10 16:24:57,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:57,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 16:24:57,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 16:24:57,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 16:24:57,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2304, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:24:57,672 INFO L87 Difference]: Start difference. First operand 1757 states and 1770 transitions. Second operand 51 states. [2018-10-10 16:25:05,816 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:25:06,378 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:25:06,963 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:25:07,119 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-10 16:25:07,570 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:25:08,048 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-10-10 16:25:08,288 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-10-10 16:25:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:10,429 INFO L93 Difference]: Finished difference Result 2079 states and 2096 transitions. [2018-10-10 16:25:10,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 16:25:10,429 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1600 [2018-10-10 16:25:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:10,436 INFO L225 Difference]: With dead ends: 2079 [2018-10-10 16:25:10,436 INFO L226 Difference]: Without dead ends: 2079 [2018-10-10 16:25:10,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4534 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3237, Invalid=14853, Unknown=0, NotChecked=0, Total=18090 [2018-10-10 16:25:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2018-10-10 16:25:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1778. [2018-10-10 16:25:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-10-10 16:25:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 1792 transitions. [2018-10-10 16:25:10,454 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 1792 transitions. Word has length 1600 [2018-10-10 16:25:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:10,455 INFO L481 AbstractCegarLoop]: Abstraction has 1778 states and 1792 transitions. [2018-10-10 16:25:10,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 16:25:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 1792 transitions. [2018-10-10 16:25:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2018-10-10 16:25:10,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:10,471 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, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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, 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-10 16:25:10,472 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:10,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash 116490002, now seen corresponding path program 29 times [2018-10-10 16:25:10,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 20850 backedges. 563 proven. 18271 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-10-10 16:25:13,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:13,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:25:13,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:25:13,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:25:13,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:25:13,280 INFO L87 Difference]: Start difference. First operand 1778 states and 1792 transitions. Second operand 38 states. [2018-10-10 16:25:14,309 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:25:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:19,094 INFO L93 Difference]: Finished difference Result 2234 states and 2251 transitions. [2018-10-10 16:25:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-10 16:25:19,094 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1621 [2018-10-10 16:25:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:19,104 INFO L225 Difference]: With dead ends: 2234 [2018-10-10 16:25:19,104 INFO L226 Difference]: Without dead ends: 2234 [2018-10-10 16:25:19,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16593 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6362, Invalid=34644, Unknown=0, NotChecked=0, Total=41006 [2018-10-10 16:25:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2018-10-10 16:25:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2098. [2018-10-10 16:25:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-10 16:25:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2114 transitions. [2018-10-10 16:25:19,125 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2114 transitions. Word has length 1621 [2018-10-10 16:25:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:19,126 INFO L481 AbstractCegarLoop]: Abstraction has 2098 states and 2114 transitions. [2018-10-10 16:25:19,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:25:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2114 transitions. [2018-10-10 16:25:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1921 [2018-10-10 16:25:19,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:19,151 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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, 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-10 16:25:19,151 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:19,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1769283606, now seen corresponding path program 30 times [2018-10-10 16:25:19,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 30291 backedges. 22133 proven. 5221 refuted. 0 times theorem prover too weak. 2937 trivial. 0 not checked. [2018-10-10 16:25:22,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:22,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:25:22,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:25:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:25:22,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:25:22,125 INFO L87 Difference]: Start difference. First operand 2098 states and 2114 transitions. Second operand 36 states. [2018-10-10 16:25:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:25,111 INFO L93 Difference]: Finished difference Result 2098 states and 2112 transitions. [2018-10-10 16:25:25,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 16:25:25,112 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1920 [2018-10-10 16:25:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:25,117 INFO L225 Difference]: With dead ends: 2098 [2018-10-10 16:25:25,117 INFO L226 Difference]: Without dead ends: 2098 [2018-10-10 16:25:25,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1343, Invalid=5629, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 16:25:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2018-10-10 16:25:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2098. [2018-10-10 16:25:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-10 16:25:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2112 transitions. [2018-10-10 16:25:25,135 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2112 transitions. Word has length 1920 [2018-10-10 16:25:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:25,136 INFO L481 AbstractCegarLoop]: Abstraction has 2098 states and 2112 transitions. [2018-10-10 16:25:25,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:25:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2112 transitions. [2018-10-10 16:25:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1942 [2018-10-10 16:25:25,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:25,163 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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, 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-10 16:25:25,163 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:25,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:25,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1499094708, now seen corresponding path program 31 times [2018-10-10 16:25:25,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 31207 backedges. 14675 proven. 570 refuted. 0 times theorem prover too weak. 15962 trivial. 0 not checked. [2018-10-10 16:25:28,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:28,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:25:28,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:25:28,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:25:28,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:25:28,095 INFO L87 Difference]: Start difference. First operand 2098 states and 2112 transitions. Second operand 35 states. [2018-10-10 16:25:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:31,017 INFO L93 Difference]: Finished difference Result 2144 states and 2158 transitions. [2018-10-10 16:25:31,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 16:25:31,017 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1941 [2018-10-10 16:25:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:31,021 INFO L225 Difference]: With dead ends: 2144 [2018-10-10 16:25:31,021 INFO L226 Difference]: Without dead ends: 2144 [2018-10-10 16:25:31,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1994, Invalid=9348, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 16:25:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2018-10-10 16:25:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 2112. [2018-10-10 16:25:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2018-10-10 16:25:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2126 transitions. [2018-10-10 16:25:31,033 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2126 transitions. Word has length 1941 [2018-10-10 16:25:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:31,034 INFO L481 AbstractCegarLoop]: Abstraction has 2112 states and 2126 transitions. [2018-10-10 16:25:31,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:25:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2126 transitions. [2018-10-10 16:25:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1956 [2018-10-10 16:25:31,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:31,057 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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, 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-10 16:25:31,057 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:31,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:31,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1858913312, now seen corresponding path program 32 times [2018-10-10 16:25:31,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 31706 backedges. 21063 proven. 7826 refuted. 0 times theorem prover too weak. 2817 trivial. 0 not checked. [2018-10-10 16:25:38,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:38,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 16:25:38,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 16:25:38,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 16:25:38,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2524, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:25:38,776 INFO L87 Difference]: Start difference. First operand 2112 states and 2126 transitions. Second operand 53 states. [2018-10-10 16:25:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:50,564 INFO L93 Difference]: Finished difference Result 2462 states and 2480 transitions. [2018-10-10 16:25:50,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 16:25:50,564 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1955 [2018-10-10 16:25:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:50,569 INFO L225 Difference]: With dead ends: 2462 [2018-10-10 16:25:50,569 INFO L226 Difference]: Without dead ends: 2462 [2018-10-10 16:25:50,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5011 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2921, Invalid=15985, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 16:25:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2018-10-10 16:25:50,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2133. [2018-10-10 16:25:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2018-10-10 16:25:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2148 transitions. [2018-10-10 16:25:50,583 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2148 transitions. Word has length 1955 [2018-10-10 16:25:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:50,585 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2148 transitions. [2018-10-10 16:25:50,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 16:25:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2148 transitions. [2018-10-10 16:25:50,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1977 [2018-10-10 16:25:50,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:50,608 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, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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, 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-10 16:25:50,609 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:50,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:50,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2037488462, now seen corresponding path program 33 times [2018-10-10 16:25:50,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 32643 backedges. 739 proven. 28892 refuted. 0 times theorem prover too weak. 3012 trivial. 0 not checked. [2018-10-10 16:25:54,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:54,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:25:54,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:25:54,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:25:54,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:25:54,301 INFO L87 Difference]: Start difference. First operand 2133 states and 2148 transitions. Second operand 42 states. [2018-10-10 16:26:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:01,006 INFO L93 Difference]: Finished difference Result 2638 states and 2656 transitions. [2018-10-10 16:26:01,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-10-10 16:26:01,007 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1976 [2018-10-10 16:26:01,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:01,012 INFO L225 Difference]: With dead ends: 2638 [2018-10-10 16:26:01,012 INFO L226 Difference]: Without dead ends: 2638 [2018-10-10 16:26:01,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23915 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8651, Invalid=48709, Unknown=0, NotChecked=0, Total=57360 [2018-10-10 16:26:01,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2018-10-10 16:26:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2488. [2018-10-10 16:26:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2018-10-10 16:26:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 2505 transitions. [2018-10-10 16:26:01,034 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 2505 transitions. Word has length 1976 [2018-10-10 16:26:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:01,035 INFO L481 AbstractCegarLoop]: Abstraction has 2488 states and 2505 transitions. [2018-10-10 16:26:01,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:26:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2505 transitions. [2018-10-10 16:26:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2311 [2018-10-10 16:26:01,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:01,076 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, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 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, 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-10 16:26:01,077 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:01,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:01,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1339587456, now seen corresponding path program 34 times [2018-10-10 16:26:01,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 45994 backedges. 34378 proven. 7412 refuted. 0 times theorem prover too weak. 4204 trivial. 0 not checked. [2018-10-10 16:26:05,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:05,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:26:05,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:26:05,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:26:05,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:26:05,367 INFO L87 Difference]: Start difference. First operand 2488 states and 2505 transitions. Second operand 40 states. [2018-10-10 16:26:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:08,732 INFO L93 Difference]: Finished difference Result 2488 states and 2503 transitions. [2018-10-10 16:26:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 16:26:08,732 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2310 [2018-10-10 16:26:08,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:08,739 INFO L225 Difference]: With dead ends: 2488 [2018-10-10 16:26:08,739 INFO L226 Difference]: Without dead ends: 2488 [2018-10-10 16:26:08,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1680, Invalid=7062, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 16:26:08,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2018-10-10 16:26:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2488. [2018-10-10 16:26:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2018-10-10 16:26:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 2503 transitions. [2018-10-10 16:26:08,758 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 2503 transitions. Word has length 2310 [2018-10-10 16:26:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:08,760 INFO L481 AbstractCegarLoop]: Abstraction has 2488 states and 2503 transitions. [2018-10-10 16:26:08,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:26:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2503 transitions. [2018-10-10 16:26:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2332 [2018-10-10 16:26:08,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:08,804 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, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 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, 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-10 16:26:08,804 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:08,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2066257298, now seen corresponding path program 35 times [2018-10-10 16:26:08,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 47121 backedges. 20806 proven. 710 refuted. 0 times theorem prover too weak. 25605 trivial. 0 not checked. [2018-10-10 16:26:12,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:12,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:26:12,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:26:12,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:26:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:26:12,162 INFO L87 Difference]: Start difference. First operand 2488 states and 2503 transitions. Second operand 39 states. [2018-10-10 16:26:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:17,218 INFO L93 Difference]: Finished difference Result 2534 states and 2549 transitions. [2018-10-10 16:26:17,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-10 16:26:17,219 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 2331 [2018-10-10 16:26:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:17,224 INFO L225 Difference]: With dead ends: 2534 [2018-10-10 16:26:17,224 INFO L226 Difference]: Without dead ends: 2534 [2018-10-10 16:26:17,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3754 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2508, Invalid=11772, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 16:26:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2018-10-10 16:26:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2502. [2018-10-10 16:26:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2502 states. [2018-10-10 16:26:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 2517 transitions. [2018-10-10 16:26:17,246 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 2517 transitions. Word has length 2331 [2018-10-10 16:26:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:17,247 INFO L481 AbstractCegarLoop]: Abstraction has 2502 states and 2517 transitions. [2018-10-10 16:26:17,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:26:17,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2517 transitions. [2018-10-10 16:26:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2346 [2018-10-10 16:26:17,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:17,290 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, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 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, 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-10 16:26:17,290 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:17,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:17,291 INFO L82 PathProgramCache]: Analyzing trace with hash -519857346, now seen corresponding path program 36 times [2018-10-10 16:26:17,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 47747 backedges. 33042 proven. 10639 refuted. 0 times theorem prover too weak. 4066 trivial. 0 not checked. [2018-10-10 16:26:27,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:27,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 16:26:27,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 16:26:27,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 16:26:27,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3201, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:26:27,587 INFO L87 Difference]: Start difference. First operand 2502 states and 2517 transitions. Second operand 60 states. [2018-10-10 16:26:37,889 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-10 16:26:38,042 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-10 16:26:38,530 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:26:38,677 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-10 16:26:39,124 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:26:39,280 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-10 16:26:39,733 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:26:39,892 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-10 16:26:40,235 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-10 16:26:40,475 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:26:40,637 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-10 16:26:41,118 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:26:41,290 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-10 16:26:41,614 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-10 16:26:41,804 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-10 16:26:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:44,846 INFO L93 Difference]: Finished difference Result 2880 states and 2899 transitions. [2018-10-10 16:26:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-10 16:26:44,846 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2345 [2018-10-10 16:26:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:44,850 INFO L225 Difference]: With dead ends: 2880 [2018-10-10 16:26:44,850 INFO L226 Difference]: Without dead ends: 2880 [2018-10-10 16:26:44,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6381 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=4404, Invalid=20402, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 16:26:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2018-10-10 16:26:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2523. [2018-10-10 16:26:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2018-10-10 16:26:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2539 transitions. [2018-10-10 16:26:44,863 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2539 transitions. Word has length 2345 [2018-10-10 16:26:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:44,864 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 2539 transitions. [2018-10-10 16:26:44,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 16:26:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2539 transitions. [2018-10-10 16:26:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2367 [2018-10-10 16:26:44,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:44,894 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, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 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, 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-10 16:26:44,895 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:44,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1201470736, now seen corresponding path program 37 times [2018-10-10 16:26:44,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 48895 backedges. 939 proven. 43666 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-10 16:26:49,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:49,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:26:49,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:26:49,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:26:49,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:26:49,519 INFO L87 Difference]: Start difference. First operand 2523 states and 2539 transitions. Second operand 46 states. [2018-10-10 16:26:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:58,247 INFO L93 Difference]: Finished difference Result 3077 states and 3096 transitions. [2018-10-10 16:26:58,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2018-10-10 16:26:58,247 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2366 [2018-10-10 16:26:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:58,250 INFO L225 Difference]: With dead ends: 3077 [2018-10-10 16:26:58,250 INFO L226 Difference]: Without dead ends: 3077 [2018-10-10 16:26:58,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33422 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11512, Invalid=66608, Unknown=0, NotChecked=0, Total=78120 [2018-10-10 16:26:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2018-10-10 16:26:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2913. [2018-10-10 16:26:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2018-10-10 16:26:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 2931 transitions. [2018-10-10 16:26:58,268 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 2931 transitions. Word has length 2366 [2018-10-10 16:26:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:58,269 INFO L481 AbstractCegarLoop]: Abstraction has 2913 states and 2931 transitions. [2018-10-10 16:26:58,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:26:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 2931 transitions. [2018-10-10 16:26:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2736 [2018-10-10 16:26:58,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:58,312 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 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, 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-10 16:26:58,312 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:58,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:58,312 INFO L82 PathProgramCache]: Analyzing trace with hash -435925280, now seen corresponding path program 38 times [2018-10-10 16:26:58,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 67114 backedges. 51172 proven. 10154 refuted. 0 times theorem prover too weak. 5788 trivial. 0 not checked. [2018-10-10 16:27:04,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:04,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:27:04,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:27:04,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:27:04,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1643, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:27:04,120 INFO L87 Difference]: Start difference. First operand 2913 states and 2931 transitions. Second operand 44 states. [2018-10-10 16:27:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:08,373 INFO L93 Difference]: Finished difference Result 2913 states and 2929 transitions. [2018-10-10 16:27:08,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 16:27:08,373 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2735 [2018-10-10 16:27:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:08,376 INFO L225 Difference]: With dead ends: 2913 [2018-10-10 16:27:08,376 INFO L226 Difference]: Without dead ends: 2913 [2018-10-10 16:27:08,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2384 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2055, Invalid=8657, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 16:27:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2018-10-10 16:27:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2913. [2018-10-10 16:27:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2018-10-10 16:27:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 2929 transitions. [2018-10-10 16:27:08,392 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 2929 transitions. Word has length 2735 [2018-10-10 16:27:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:08,393 INFO L481 AbstractCegarLoop]: Abstraction has 2913 states and 2929 transitions. [2018-10-10 16:27:08,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:27:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 2929 transitions. [2018-10-10 16:27:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2757 [2018-10-10 16:27:08,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:08,436 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 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, 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-10 16:27:08,436 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:08,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:08,437 INFO L82 PathProgramCache]: Analyzing trace with hash -49264366, now seen corresponding path program 39 times [2018-10-10 16:27:08,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 68473 backedges. 28454 proven. 864 refuted. 0 times theorem prover too weak. 39155 trivial. 0 not checked. [2018-10-10 16:27:12,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:12,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:27:12,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:27:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:27:12,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:27:12,662 INFO L87 Difference]: Start difference. First operand 2913 states and 2929 transitions. Second operand 43 states. [2018-10-10 16:27:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:18,215 INFO L93 Difference]: Finished difference Result 2959 states and 2975 transitions. [2018-10-10 16:27:18,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-10 16:27:18,216 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2756 [2018-10-10 16:27:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:18,220 INFO L225 Difference]: With dead ends: 2959 [2018-10-10 16:27:18,220 INFO L226 Difference]: Without dead ends: 2959 [2018-10-10 16:27:18,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4672 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3082, Invalid=14474, Unknown=0, NotChecked=0, Total=17556 [2018-10-10 16:27:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2018-10-10 16:27:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2927. [2018-10-10 16:27:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2927 states. [2018-10-10 16:27:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 2943 transitions. [2018-10-10 16:27:18,239 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 2943 transitions. Word has length 2756 [2018-10-10 16:27:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:18,240 INFO L481 AbstractCegarLoop]: Abstraction has 2927 states and 2943 transitions. [2018-10-10 16:27:18,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:27:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 2943 transitions. [2018-10-10 16:27:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2771 [2018-10-10 16:27:18,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:18,285 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 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, 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-10 16:27:18,285 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:18,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1017470874, now seen corresponding path program 40 times [2018-10-10 16:27:18,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 69240 backedges. 49539 proven. 14069 refuted. 0 times theorem prover too weak. 5632 trivial. 0 not checked. [2018-10-10 16:27:31,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:31,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 16:27:31,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 16:27:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 16:27:31,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=3662, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:27:31,863 INFO L87 Difference]: Start difference. First operand 2927 states and 2943 transitions. Second operand 64 states. [2018-10-10 16:27:43,759 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-10 16:27:43,931 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-10 16:27:44,436 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-10 16:27:44,598 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-10 16:27:45,063 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-10 16:27:45,229 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-10 16:27:45,707 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-10 16:27:45,879 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-10 16:27:46,377 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-10 16:27:46,558 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-10 16:27:46,749 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-10-10 16:27:46,948 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-10 16:27:47,154 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-10 16:27:47,342 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-10 16:27:47,860 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-10-10 16:27:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:50,909 INFO L93 Difference]: Finished difference Result 3333 states and 3353 transitions. [2018-10-10 16:27:50,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-10 16:27:50,909 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2770 [2018-10-10 16:27:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:50,913 INFO L225 Difference]: With dead ends: 3333 [2018-10-10 16:27:50,913 INFO L226 Difference]: Without dead ends: 3333 [2018-10-10 16:27:50,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7120 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=4810, Invalid=22912, Unknown=0, NotChecked=0, Total=27722 [2018-10-10 16:27:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2018-10-10 16:27:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2948. [2018-10-10 16:27:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2018-10-10 16:27:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 2965 transitions. [2018-10-10 16:27:50,931 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 2965 transitions. Word has length 2770 [2018-10-10 16:27:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:50,932 INFO L481 AbstractCegarLoop]: Abstraction has 2948 states and 2965 transitions. [2018-10-10 16:27:50,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 16:27:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 2965 transitions. [2018-10-10 16:27:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2792 [2018-10-10 16:27:50,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:50,978 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, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 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, 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-10 16:27:50,979 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:50,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:50,979 INFO L82 PathProgramCache]: Analyzing trace with hash 603342536, now seen corresponding path program 41 times [2018-10-10 16:27:50,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 70620 backedges. 1163 proven. 63572 refuted. 0 times theorem prover too weak. 5885 trivial. 0 not checked. [2018-10-10 16:27:57,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:57,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:27:57,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:27:57,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:27:57,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2130, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:27:57,098 INFO L87 Difference]: Start difference. First operand 2948 states and 2965 transitions. Second operand 50 states. [2018-10-10 16:28:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:07,855 INFO L93 Difference]: Finished difference Result 3551 states and 3571 transitions. [2018-10-10 16:28:07,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2018-10-10 16:28:07,856 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2791 [2018-10-10 16:28:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:07,860 INFO L225 Difference]: With dead ends: 3551 [2018-10-10 16:28:07,860 INFO L226 Difference]: Without dead ends: 3551 [2018-10-10 16:28:07,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45514 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15036, Invalid=88970, Unknown=0, NotChecked=0, Total=104006 [2018-10-10 16:28:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2018-10-10 16:28:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 3373. [2018-10-10 16:28:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2018-10-10 16:28:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 3392 transitions. [2018-10-10 16:28:07,889 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 3392 transitions. Word has length 2791 [2018-10-10 16:28:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:07,890 INFO L481 AbstractCegarLoop]: Abstraction has 3373 states and 3392 transitions. [2018-10-10 16:28:07,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:28:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 3392 transitions. [2018-10-10 16:28:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3196 [2018-10-10 16:28:08,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:08,003 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, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 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, 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-10 16:28:08,003 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:08,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:08,004 INFO L82 PathProgramCache]: Analyzing trace with hash -841095662, now seen corresponding path program 42 times [2018-10-10 16:28:08,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 94770 backedges. 73536 proven. 13510 refuted. 0 times theorem prover too weak. 7724 trivial. 0 not checked. [2018-10-10 16:28:15,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:15,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:28:15,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:28:15,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:28:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:28:15,145 INFO L87 Difference]: Start difference. First operand 3373 states and 3392 transitions. Second operand 48 states. [2018-10-10 16:28:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:19,241 INFO L93 Difference]: Finished difference Result 3373 states and 3390 transitions. [2018-10-10 16:28:19,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 16:28:19,241 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 3195 [2018-10-10 16:28:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:19,245 INFO L225 Difference]: With dead ends: 3373 [2018-10-10 16:28:19,245 INFO L226 Difference]: Without dead ends: 3373 [2018-10-10 16:28:19,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2903 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2468, Invalid=10414, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 16:28:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2018-10-10 16:28:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3373. [2018-10-10 16:28:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2018-10-10 16:28:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 3390 transitions. [2018-10-10 16:28:19,264 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 3390 transitions. Word has length 3195 [2018-10-10 16:28:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:19,265 INFO L481 AbstractCegarLoop]: Abstraction has 3373 states and 3390 transitions. [2018-10-10 16:28:19,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:28:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 3390 transitions. [2018-10-10 16:28:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3217 [2018-10-10 16:28:19,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:19,325 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, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 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, 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-10 16:28:19,325 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:19,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash -742410768, now seen corresponding path program 43 times [2018-10-10 16:28:19,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 96382 backedges. 37787 proven. 1032 refuted. 0 times theorem prover too weak. 57563 trivial. 0 not checked. [2018-10-10 16:28:24,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:24,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 16:28:24,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 16:28:24,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 16:28:24,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:28:24,316 INFO L87 Difference]: Start difference. First operand 3373 states and 3390 transitions. Second operand 47 states. [2018-10-10 16:28:30,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:30,331 INFO L93 Difference]: Finished difference Result 3419 states and 3436 transitions. [2018-10-10 16:28:30,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-10 16:28:30,331 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 3216 [2018-10-10 16:28:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:30,336 INFO L225 Difference]: With dead ends: 3419 [2018-10-10 16:28:30,336 INFO L226 Difference]: Without dead ends: 3419 [2018-10-10 16:28:30,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3716, Invalid=17454, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 16:28:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2018-10-10 16:28:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3387. [2018-10-10 16:28:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3387 states. [2018-10-10 16:28:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 3404 transitions. [2018-10-10 16:28:30,355 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 3404 transitions. Word has length 3216 [2018-10-10 16:28:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:30,357 INFO L481 AbstractCegarLoop]: Abstraction has 3387 states and 3404 transitions. [2018-10-10 16:28:30,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 16:28:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 3404 transitions. [2018-10-10 16:28:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3231 [2018-10-10 16:28:30,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:30,413 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, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 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, 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-10 16:28:30,413 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:30,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:30,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1816733668, now seen corresponding path program 44 times [2018-10-10 16:28:30,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 97304 backedges. 71575 proven. 18179 refuted. 0 times theorem prover too weak. 7550 trivial. 0 not checked. [2018-10-10 16:28:48,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:48,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 16:28:48,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 16:28:48,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 16:28:48,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=4113, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:28:48,140 INFO L87 Difference]: Start difference. First operand 3387 states and 3404 transitions. Second operand 68 states. [2018-10-10 16:28:58,492 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-10-10 16:28:59,256 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-10 16:28:59,723 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 16:28:59,872 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-10 16:29:00,312 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 16:29:00,470 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-10 16:29:00,921 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 16:29:01,548 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 16:29:01,717 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-10 16:29:02,388 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-10 16:29:02,880 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 16:29:03,060 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-10 16:29:03,601 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 16:29:03,829 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-10 16:29:04,358 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 16:29:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:07,591 INFO L93 Difference]: Finished difference Result 3821 states and 3842 transitions. [2018-10-10 16:29:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-10 16:29:07,591 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 3230 [2018-10-10 16:29:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:07,595 INFO L225 Difference]: With dead ends: 3821 [2018-10-10 16:29:07,595 INFO L226 Difference]: Without dead ends: 3821 [2018-10-10 16:29:07,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8379 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=5739, Invalid=26481, Unknown=0, NotChecked=0, Total=32220 [2018-10-10 16:29:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2018-10-10 16:29:07,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3408. [2018-10-10 16:29:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3408 states. [2018-10-10 16:29:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 3426 transitions. [2018-10-10 16:29:07,616 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 3426 transitions. Word has length 3230 [2018-10-10 16:29:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:07,618 INFO L481 AbstractCegarLoop]: Abstraction has 3408 states and 3426 transitions. [2018-10-10 16:29:07,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 16:29:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 3426 transitions. [2018-10-10 16:29:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3252 [2018-10-10 16:29:07,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:07,677 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, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 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, 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-10 16:29:07,677 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:07,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:07,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1018880814, now seen corresponding path program 45 times [2018-10-10 16:29:07,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 98937 backedges. 1411 proven. 89694 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2018-10-10 16:29:16,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:16,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 16:29:16,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 16:29:16,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 16:29:16,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2490, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:29:16,113 INFO L87 Difference]: Start difference. First operand 3408 states and 3426 transitions. Second operand 54 states. [2018-10-10 16:29:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:28,195 INFO L93 Difference]: Finished difference Result 4060 states and 4081 transitions. [2018-10-10 16:29:28,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 319 states. [2018-10-10 16:29:28,195 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 3251 [2018-10-10 16:29:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:28,200 INFO L225 Difference]: With dead ends: 4060 [2018-10-10 16:29:28,200 INFO L226 Difference]: Without dead ends: 4060 [2018-10-10 16:29:28,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60625 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=19321, Invalid=116471, Unknown=0, NotChecked=0, Total=135792 [2018-10-10 16:29:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2018-10-10 16:29:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 3868. [2018-10-10 16:29:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3868 states. [2018-10-10 16:29:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 3888 transitions. [2018-10-10 16:29:28,241 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 3888 transitions. Word has length 3251 [2018-10-10 16:29:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:28,243 INFO L481 AbstractCegarLoop]: Abstraction has 3868 states and 3888 transitions. [2018-10-10 16:29:28,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 16:29:28,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 3888 transitions. [2018-10-10 16:29:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3691 [2018-10-10 16:29:28,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:28,394 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:28,394 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:28,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash -472780762, now seen corresponding path program 46 times [2018-10-10 16:29:28,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 130186 backedges. 102596 proven. 17543 refuted. 0 times theorem prover too weak. 10047 trivial. 0 not checked. [2018-10-10 16:29:37,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:37,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 16:29:37,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 16:29:37,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 16:29:37,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2307, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:29:37,722 INFO L87 Difference]: Start difference. First operand 3868 states and 3888 transitions. Second operand 52 states. [2018-10-10 16:29:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:42,303 INFO L93 Difference]: Finished difference Result 3868 states and 3886 transitions. [2018-10-10 16:29:42,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 16:29:42,304 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 3690 [2018-10-10 16:29:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:42,308 INFO L225 Difference]: With dead ends: 3868 [2018-10-10 16:29:42,309 INFO L226 Difference]: Without dead ends: 3868 [2018-10-10 16:29:42,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3473 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2919, Invalid=12333, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 16:29:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2018-10-10 16:29:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3868. [2018-10-10 16:29:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3868 states. [2018-10-10 16:29:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 3886 transitions. [2018-10-10 16:29:42,327 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 3886 transitions. Word has length 3690 [2018-10-10 16:29:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:42,328 INFO L481 AbstractCegarLoop]: Abstraction has 3868 states and 3886 transitions. [2018-10-10 16:29:42,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 16:29:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 3886 transitions. [2018-10-10 16:29:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3712 [2018-10-10 16:29:42,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:42,405 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:42,405 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:42,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1198785500, now seen corresponding path program 47 times [2018-10-10 16:29:42,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat