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-093a8c0 [2018-10-14 18:06:51,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 18:06:51,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 18:06:51,698 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 18:06:51,699 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 18:06:51,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 18:06:51,702 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 18:06:51,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 18:06:51,707 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 18:06:51,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 18:06:51,708 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 18:06:51,709 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 18:06:51,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 18:06:51,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 18:06:51,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 18:06:51,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 18:06:51,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 18:06:51,720 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 18:06:51,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 18:06:51,735 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 18:06:51,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 18:06:51,741 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 18:06:51,743 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 18:06:51,743 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 18:06:51,743 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 18:06:51,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 18:06:51,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 18:06:51,750 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 18:06:51,751 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 18:06:51,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 18:06:51,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 18:06:51,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 18:06:51,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 18:06:51,756 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 18:06:51,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 18:06:51,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 18:06:51,759 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 18:06:51,773 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 18:06:51,774 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 18:06:51,774 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 18:06:51,775 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 18:06:51,776 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 18:06:51,776 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 18:06:51,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 18:06:51,777 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 18:06:51,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 18:06:51,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 18:06:51,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 18:06:51,778 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 18:06:51,778 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 18:06:51,779 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 18:06:51,779 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 18:06:51,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 18:06:51,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 18:06:51,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 18:06:51,866 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 18:06:51,866 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 18:06:51,867 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-14 18:06:51,867 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-14 18:06:51,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 18:06:51,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 18:06:51,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 18:06:51,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 18:06:51,957 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 18:06:51,985 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 14.10 06:06:51" (1/1) ... [2018-10-14 18:06:51,987 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 14.10 06:06:51" (1/1) ... [2018-10-14 18:06:52,008 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 14.10 06:06:51" (1/1) ... [2018-10-14 18:06:52,008 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 14.10 06:06:51" (1/1) ... [2018-10-14 18:06:52,015 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 14.10 06:06:51" (1/1) ... [2018-10-14 18:06:52,018 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 14.10 06:06:51" (1/1) ... [2018-10-14 18:06:52,026 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 14.10 06:06:51" (1/1) ... [2018-10-14 18:06:52,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 18:06:52,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 18:06:52,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 18:06:52,034 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 18:06:52,035 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 14.10 06:06:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 18:06:52,102 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 18:06:52,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 18:06:52,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 18:06:52,824 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 18:06:52,825 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:06:52 BoogieIcfgContainer [2018-10-14 18:06:52,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 18:06:52,826 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 18:06:52,826 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 18:06:52,827 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 18:06:52,831 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 14.10 06:06:52" (1/1) ... [2018-10-14 18:06:52,840 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 18:06:52,840 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 18:06:52,883 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 18:06:52,953 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 18:06:52,970 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 18:06:53,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 18:07:50,818 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-14 18:07:50,823 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 18:07:50,829 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 18:07:50,847 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_7|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:07:50,850 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_7|) |v_ULTIMATE.start_read~int_#ptr.offset_5|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:07:50,883 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_4_1_1| |v_ULTIMATE.start_write~int_#ptr.base_12|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-14 18:07:50,885 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_13|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:07:50,885 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_13|) |v_ULTIMATE.start_read~int_#ptr.offset_9|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:07:50,922 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-14 18:07:50,924 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 18:07:50,924 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:07:50,924 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:07:50,924 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:50,925 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:50,925 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:07:50,925 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:50,925 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:50,925 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:07:50,925 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:07:50,926 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:50,926 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:50,926 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:07:50,926 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:50,927 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:50,928 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 18:07:50,961 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:07:50 BasicIcfg [2018-10-14 18:07:50,961 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 18:07:50,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 18:07:50,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 18:07:50,969 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 18:07:50,969 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 14.10 06:06:51" (1/3) ... [2018-10-14 18:07:50,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d85e28 and model type ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:07:50, skipping insertion in model container [2018-10-14 18:07:50,970 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 14.10 06:06:52" (2/3) ... [2018-10-14 18:07:50,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d85e28 and model type ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:07:50, skipping insertion in model container [2018-10-14 18:07:50,971 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 14.10 06:07:50" (3/3) ... [2018-10-14 18:07:50,973 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 18:07:50,983 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 18:07:50,992 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 18:07:51,011 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 18:07:51,037 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 18:07:51,038 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 18:07:51,038 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 18:07:51,038 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 18:07:51,038 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 18:07:51,038 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 18:07:51,039 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 18:07:51,039 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 18:07:51,039 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 18:07:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-10-14 18:07:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-14 18:07:51,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:51,072 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-14 18:07:51,073 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:51,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:51,081 INFO L82 PathProgramCache]: Analyzing trace with hash 219326866, now seen corresponding path program 1 times [2018-10-14 18:07:51,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:07:51,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:07:51,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-14 18:07:51,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 18:07:51,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 18:07:51,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-14 18:07:51,658 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 6 states. [2018-10-14 18:07:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:51,903 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-10-14 18:07:51,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 18:07:51,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-10-14 18:07:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:51,920 INFO L225 Difference]: With dead ends: 177 [2018-10-14 18:07:51,920 INFO L226 Difference]: Without dead ends: 177 [2018-10-14 18:07:51,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:07:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-14 18:07:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 126. [2018-10-14 18:07:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-14 18:07:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-10-14 18:07:51,979 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 41 [2018-10-14 18:07:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:51,980 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-10-14 18:07:51,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 18:07:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-10-14 18:07:51,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-14 18:07:51,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:51,986 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-14 18:07:51,986 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:51,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash 269123840, now seen corresponding path program 1 times [2018-10-14 18:07:51,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:52,935 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 18:07:53,278 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-14 18:07:53,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:53,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 18:07:53,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 18:07:53,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 18:07:53,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-14 18:07:53,281 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 19 states. [2018-10-14 18:07:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:55,585 INFO L93 Difference]: Finished difference Result 246 states and 252 transitions. [2018-10-14 18:07:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 18:07:55,586 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 95 [2018-10-14 18:07:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:55,589 INFO L225 Difference]: With dead ends: 246 [2018-10-14 18:07:55,589 INFO L226 Difference]: Without dead ends: 246 [2018-10-14 18:07:55,591 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-14 18:07:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-14 18:07:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 130. [2018-10-14 18:07:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-14 18:07:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2018-10-14 18:07:55,604 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 95 [2018-10-14 18:07:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:55,605 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2018-10-14 18:07:55,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 18:07:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2018-10-14 18:07:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-14 18:07:55,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:55,607 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-14 18:07:55,608 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:55,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash -630936978, now seen corresponding path program 1 times [2018-10-14 18:07:55,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:55,793 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-14 18:07:55,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:55,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 18:07:55,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 18:07:55,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 18:07:55,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:07:55,795 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand 10 states. [2018-10-14 18:07:56,356 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-14 18:07:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:56,660 INFO L93 Difference]: Finished difference Result 320 states and 327 transitions. [2018-10-14 18:07:56,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 18:07:56,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-10-14 18:07:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:56,665 INFO L225 Difference]: With dead ends: 320 [2018-10-14 18:07:56,665 INFO L226 Difference]: Without dead ends: 320 [2018-10-14 18:07:56,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:07:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-14 18:07:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 218. [2018-10-14 18:07:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-14 18:07:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 223 transitions. [2018-10-14 18:07:56,680 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 223 transitions. Word has length 116 [2018-10-14 18:07:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:56,681 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 223 transitions. [2018-10-14 18:07:56,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 18:07:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-10-14 18:07:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-14 18:07:56,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:56,685 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-14 18:07:56,685 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:56,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1008595520, now seen corresponding path program 2 times [2018-10-14 18:07:56,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:56,881 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-14 18:07:56,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:56,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 18:07:56,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 18:07:56,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 18:07:56,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 18:07:56,883 INFO L87 Difference]: Start difference. First operand 218 states and 223 transitions. Second operand 8 states. [2018-10-14 18:07:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:57,115 INFO L93 Difference]: Finished difference Result 269 states and 274 transitions. [2018-10-14 18:07:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 18:07:57,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2018-10-14 18:07:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:57,118 INFO L225 Difference]: With dead ends: 269 [2018-10-14 18:07:57,118 INFO L226 Difference]: Without dead ends: 269 [2018-10-14 18:07:57,119 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-14 18:07:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-14 18:07:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-10-14 18:07:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-14 18:07:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 222 transitions. [2018-10-14 18:07:57,130 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 222 transitions. Word has length 170 [2018-10-14 18:07:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:57,131 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 222 transitions. [2018-10-14 18:07:57,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 18:07:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2018-10-14 18:07:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-14 18:07:57,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:57,135 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-14 18:07:57,135 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:57,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1102948370, now seen corresponding path program 3 times [2018-10-14 18:07:57,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:57,334 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-14 18:07:57,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:57,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 18:07:57,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 18:07:57,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 18:07:57,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:07:57,336 INFO L87 Difference]: Start difference. First operand 218 states and 222 transitions. Second operand 10 states. [2018-10-14 18:07:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:57,714 INFO L93 Difference]: Finished difference Result 327 states and 334 transitions. [2018-10-14 18:07:57,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 18:07:57,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2018-10-14 18:07:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:57,717 INFO L225 Difference]: With dead ends: 327 [2018-10-14 18:07:57,717 INFO L226 Difference]: Without dead ends: 327 [2018-10-14 18:07:57,718 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-14 18:07:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-14 18:07:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 227. [2018-10-14 18:07:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-14 18:07:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2018-10-14 18:07:57,727 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 191 [2018-10-14 18:07:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:57,728 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2018-10-14 18:07:57,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 18:07:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2018-10-14 18:07:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-14 18:07:57,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:57,732 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-14 18:07:57,732 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:57,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash 123824574, now seen corresponding path program 1 times [2018-10-14 18:07:57,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:58,933 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-14 18:07:58,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:58,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 18:07:58,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 18:07:58,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 18:07:58,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:07:58,935 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 23 states. [2018-10-14 18:07:59,998 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-14 18:08:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:02,137 INFO L93 Difference]: Finished difference Result 552 states and 565 transitions. [2018-10-14 18:08:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 18:08:02,141 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 205 [2018-10-14 18:08:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:02,146 INFO L225 Difference]: With dead ends: 552 [2018-10-14 18:08:02,146 INFO L226 Difference]: Without dead ends: 552 [2018-10-14 18:08:02,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=480, Invalid=3060, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 18:08:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-14 18:08:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 306. [2018-10-14 18:08:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-14 18:08:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 312 transitions. [2018-10-14 18:08:02,163 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 312 transitions. Word has length 205 [2018-10-14 18:08:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:02,164 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 312 transitions. [2018-10-14 18:08:02,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 18:08:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 312 transitions. [2018-10-14 18:08:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-14 18:08:02,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:02,169 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-14 18:08:02,169 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:02,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash -47233936, now seen corresponding path program 2 times [2018-10-14 18:08:02,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:02,511 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-14 18:08:02,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:02,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 18:08:02,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 18:08:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 18:08:02,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-14 18:08:02,513 INFO L87 Difference]: Start difference. First operand 306 states and 312 transitions. Second operand 14 states. [2018-10-14 18:08:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:03,475 INFO L93 Difference]: Finished difference Result 430 states and 439 transitions. [2018-10-14 18:08:03,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 18:08:03,476 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 226 [2018-10-14 18:08:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:03,480 INFO L225 Difference]: With dead ends: 430 [2018-10-14 18:08:03,480 INFO L226 Difference]: Without dead ends: 430 [2018-10-14 18:08:03,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:08:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-14 18:08:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 328. [2018-10-14 18:08:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-14 18:08:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 335 transitions. [2018-10-14 18:08:03,488 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 335 transitions. Word has length 226 [2018-10-14 18:08:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:03,488 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 335 transitions. [2018-10-14 18:08:03,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 18:08:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 335 transitions. [2018-10-14 18:08:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-14 18:08:03,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:03,494 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-14 18:08:03,494 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:03,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash 705697168, now seen corresponding path program 3 times [2018-10-14 18:08:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:03,727 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-14 18:08:03,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:03,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 18:08:03,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 18:08:03,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 18:08:03,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:08:03,729 INFO L87 Difference]: Start difference. First operand 328 states and 335 transitions. Second operand 10 states. [2018-10-14 18:08:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:03,994 INFO L93 Difference]: Finished difference Result 344 states and 349 transitions. [2018-10-14 18:08:03,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 18:08:03,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-10-14 18:08:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:03,998 INFO L225 Difference]: With dead ends: 344 [2018-10-14 18:08:03,998 INFO L226 Difference]: Without dead ends: 344 [2018-10-14 18:08:03,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-14 18:08:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-14 18:08:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 328. [2018-10-14 18:08:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-14 18:08:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 333 transitions. [2018-10-14 18:08:04,006 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 333 transitions. Word has length 259 [2018-10-14 18:08:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:04,007 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 333 transitions. [2018-10-14 18:08:04,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 18:08:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 333 transitions. [2018-10-14 18:08:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-14 18:08:04,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:04,009 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-14 18:08:04,009 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:04,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:04,010 INFO L82 PathProgramCache]: Analyzing trace with hash 827963074, now seen corresponding path program 4 times [2018-10-14 18:08:04,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:04,388 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-14 18:08:04,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:04,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 18:08:04,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 18:08:04,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 18:08:04,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:08:04,390 INFO L87 Difference]: Start difference. First operand 328 states and 333 transitions. Second operand 12 states. [2018-10-14 18:08:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:04,716 INFO L93 Difference]: Finished difference Result 346 states and 350 transitions. [2018-10-14 18:08:04,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 18:08:04,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 280 [2018-10-14 18:08:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:04,718 INFO L225 Difference]: With dead ends: 346 [2018-10-14 18:08:04,718 INFO L226 Difference]: Without dead ends: 346 [2018-10-14 18:08:04,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:08:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-14 18:08:04,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-10-14 18:08:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-14 18:08:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2018-10-14 18:08:04,724 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 280 [2018-10-14 18:08:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:04,725 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2018-10-14 18:08:04,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 18:08:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2018-10-14 18:08:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-14 18:08:04,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:04,727 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-14 18:08:04,727 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:04,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash 573384912, now seen corresponding path program 5 times [2018-10-14 18:08:04,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:05,609 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-14 18:08:05,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:05,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 18:08:05,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 18:08:05,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 18:08:05,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:08:05,610 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 12 states. [2018-10-14 18:08:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:06,031 INFO L93 Difference]: Finished difference Result 362 states and 366 transitions. [2018-10-14 18:08:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 18:08:06,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 301 [2018-10-14 18:08:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:06,033 INFO L225 Difference]: With dead ends: 362 [2018-10-14 18:08:06,033 INFO L226 Difference]: Without dead ends: 362 [2018-10-14 18:08:06,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:08:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-14 18:08:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 347. [2018-10-14 18:08:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-14 18:08:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2018-10-14 18:08:06,041 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 301 [2018-10-14 18:08:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:06,042 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2018-10-14 18:08:06,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 18:08:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2018-10-14 18:08:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-14 18:08:06,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:06,044 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-14 18:08:06,044 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:06,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:06,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1602864636, now seen corresponding path program 6 times [2018-10-14 18:08:06,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:06,709 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-14 18:08:06,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:06,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 18:08:06,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 18:08:06,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 18:08:06,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-14 18:08:06,711 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 14 states. [2018-10-14 18:08:07,355 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-14 18:08:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:07,672 INFO L93 Difference]: Finished difference Result 364 states and 368 transitions. [2018-10-14 18:08:07,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 18:08:07,673 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 315 [2018-10-14 18:08:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:07,676 INFO L225 Difference]: With dead ends: 364 [2018-10-14 18:08:07,676 INFO L226 Difference]: Without dead ends: 364 [2018-10-14 18:08:07,677 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-14 18:08:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-14 18:08:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2018-10-14 18:08:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-14 18:08:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 365 transitions. [2018-10-14 18:08:07,683 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 365 transitions. Word has length 315 [2018-10-14 18:08:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:07,683 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 365 transitions. [2018-10-14 18:08:07,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 18:08:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 365 transitions. [2018-10-14 18:08:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-14 18:08:07,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:07,686 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-14 18:08:07,686 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:07,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:07,686 INFO L82 PathProgramCache]: Analyzing trace with hash 231073320, now seen corresponding path program 7 times [2018-10-14 18:08:07,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:08,218 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:08:08,455 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:08:08,701 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 18:08:09,533 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-14 18:08:09,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:09,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 18:08:09,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 18:08:09,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 18:08:09,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-10-14 18:08:09,536 INFO L87 Difference]: Start difference. First operand 361 states and 365 transitions. Second operand 26 states. [2018-10-14 18:08:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:13,157 INFO L93 Difference]: Finished difference Result 459 states and 465 transitions. [2018-10-14 18:08:13,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 18:08:13,157 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 329 [2018-10-14 18:08:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:13,161 INFO L225 Difference]: With dead ends: 459 [2018-10-14 18:08:13,161 INFO L226 Difference]: Without dead ends: 459 [2018-10-14 18:08:13,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=849, Invalid=3441, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 18:08:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-14 18:08:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 364. [2018-10-14 18:08:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-14 18:08:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 368 transitions. [2018-10-14 18:08:13,171 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 368 transitions. Word has length 329 [2018-10-14 18:08:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:13,171 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 368 transitions. [2018-10-14 18:08:13,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 18:08:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 368 transitions. [2018-10-14 18:08:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-14 18:08:13,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:13,174 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-14 18:08:13,174 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:13,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash 386895430, now seen corresponding path program 8 times [2018-10-14 18:08:13,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:15,962 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-14 18:08:15,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:15,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 18:08:15,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 18:08:15,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 18:08:15,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2268, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 18:08:15,964 INFO L87 Difference]: Start difference. First operand 364 states and 368 transitions. Second operand 50 states. [2018-10-14 18:08:16,939 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-10-14 18:08:17,262 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-10-14 18:08:20,496 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-10-14 18:08:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:27,635 INFO L93 Difference]: Finished difference Result 587 states and 595 transitions. [2018-10-14 18:08:27,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-14 18:08:27,636 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 350 [2018-10-14 18:08:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:27,639 INFO L225 Difference]: With dead ends: 587 [2018-10-14 18:08:27,639 INFO L226 Difference]: Without dead ends: 587 [2018-10-14 18:08:27,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5558 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2037, Invalid=16323, Unknown=0, NotChecked=0, Total=18360 [2018-10-14 18:08:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-10-14 18:08:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 488. [2018-10-14 18:08:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-14 18:08:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 494 transitions. [2018-10-14 18:08:27,653 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 494 transitions. Word has length 350 [2018-10-14 18:08:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:27,654 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 494 transitions. [2018-10-14 18:08:27,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 18:08:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 494 transitions. [2018-10-14 18:08:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-14 18:08:27,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:27,657 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-14 18:08:27,657 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:27,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:27,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1182192412, now seen corresponding path program 9 times [2018-10-14 18:08:27,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:28,335 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-14 18:08:28,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:28,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 18:08:28,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 18:08:28,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 18:08:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-14 18:08:28,337 INFO L87 Difference]: Start difference. First operand 488 states and 494 transitions. Second operand 16 states. [2018-10-14 18:08:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:29,123 INFO L93 Difference]: Finished difference Result 527 states and 533 transitions. [2018-10-14 18:08:29,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 18:08:29,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 474 [2018-10-14 18:08:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:29,126 INFO L225 Difference]: With dead ends: 527 [2018-10-14 18:08:29,126 INFO L226 Difference]: Without dead ends: 527 [2018-10-14 18:08:29,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 18:08:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-14 18:08:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-10-14 18:08:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-14 18:08:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 533 transitions. [2018-10-14 18:08:29,134 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 533 transitions. Word has length 474 [2018-10-14 18:08:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:29,135 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 533 transitions. [2018-10-14 18:08:29,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 18:08:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 533 transitions. [2018-10-14 18:08:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-10-14 18:08:29,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:29,138 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-14 18:08:29,139 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:29,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:29,139 INFO L82 PathProgramCache]: Analyzing trace with hash -399603010, now seen corresponding path program 10 times [2018-10-14 18:08:29,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:29,626 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-14 18:08:29,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:29,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 18:08:29,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 18:08:29,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 18:08:29,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:08:29,628 INFO L87 Difference]: Start difference. First operand 527 states and 533 transitions. Second operand 15 states. [2018-10-14 18:08:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:30,554 INFO L93 Difference]: Finished difference Result 544 states and 550 transitions. [2018-10-14 18:08:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 18:08:30,555 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 495 [2018-10-14 18:08:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:30,559 INFO L225 Difference]: With dead ends: 544 [2018-10-14 18:08:30,559 INFO L226 Difference]: Without dead ends: 544 [2018-10-14 18:08:30,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 18:08:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-10-14 18:08:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 541. [2018-10-14 18:08:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-10-14 18:08:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 547 transitions. [2018-10-14 18:08:30,567 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 547 transitions. Word has length 495 [2018-10-14 18:08:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:30,568 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 547 transitions. [2018-10-14 18:08:30,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 18:08:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 547 transitions. [2018-10-14 18:08:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-14 18:08:30,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:30,572 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-14 18:08:30,572 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:30,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1632430354, now seen corresponding path program 11 times [2018-10-14 18:08:30,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:31,153 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:08:31,370 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:08:31,603 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 18:08:32,551 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-14 18:08:32,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:32,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 18:08:32,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 18:08:32,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 18:08:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:08:32,554 INFO L87 Difference]: Start difference. First operand 541 states and 547 transitions. Second operand 31 states. [2018-10-14 18:08:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:37,083 INFO L93 Difference]: Finished difference Result 653 states and 661 transitions. [2018-10-14 18:08:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 18:08:37,083 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 509 [2018-10-14 18:08:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:37,087 INFO L225 Difference]: With dead ends: 653 [2018-10-14 18:08:37,087 INFO L226 Difference]: Without dead ends: 653 [2018-10-14 18:08:37,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1067, Invalid=4785, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 18:08:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-10-14 18:08:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 544. [2018-10-14 18:08:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-14 18:08:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 550 transitions. [2018-10-14 18:08:37,096 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 550 transitions. Word has length 509 [2018-10-14 18:08:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:37,097 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 550 transitions. [2018-10-14 18:08:37,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 18:08:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 550 transitions. [2018-10-14 18:08:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-14 18:08:37,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:37,101 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-14 18:08:37,101 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:37,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:37,101 INFO L82 PathProgramCache]: Analyzing trace with hash 261775772, now seen corresponding path program 12 times [2018-10-14 18:08:37,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:37,682 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:08:37,921 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:08:38,180 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 18:08:39,454 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-14 18:08:39,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:39,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 18:08:39,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 18:08:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 18:08:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 18:08:39,456 INFO L87 Difference]: Start difference. First operand 544 states and 550 transitions. Second operand 33 states. [2018-10-14 18:08:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:45,404 INFO L93 Difference]: Finished difference Result 754 states and 764 transitions. [2018-10-14 18:08:45,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 18:08:45,405 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 530 [2018-10-14 18:08:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:45,409 INFO L225 Difference]: With dead ends: 754 [2018-10-14 18:08:45,409 INFO L226 Difference]: Without dead ends: 754 [2018-10-14 18:08:45,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1371, Invalid=6285, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 18:08:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-14 18:08:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 565. [2018-10-14 18:08:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-14 18:08:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 572 transitions. [2018-10-14 18:08:45,419 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 572 transitions. Word has length 530 [2018-10-14 18:08:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:45,420 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 572 transitions. [2018-10-14 18:08:45,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 18:08:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 572 transitions. [2018-10-14 18:08:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-10-14 18:08:45,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:45,424 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-14 18:08:45,424 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:45,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1996391250, now seen corresponding path program 13 times [2018-10-14 18:08:45,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:46,212 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-14 18:08:46,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:46,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 18:08:46,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 18:08:46,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 18:08:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:08:46,214 INFO L87 Difference]: Start difference. First operand 565 states and 572 transitions. Second operand 22 states. [2018-10-14 18:08:47,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:47,780 INFO L93 Difference]: Finished difference Result 846 states and 856 transitions. [2018-10-14 18:08:47,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 18:08:47,793 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 551 [2018-10-14 18:08:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:47,796 INFO L225 Difference]: With dead ends: 846 [2018-10-14 18:08:47,797 INFO L226 Difference]: Without dead ends: 846 [2018-10-14 18:08:47,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2287 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1320, Invalid=5652, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 18:08:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-10-14 18:08:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 766. [2018-10-14 18:08:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-10-14 18:08:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 775 transitions. [2018-10-14 18:08:47,808 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 775 transitions. Word has length 551 [2018-10-14 18:08:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:47,809 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 775 transitions. [2018-10-14 18:08:47,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 18:08:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 775 transitions. [2018-10-14 18:08:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2018-10-14 18:08:47,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:47,815 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-14 18:08:47,815 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:47,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:47,816 INFO L82 PathProgramCache]: Analyzing trace with hash -459428346, now seen corresponding path program 14 times [2018-10-14 18:08:47,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:48,575 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-14 18:08:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 18:08:48,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 18:08:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 18:08:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:08:48,577 INFO L87 Difference]: Start difference. First operand 766 states and 775 transitions. Second operand 22 states. [2018-10-14 18:08:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:50,051 INFO L93 Difference]: Finished difference Result 783 states and 792 transitions. [2018-10-14 18:08:50,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 18:08:50,052 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 710 [2018-10-14 18:08:50,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:50,056 INFO L225 Difference]: With dead ends: 783 [2018-10-14 18:08:50,056 INFO L226 Difference]: Without dead ends: 783 [2018-10-14 18:08:50,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=473, Invalid=1977, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 18:08:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-14 18:08:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 780. [2018-10-14 18:08:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-10-14 18:08:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 789 transitions. [2018-10-14 18:08:50,065 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 789 transitions. Word has length 710 [2018-10-14 18:08:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:50,066 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 789 transitions. [2018-10-14 18:08:50,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 18:08:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 789 transitions. [2018-10-14 18:08:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2018-10-14 18:08:50,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:50,072 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-14 18:08:50,072 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:50,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:50,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2028849830, now seen corresponding path program 15 times [2018-10-14 18:08:50,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:50,901 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-14 18:08:50,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:50,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 18:08:50,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 18:08:50,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 18:08:50,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-14 18:08:50,903 INFO L87 Difference]: Start difference. First operand 780 states and 789 transitions. Second operand 19 states. [2018-10-14 18:08:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:52,734 INFO L93 Difference]: Finished difference Result 1173 states and 1185 transitions. [2018-10-14 18:08:52,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 18:08:52,734 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 724 [2018-10-14 18:08:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:52,740 INFO L225 Difference]: With dead ends: 1173 [2018-10-14 18:08:52,740 INFO L226 Difference]: Without dead ends: 1119 [2018-10-14 18:08:52,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3508 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1659, Invalid=8043, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 18:08:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-14 18:08:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 902. [2018-10-14 18:08:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-14 18:08:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 912 transitions. [2018-10-14 18:08:52,753 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 912 transitions. Word has length 724 [2018-10-14 18:08:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:52,754 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 912 transitions. [2018-10-14 18:08:52,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 18:08:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 912 transitions. [2018-10-14 18:08:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2018-10-14 18:08:52,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:52,760 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-14 18:08:52,760 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:52,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2105626224, now seen corresponding path program 16 times [2018-10-14 18:08:52,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:54,753 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-14 18:08:54,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:54,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 18:08:54,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 18:08:54,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 18:08:54,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 18:08:54,755 INFO L87 Difference]: Start difference. First operand 902 states and 912 transitions. Second operand 37 states. [2018-10-14 18:09:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:01,359 INFO L93 Difference]: Finished difference Result 1140 states and 1154 transitions. [2018-10-14 18:09:01,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-14 18:09:01,359 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 745 [2018-10-14 18:09:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:01,363 INFO L225 Difference]: With dead ends: 1140 [2018-10-14 18:09:01,364 INFO L226 Difference]: Without dead ends: 1140 [2018-10-14 18:09:01,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2319 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1629, Invalid=7877, Unknown=0, NotChecked=0, Total=9506 [2018-10-14 18:09:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-10-14 18:09:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 923. [2018-10-14 18:09:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-14 18:09:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 934 transitions. [2018-10-14 18:09:01,377 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 934 transitions. Word has length 745 [2018-10-14 18:09:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:01,377 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 934 transitions. [2018-10-14 18:09:01,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 18:09:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 934 transitions. [2018-10-14 18:09:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2018-10-14 18:09:01,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:01,384 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-14 18:09:01,384 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:01,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:01,385 INFO L82 PathProgramCache]: Analyzing trace with hash -156797986, now seen corresponding path program 17 times [2018-10-14 18:09:01,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:02,292 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-14 18:09:02,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:02,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 18:09:02,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 18:09:02,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 18:09:02,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-14 18:09:02,294 INFO L87 Difference]: Start difference. First operand 923 states and 934 transitions. Second operand 26 states. [2018-10-14 18:09:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:04,412 INFO L93 Difference]: Finished difference Result 1232 states and 1246 transitions. [2018-10-14 18:09:04,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-14 18:09:04,413 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 766 [2018-10-14 18:09:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:04,418 INFO L225 Difference]: With dead ends: 1232 [2018-10-14 18:09:04,418 INFO L226 Difference]: Without dead ends: 1232 [2018-10-14 18:09:04,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2122, Invalid=9868, Unknown=0, NotChecked=0, Total=11990 [2018-10-14 18:09:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2018-10-14 18:09:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1138. [2018-10-14 18:09:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-10-14 18:09:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1151 transitions. [2018-10-14 18:09:04,432 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1151 transitions. Word has length 766 [2018-10-14 18:09:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:04,432 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1151 transitions. [2018-10-14 18:09:04,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 18:09:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1151 transitions. [2018-10-14 18:09:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2018-10-14 18:09:04,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:04,441 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-14 18:09:04,441 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:04,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:04,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1659834400, now seen corresponding path program 18 times [2018-10-14 18:09:04,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:05,489 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-14 18:09:05,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:05,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 18:09:05,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 18:09:05,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 18:09:05,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:09:05,491 INFO L87 Difference]: Start difference. First operand 1138 states and 1151 transitions. Second operand 24 states. [2018-10-14 18:09:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:06,743 INFO L93 Difference]: Finished difference Result 1138 states and 1149 transitions. [2018-10-14 18:09:06,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 18:09:06,744 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 960 [2018-10-14 18:09:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:06,748 INFO L225 Difference]: With dead ends: 1138 [2018-10-14 18:09:06,748 INFO L226 Difference]: Without dead ends: 1138 [2018-10-14 18:09:06,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 18:09:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2018-10-14 18:09:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2018-10-14 18:09:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-10-14 18:09:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1149 transitions. [2018-10-14 18:09:06,775 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1149 transitions. Word has length 960 [2018-10-14 18:09:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:06,776 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1149 transitions. [2018-10-14 18:09:06,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 18:09:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1149 transitions. [2018-10-14 18:09:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2018-10-14 18:09:06,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:06,785 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-14 18:09:06,786 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:06,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:06,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1898825170, now seen corresponding path program 19 times [2018-10-14 18:09:06,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:07,732 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-14 18:09:07,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:07,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 18:09:07,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 18:09:07,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 18:09:07,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:09:07,734 INFO L87 Difference]: Start difference. First operand 1138 states and 1149 transitions. Second operand 23 states. [2018-10-14 18:09:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:09,629 INFO L93 Difference]: Finished difference Result 1184 states and 1195 transitions. [2018-10-14 18:09:09,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 18:09:09,630 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 981 [2018-10-14 18:09:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:09,635 INFO L225 Difference]: With dead ends: 1184 [2018-10-14 18:09:09,635 INFO L226 Difference]: Without dead ends: 1184 [2018-10-14 18:09:09,636 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-14 18:09:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-14 18:09:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1152. [2018-10-14 18:09:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-14 18:09:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1163 transitions. [2018-10-14 18:09:09,648 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1163 transitions. Word has length 981 [2018-10-14 18:09:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:09,648 INFO L481 AbstractCegarLoop]: Abstraction has 1152 states and 1163 transitions. [2018-10-14 18:09:09,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 18:09:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1163 transitions. [2018-10-14 18:09:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-10-14 18:09:09,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:09,658 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-14 18:09:09,658 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:09,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:09,659 INFO L82 PathProgramCache]: Analyzing trace with hash 268134782, now seen corresponding path program 20 times [2018-10-14 18:09:09,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:10,413 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:09:10,646 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:09:10,900 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 18:09:11,162 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 18:09:13,768 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-14 18:09:13,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:13,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 18:09:13,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 18:09:13,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 18:09:13,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1632, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:09:13,770 INFO L87 Difference]: Start difference. First operand 1152 states and 1163 transitions. Second operand 43 states. [2018-10-14 18:09:15,427 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-14 18:09:16,050 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-14 18:09:22,968 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:09:23,121 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 18:09:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:26,134 INFO L93 Difference]: Finished difference Result 1418 states and 1433 transitions. [2018-10-14 18:09:26,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 18:09:26,134 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 995 [2018-10-14 18:09:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:26,138 INFO L225 Difference]: With dead ends: 1418 [2018-10-14 18:09:26,138 INFO L226 Difference]: Without dead ends: 1418 [2018-10-14 18:09:26,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3086 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2278, Invalid=10378, Unknown=0, NotChecked=0, Total=12656 [2018-10-14 18:09:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-10-14 18:09:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1173. [2018-10-14 18:09:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-10-14 18:09:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1185 transitions. [2018-10-14 18:09:26,152 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1185 transitions. Word has length 995 [2018-10-14 18:09:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:26,152 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1185 transitions. [2018-10-14 18:09:26,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 18:09:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1185 transitions. [2018-10-14 18:09:26,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1017 [2018-10-14 18:09:26,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:26,162 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-14 18:09:26,162 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:26,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:26,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1754882896, now seen corresponding path program 21 times [2018-10-14 18:09:26,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:27,558 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-14 18:09:27,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:27,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 18:09:27,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 18:09:27,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 18:09:27,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-14 18:09:27,560 INFO L87 Difference]: Start difference. First operand 1173 states and 1185 transitions. Second operand 30 states. [2018-10-14 18:09:28,347 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-14 18:09:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:31,399 INFO L93 Difference]: Finished difference Result 1531 states and 1546 transitions. [2018-10-14 18:09:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-14 18:09:31,399 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1016 [2018-10-14 18:09:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:31,405 INFO L225 Difference]: With dead ends: 1531 [2018-10-14 18:09:31,405 INFO L226 Difference]: Without dead ends: 1531 [2018-10-14 18:09:31,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7074 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3171, Invalid=15735, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 18:09:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2018-10-14 18:09:31,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1423. [2018-10-14 18:09:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-10-14 18:09:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1437 transitions. [2018-10-14 18:09:31,416 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1437 transitions. Word has length 1016 [2018-10-14 18:09:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:31,417 INFO L481 AbstractCegarLoop]: Abstraction has 1423 states and 1437 transitions. [2018-10-14 18:09:31,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 18:09:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1437 transitions. [2018-10-14 18:09:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1246 [2018-10-14 18:09:31,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:31,430 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-14 18:09:31,430 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:31,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1154959952, now seen corresponding path program 22 times [2018-10-14 18:09:31,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:34,014 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-14 18:09:34,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:34,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 18:09:34,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 18:09:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 18:09:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-14 18:09:34,016 INFO L87 Difference]: Start difference. First operand 1423 states and 1437 transitions. Second operand 28 states. [2018-10-14 18:09:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:35,829 INFO L93 Difference]: Finished difference Result 1423 states and 1435 transitions. [2018-10-14 18:09:35,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 18:09:35,829 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1245 [2018-10-14 18:09:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:35,834 INFO L225 Difference]: With dead ends: 1423 [2018-10-14 18:09:35,834 INFO L226 Difference]: Without dead ends: 1423 [2018-10-14 18:09:35,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=783, Invalid=3249, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 18:09:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2018-10-14 18:09:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1423. [2018-10-14 18:09:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-10-14 18:09:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1435 transitions. [2018-10-14 18:09:35,844 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1435 transitions. Word has length 1245 [2018-10-14 18:09:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:35,845 INFO L481 AbstractCegarLoop]: Abstraction has 1423 states and 1435 transitions. [2018-10-14 18:09:35,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 18:09:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1435 transitions. [2018-10-14 18:09:35,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-10-14 18:09:35,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:35,857 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-14 18:09:35,858 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:35,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:35,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1540158718, now seen corresponding path program 23 times [2018-10-14 18:09:35,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:37,145 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-14 18:09:37,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:37,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 18:09:37,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 18:09:37,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 18:09:37,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:09:37,147 INFO L87 Difference]: Start difference. First operand 1423 states and 1435 transitions. Second operand 27 states. [2018-10-14 18:09:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:39,627 INFO L93 Difference]: Finished difference Result 1469 states and 1481 transitions. [2018-10-14 18:09:39,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-14 18:09:39,627 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1266 [2018-10-14 18:09:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:39,634 INFO L225 Difference]: With dead ends: 1469 [2018-10-14 18:09:39,634 INFO L226 Difference]: Without dead ends: 1469 [2018-10-14 18:09:39,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1146, Invalid=5334, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 18:09:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-14 18:09:39,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1437. [2018-10-14 18:09:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2018-10-14 18:09:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1449 transitions. [2018-10-14 18:09:39,645 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1449 transitions. Word has length 1266 [2018-10-14 18:09:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:39,645 INFO L481 AbstractCegarLoop]: Abstraction has 1437 states and 1449 transitions. [2018-10-14 18:09:39,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 18:09:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1449 transitions. [2018-10-14 18:09:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-10-14 18:09:39,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:39,656 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-14 18:09:39,656 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:39,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:39,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2137788330, now seen corresponding path program 24 times [2018-10-14 18:09:39,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:40,497 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:09:40,713 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:09:44,140 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-14 18:09:44,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:44,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 18:09:44,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 18:09:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 18:09:44,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1965, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:09:44,142 INFO L87 Difference]: Start difference. First operand 1437 states and 1449 transitions. Second operand 47 states. [2018-10-14 18:09:50,797 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-10-14 18:09:50,989 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-10-14 18:09:51,591 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-14 18:09:51,756 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-10-14 18:09:52,224 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-10-14 18:09:52,382 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-14 18:09:52,810 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-10-14 18:09:52,959 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-14 18:09:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:55,306 INFO L93 Difference]: Finished difference Result 1731 states and 1747 transitions. [2018-10-14 18:09:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 18:09:55,307 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1280 [2018-10-14 18:09:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:55,313 INFO L225 Difference]: With dead ends: 1731 [2018-10-14 18:09:55,313 INFO L226 Difference]: Without dead ends: 1731 [2018-10-14 18:09:55,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3616 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2564, Invalid=12198, Unknown=0, NotChecked=0, Total=14762 [2018-10-14 18:09:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2018-10-14 18:09:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1458. [2018-10-14 18:09:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2018-10-14 18:09:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1471 transitions. [2018-10-14 18:09:55,326 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1471 transitions. Word has length 1280 [2018-10-14 18:09:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:55,326 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 1471 transitions. [2018-10-14 18:09:55,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 18:09:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1471 transitions. [2018-10-14 18:09:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1302 [2018-10-14 18:09:55,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:55,340 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-14 18:09:55,340 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:55,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:55,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1985170648, now seen corresponding path program 25 times [2018-10-14 18:09:55,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:57,621 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-14 18:09:57,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:57,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 18:09:57,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 18:09:57,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 18:09:57,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 18:09:57,624 INFO L87 Difference]: Start difference. First operand 1458 states and 1471 transitions. Second operand 34 states. [2018-10-14 18:10:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:01,809 INFO L93 Difference]: Finished difference Result 1865 states and 1881 transitions. [2018-10-14 18:10:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-14 18:10:01,809 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1301 [2018-10-14 18:10:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:01,817 INFO L225 Difference]: With dead ends: 1865 [2018-10-14 18:10:01,817 INFO L226 Difference]: Without dead ends: 1865 [2018-10-14 18:10:01,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11090 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4561, Invalid=23831, Unknown=0, NotChecked=0, Total=28392 [2018-10-14 18:10:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2018-10-14 18:10:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1743. [2018-10-14 18:10:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2018-10-14 18:10:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 1758 transitions. [2018-10-14 18:10:01,833 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 1758 transitions. Word has length 1301 [2018-10-14 18:10:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:01,834 INFO L481 AbstractCegarLoop]: Abstraction has 1743 states and 1758 transitions. [2018-10-14 18:10:01,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 18:10:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 1758 transitions. [2018-10-14 18:10:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1566 [2018-10-14 18:10:01,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:01,848 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-14 18:10:01,848 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:01,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:01,849 INFO L82 PathProgramCache]: Analyzing trace with hash -638917902, now seen corresponding path program 26 times [2018-10-14 18:10:01,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:04,374 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-14 18:10:04,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:04,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 18:10:04,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 18:10:04,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 18:10:04,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-14 18:10:04,376 INFO L87 Difference]: Start difference. First operand 1743 states and 1758 transitions. Second operand 32 states. [2018-10-14 18:10:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:06,038 INFO L93 Difference]: Finished difference Result 1743 states and 1756 transitions. [2018-10-14 18:10:06,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 18:10:06,039 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1565 [2018-10-14 18:10:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:06,045 INFO L225 Difference]: With dead ends: 1743 [2018-10-14 18:10:06,045 INFO L226 Difference]: Without dead ends: 1743 [2018-10-14 18:10:06,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1044, Invalid=4358, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 18:10:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2018-10-14 18:10:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2018-10-14 18:10:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2018-10-14 18:10:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 1756 transitions. [2018-10-14 18:10:06,058 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 1756 transitions. Word has length 1565 [2018-10-14 18:10:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:06,059 INFO L481 AbstractCegarLoop]: Abstraction has 1743 states and 1756 transitions. [2018-10-14 18:10:06,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 18:10:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 1756 transitions. [2018-10-14 18:10:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1587 [2018-10-14 18:10:06,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:06,073 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-14 18:10:06,073 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:06,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:06,074 INFO L82 PathProgramCache]: Analyzing trace with hash -971739728, now seen corresponding path program 27 times [2018-10-14 18:10:06,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:07,882 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-14 18:10:07,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:07,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 18:10:07,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 18:10:07,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 18:10:07,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:10:07,884 INFO L87 Difference]: Start difference. First operand 1743 states and 1756 transitions. Second operand 31 states. [2018-10-14 18:10:11,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:11,064 INFO L93 Difference]: Finished difference Result 1789 states and 1802 transitions. [2018-10-14 18:10:11,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 18:10:11,065 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1586 [2018-10-14 18:10:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:11,072 INFO L225 Difference]: With dead ends: 1789 [2018-10-14 18:10:11,072 INFO L226 Difference]: Without dead ends: 1789 [2018-10-14 18:10:11,073 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-14 18:10:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-10-14 18:10:11,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1757. [2018-10-14 18:10:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1757 states. [2018-10-14 18:10:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 1770 transitions. [2018-10-14 18:10:11,086 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 1770 transitions. Word has length 1586 [2018-10-14 18:10:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:11,086 INFO L481 AbstractCegarLoop]: Abstraction has 1757 states and 1770 transitions. [2018-10-14 18:10:11,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 18:10:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 1770 transitions. [2018-10-14 18:10:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1601 [2018-10-14 18:10:11,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:11,101 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-14 18:10:11,101 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:11,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:11,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1485409756, now seen corresponding path program 28 times [2018-10-14 18:10:11,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:12,060 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 18:10:16,795 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-14 18:10:16,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:16,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 18:10:16,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 18:10:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 18:10:16,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2304, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:10:16,798 INFO L87 Difference]: Start difference. First operand 1757 states and 1770 transitions. Second operand 51 states. [2018-10-14 18:10:24,080 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 18:10:24,513 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:10:25,064 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:10:25,213 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 18:10:25,644 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:10:25,808 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 18:10:26,275 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:10:26,440 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-14 18:10:26,624 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-10-14 18:10:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:29,194 INFO L93 Difference]: Finished difference Result 2079 states and 2096 transitions. [2018-10-14 18:10:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-14 18:10:29,194 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1600 [2018-10-14 18:10:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:29,201 INFO L225 Difference]: With dead ends: 2079 [2018-10-14 18:10:29,201 INFO L226 Difference]: Without dead ends: 2079 [2018-10-14 18:10:29,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4534 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3237, Invalid=14853, Unknown=0, NotChecked=0, Total=18090 [2018-10-14 18:10:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2018-10-14 18:10:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1778. [2018-10-14 18:10:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-10-14 18:10:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 1792 transitions. [2018-10-14 18:10:29,220 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 1792 transitions. Word has length 1600 [2018-10-14 18:10:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:29,221 INFO L481 AbstractCegarLoop]: Abstraction has 1778 states and 1792 transitions. [2018-10-14 18:10:29,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 18:10:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 1792 transitions. [2018-10-14 18:10:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2018-10-14 18:10:29,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:29,240 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-14 18:10:29,240 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:29,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:29,240 INFO L82 PathProgramCache]: Analyzing trace with hash 116490002, now seen corresponding path program 29 times [2018-10-14 18:10:29,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:32,120 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-14 18:10:32,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:32,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 18:10:32,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 18:10:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 18:10:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 18:10:32,122 INFO L87 Difference]: Start difference. First operand 1778 states and 1792 transitions. Second operand 38 states. [2018-10-14 18:10:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:37,836 INFO L93 Difference]: Finished difference Result 2234 states and 2251 transitions. [2018-10-14 18:10:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-14 18:10:37,837 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1621 [2018-10-14 18:10:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:37,847 INFO L225 Difference]: With dead ends: 2234 [2018-10-14 18:10:37,847 INFO L226 Difference]: Without dead ends: 2234 [2018-10-14 18:10:37,851 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-14 18:10:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2018-10-14 18:10:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2098. [2018-10-14 18:10:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-14 18:10:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2114 transitions. [2018-10-14 18:10:37,869 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2114 transitions. Word has length 1621 [2018-10-14 18:10:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:37,870 INFO L481 AbstractCegarLoop]: Abstraction has 2098 states and 2114 transitions. [2018-10-14 18:10:37,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 18:10:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2114 transitions. [2018-10-14 18:10:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1921 [2018-10-14 18:10:37,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:37,893 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-14 18:10:37,893 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:37,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1769283606, now seen corresponding path program 30 times [2018-10-14 18:10:37,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:40,901 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-14 18:10:40,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:40,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 18:10:40,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 18:10:40,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 18:10:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 18:10:40,903 INFO L87 Difference]: Start difference. First operand 2098 states and 2114 transitions. Second operand 36 states. [2018-10-14 18:10:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:43,879 INFO L93 Difference]: Finished difference Result 2098 states and 2112 transitions. [2018-10-14 18:10:43,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-14 18:10:43,880 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1920 [2018-10-14 18:10:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:43,886 INFO L225 Difference]: With dead ends: 2098 [2018-10-14 18:10:43,886 INFO L226 Difference]: Without dead ends: 2098 [2018-10-14 18:10:43,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1343, Invalid=5629, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 18:10:43,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2018-10-14 18:10:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2098. [2018-10-14 18:10:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-14 18:10:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2112 transitions. [2018-10-14 18:10:43,902 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2112 transitions. Word has length 1920 [2018-10-14 18:10:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:43,903 INFO L481 AbstractCegarLoop]: Abstraction has 2098 states and 2112 transitions. [2018-10-14 18:10:43,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 18:10:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2112 transitions. [2018-10-14 18:10:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1942 [2018-10-14 18:10:43,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:43,924 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-14 18:10:43,924 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:43,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:43,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1499094708, now seen corresponding path program 31 times [2018-10-14 18:10:43,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:46,531 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-14 18:10:46,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:46,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 18:10:46,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 18:10:46,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 18:10:46,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:10:46,533 INFO L87 Difference]: Start difference. First operand 2098 states and 2112 transitions. Second operand 35 states. [2018-10-14 18:10:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:49,459 INFO L93 Difference]: Finished difference Result 2144 states and 2158 transitions. [2018-10-14 18:10:49,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 18:10:49,460 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1941 [2018-10-14 18:10:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:49,464 INFO L225 Difference]: With dead ends: 2144 [2018-10-14 18:10:49,464 INFO L226 Difference]: Without dead ends: 2144 [2018-10-14 18:10:49,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1994, Invalid=9348, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 18:10:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2018-10-14 18:10:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 2112. [2018-10-14 18:10:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2018-10-14 18:10:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2126 transitions. [2018-10-14 18:10:49,476 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2126 transitions. Word has length 1941 [2018-10-14 18:10:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:49,477 INFO L481 AbstractCegarLoop]: Abstraction has 2112 states and 2126 transitions. [2018-10-14 18:10:49,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 18:10:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2126 transitions. [2018-10-14 18:10:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1956 [2018-10-14 18:10:49,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:49,500 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-14 18:10:49,500 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:49,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1858913312, now seen corresponding path program 32 times [2018-10-14 18:10:49,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:57,135 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-14 18:10:57,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:57,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 18:10:57,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 18:10:57,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 18:10:57,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2524, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 18:10:57,138 INFO L87 Difference]: Start difference. First operand 2112 states and 2126 transitions. Second operand 53 states. [2018-10-14 18:11:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:08,991 INFO L93 Difference]: Finished difference Result 2462 states and 2480 transitions. [2018-10-14 18:11:08,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 18:11:08,991 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1955 [2018-10-14 18:11:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:08,995 INFO L225 Difference]: With dead ends: 2462 [2018-10-14 18:11:08,996 INFO L226 Difference]: Without dead ends: 2462 [2018-10-14 18:11:08,997 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-14 18:11:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2018-10-14 18:11:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2133. [2018-10-14 18:11:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2018-10-14 18:11:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2148 transitions. [2018-10-14 18:11:09,008 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2148 transitions. Word has length 1955 [2018-10-14 18:11:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:09,009 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2148 transitions. [2018-10-14 18:11:09,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 18:11:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2148 transitions. [2018-10-14 18:11:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1977 [2018-10-14 18:11:09,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:09,031 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-14 18:11:09,032 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:09,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2037488462, now seen corresponding path program 33 times [2018-10-14 18:11:09,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:12,416 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-14 18:11:12,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:12,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 18:11:12,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 18:11:12,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 18:11:12,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 18:11:12,418 INFO L87 Difference]: Start difference. First operand 2133 states and 2148 transitions. Second operand 42 states. [2018-10-14 18:11:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:19,254 INFO L93 Difference]: Finished difference Result 2638 states and 2656 transitions. [2018-10-14 18:11:19,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-10-14 18:11:19,255 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1976 [2018-10-14 18:11:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:19,260 INFO L225 Difference]: With dead ends: 2638 [2018-10-14 18:11:19,260 INFO L226 Difference]: Without dead ends: 2638 [2018-10-14 18:11:19,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23915 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8651, Invalid=48709, Unknown=0, NotChecked=0, Total=57360 [2018-10-14 18:11:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2018-10-14 18:11:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2488. [2018-10-14 18:11:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2018-10-14 18:11:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 2505 transitions. [2018-10-14 18:11:19,282 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 2505 transitions. Word has length 1976 [2018-10-14 18:11:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:19,283 INFO L481 AbstractCegarLoop]: Abstraction has 2488 states and 2505 transitions. [2018-10-14 18:11:19,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 18:11:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2505 transitions. [2018-10-14 18:11:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2311 [2018-10-14 18:11:19,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:19,321 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-14 18:11:19,321 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:19,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1339587456, now seen corresponding path program 34 times [2018-10-14 18:11:19,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:23,390 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-14 18:11:23,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:23,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 18:11:23,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 18:11:23,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 18:11:23,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 18:11:23,392 INFO L87 Difference]: Start difference. First operand 2488 states and 2505 transitions. Second operand 40 states. [2018-10-14 18:11:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:26,590 INFO L93 Difference]: Finished difference Result 2488 states and 2503 transitions. [2018-10-14 18:11:26,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 18:11:26,591 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2310 [2018-10-14 18:11:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:26,596 INFO L225 Difference]: With dead ends: 2488 [2018-10-14 18:11:26,596 INFO L226 Difference]: Without dead ends: 2488 [2018-10-14 18:11:26,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1680, Invalid=7062, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 18:11:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2018-10-14 18:11:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2488. [2018-10-14 18:11:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2018-10-14 18:11:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 2503 transitions. [2018-10-14 18:11:26,617 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 2503 transitions. Word has length 2310 [2018-10-14 18:11:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:26,618 INFO L481 AbstractCegarLoop]: Abstraction has 2488 states and 2503 transitions. [2018-10-14 18:11:26,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 18:11:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2503 transitions. [2018-10-14 18:11:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2332 [2018-10-14 18:11:26,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:26,659 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-14 18:11:26,659 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:26,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:26,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2066257298, now seen corresponding path program 35 times [2018-10-14 18:11:26,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:29,768 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-14 18:11:29,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:29,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 18:11:29,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 18:11:29,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 18:11:29,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:11:29,770 INFO L87 Difference]: Start difference. First operand 2488 states and 2503 transitions. Second operand 39 states. [2018-10-14 18:11:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:34,918 INFO L93 Difference]: Finished difference Result 2534 states and 2549 transitions. [2018-10-14 18:11:34,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-14 18:11:34,919 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 2331 [2018-10-14 18:11:34,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:34,928 INFO L225 Difference]: With dead ends: 2534 [2018-10-14 18:11:34,928 INFO L226 Difference]: Without dead ends: 2534 [2018-10-14 18:11:34,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3754 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2508, Invalid=11772, Unknown=0, NotChecked=0, Total=14280 [2018-10-14 18:11:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2018-10-14 18:11:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2502. [2018-10-14 18:11:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2502 states. [2018-10-14 18:11:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 2517 transitions. [2018-10-14 18:11:34,949 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 2517 transitions. Word has length 2331 [2018-10-14 18:11:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:34,951 INFO L481 AbstractCegarLoop]: Abstraction has 2502 states and 2517 transitions. [2018-10-14 18:11:34,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 18:11:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2517 transitions. [2018-10-14 18:11:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2346 [2018-10-14 18:11:34,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:34,991 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-14 18:11:34,991 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:34,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:34,992 INFO L82 PathProgramCache]: Analyzing trace with hash -519857346, now seen corresponding path program 36 times [2018-10-14 18:11:34,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:44,788 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-14 18:11:44,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:44,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 18:11:44,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 18:11:44,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 18:11:44,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3201, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 18:11:44,790 INFO L87 Difference]: Start difference. First operand 2502 states and 2517 transitions. Second operand 60 states. [2018-10-14 18:11:53,798 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 18:11:54,941 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-14 18:11:55,098 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 18:11:55,591 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:11:55,741 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 18:11:56,193 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:11:56,351 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 18:11:56,813 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:11:56,982 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 18:11:57,466 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:11:57,641 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 18:11:58,130 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:11:58,326 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 18:11:58,868 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 18:11:59,065 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-14 18:11:59,564 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-10-14 18:12:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:02,051 INFO L93 Difference]: Finished difference Result 2880 states and 2899 transitions. [2018-10-14 18:12:02,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-14 18:12:02,052 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2345 [2018-10-14 18:12:02,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:02,054 INFO L225 Difference]: With dead ends: 2880 [2018-10-14 18:12:02,054 INFO L226 Difference]: Without dead ends: 2880 [2018-10-14 18:12:02,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6381 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=4404, Invalid=20402, Unknown=0, NotChecked=0, Total=24806 [2018-10-14 18:12:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2018-10-14 18:12:02,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2523. [2018-10-14 18:12:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2018-10-14 18:12:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2539 transitions. [2018-10-14 18:12:02,073 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2539 transitions. Word has length 2345 [2018-10-14 18:12:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:02,075 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 2539 transitions. [2018-10-14 18:12:02,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 18:12:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2539 transitions. [2018-10-14 18:12:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2367 [2018-10-14 18:12:02,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:02,119 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-14 18:12:02,119 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:02,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1201470736, now seen corresponding path program 37 times [2018-10-14 18:12:02,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:06,624 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-14 18:12:06,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:06,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 18:12:06,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 18:12:06,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 18:12:06,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 18:12:06,626 INFO L87 Difference]: Start difference. First operand 2523 states and 2539 transitions. Second operand 46 states. [2018-10-14 18:12:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:15,165 INFO L93 Difference]: Finished difference Result 3077 states and 3096 transitions. [2018-10-14 18:12:15,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2018-10-14 18:12:15,165 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2366 [2018-10-14 18:12:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:15,168 INFO L225 Difference]: With dead ends: 3077 [2018-10-14 18:12:15,168 INFO L226 Difference]: Without dead ends: 3077 [2018-10-14 18:12:15,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33422 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11512, Invalid=66608, Unknown=0, NotChecked=0, Total=78120 [2018-10-14 18:12:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2018-10-14 18:12:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2913. [2018-10-14 18:12:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2018-10-14 18:12:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 2931 transitions. [2018-10-14 18:12:15,189 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 2931 transitions. Word has length 2366 [2018-10-14 18:12:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:15,189 INFO L481 AbstractCegarLoop]: Abstraction has 2913 states and 2931 transitions. [2018-10-14 18:12:15,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 18:12:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 2931 transitions. [2018-10-14 18:12:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2736 [2018-10-14 18:12:15,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:15,228 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-14 18:12:15,228 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:15,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash -435925280, now seen corresponding path program 38 times [2018-10-14 18:12:15,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:20,612 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-14 18:12:20,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:20,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 18:12:20,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 18:12:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 18:12:20,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1643, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:12:20,615 INFO L87 Difference]: Start difference. First operand 2913 states and 2931 transitions. Second operand 44 states. [2018-10-14 18:12:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:24,913 INFO L93 Difference]: Finished difference Result 2913 states and 2929 transitions. [2018-10-14 18:12:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-14 18:12:24,914 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2735 [2018-10-14 18:12:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:24,918 INFO L225 Difference]: With dead ends: 2913 [2018-10-14 18:12:24,918 INFO L226 Difference]: Without dead ends: 2913 [2018-10-14 18:12:24,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2384 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2055, Invalid=8657, Unknown=0, NotChecked=0, Total=10712 [2018-10-14 18:12:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2018-10-14 18:12:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2913. [2018-10-14 18:12:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2018-10-14 18:12:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 2929 transitions. [2018-10-14 18:12:24,934 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 2929 transitions. Word has length 2735 [2018-10-14 18:12:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:24,936 INFO L481 AbstractCegarLoop]: Abstraction has 2913 states and 2929 transitions. [2018-10-14 18:12:24,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 18:12:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 2929 transitions. [2018-10-14 18:12:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2757 [2018-10-14 18:12:24,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:24,974 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-14 18:12:24,974 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:24,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash -49264366, now seen corresponding path program 39 times [2018-10-14 18:12:24,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:29,071 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-14 18:12:29,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:29,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 18:12:29,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 18:12:29,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 18:12:29,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:12:29,073 INFO L87 Difference]: Start difference. First operand 2913 states and 2929 transitions. Second operand 43 states. [2018-10-14 18:12:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:34,727 INFO L93 Difference]: Finished difference Result 2959 states and 2975 transitions. [2018-10-14 18:12:34,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-14 18:12:34,728 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2756 [2018-10-14 18:12:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:34,731 INFO L225 Difference]: With dead ends: 2959 [2018-10-14 18:12:34,731 INFO L226 Difference]: Without dead ends: 2959 [2018-10-14 18:12:34,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4672 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3082, Invalid=14474, Unknown=0, NotChecked=0, Total=17556 [2018-10-14 18:12:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2018-10-14 18:12:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2927. [2018-10-14 18:12:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2927 states. [2018-10-14 18:12:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 2943 transitions. [2018-10-14 18:12:34,749 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 2943 transitions. Word has length 2756 [2018-10-14 18:12:34,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:34,751 INFO L481 AbstractCegarLoop]: Abstraction has 2927 states and 2943 transitions. [2018-10-14 18:12:34,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 18:12:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 2943 transitions. [2018-10-14 18:12:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2771 [2018-10-14 18:12:34,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:34,793 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-14 18:12:34,793 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:34,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1017470874, now seen corresponding path program 40 times [2018-10-14 18:12:34,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:47,881 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-14 18:12:47,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:47,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 18:12:47,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 18:12:47,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 18:12:47,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=3662, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 18:12:47,884 INFO L87 Difference]: Start difference. First operand 2927 states and 2943 transitions. Second operand 64 states. [2018-10-14 18:13:00,046 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-14 18:13:00,260 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-14 18:13:00,440 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-10-14 18:13:00,809 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-14 18:13:00,970 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-14 18:13:01,440 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-14 18:13:01,608 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-14 18:13:02,078 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-14 18:13:02,259 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-14 18:13:02,755 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-14 18:13:02,938 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-14 18:13:03,435 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-14 18:13:03,623 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-14 18:13:04,130 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-10-14 18:13:04,308 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-14 18:13:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:07,277 INFO L93 Difference]: Finished difference Result 3333 states and 3353 transitions. [2018-10-14 18:13:07,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-14 18:13:07,277 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2770 [2018-10-14 18:13:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:07,280 INFO L225 Difference]: With dead ends: 3333 [2018-10-14 18:13:07,281 INFO L226 Difference]: Without dead ends: 3333 [2018-10-14 18:13:07,282 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-14 18:13:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2018-10-14 18:13:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2948. [2018-10-14 18:13:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2018-10-14 18:13:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 2965 transitions. [2018-10-14 18:13:07,298 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 2965 transitions. Word has length 2770 [2018-10-14 18:13:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:07,299 INFO L481 AbstractCegarLoop]: Abstraction has 2948 states and 2965 transitions. [2018-10-14 18:13:07,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 18:13:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 2965 transitions. [2018-10-14 18:13:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2792 [2018-10-14 18:13:07,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:07,338 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-14 18:13:07,338 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:07,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:07,339 INFO L82 PathProgramCache]: Analyzing trace with hash 603342536, now seen corresponding path program 41 times [2018-10-14 18:13:07,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:13,137 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-14 18:13:13,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:13,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 18:13:13,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 18:13:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 18:13:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2130, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 18:13:13,140 INFO L87 Difference]: Start difference. First operand 2948 states and 2965 transitions. Second operand 50 states. [2018-10-14 18:13:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:23,658 INFO L93 Difference]: Finished difference Result 3551 states and 3571 transitions. [2018-10-14 18:13:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2018-10-14 18:13:23,659 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2791 [2018-10-14 18:13:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:23,663 INFO L225 Difference]: With dead ends: 3551 [2018-10-14 18:13:23,664 INFO L226 Difference]: Without dead ends: 3551 [2018-10-14 18:13:23,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45514 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=15036, Invalid=88970, Unknown=0, NotChecked=0, Total=104006 [2018-10-14 18:13:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2018-10-14 18:13:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 3373. [2018-10-14 18:13:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2018-10-14 18:13:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 3392 transitions. [2018-10-14 18:13:23,691 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 3392 transitions. Word has length 2791 [2018-10-14 18:13:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:23,692 INFO L481 AbstractCegarLoop]: Abstraction has 3373 states and 3392 transitions. [2018-10-14 18:13:23,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 18:13:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 3392 transitions. [2018-10-14 18:13:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3196 [2018-10-14 18:13:23,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:23,797 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-14 18:13:23,797 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:23,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:23,798 INFO L82 PathProgramCache]: Analyzing trace with hash -841095662, now seen corresponding path program 42 times [2018-10-14 18:13:23,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:30,770 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-14 18:13:30,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:30,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 18:13:30,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 18:13:30,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 18:13:30,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 18:13:30,773 INFO L87 Difference]: Start difference. First operand 3373 states and 3392 transitions. Second operand 48 states. [2018-10-14 18:13:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:34,910 INFO L93 Difference]: Finished difference Result 3373 states and 3390 transitions. [2018-10-14 18:13:34,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-14 18:13:34,911 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 3195 [2018-10-14 18:13:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:34,915 INFO L225 Difference]: With dead ends: 3373 [2018-10-14 18:13:34,915 INFO L226 Difference]: Without dead ends: 3373 [2018-10-14 18:13:34,916 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-14 18:13:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2018-10-14 18:13:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3373. [2018-10-14 18:13:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2018-10-14 18:13:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 3390 transitions. [2018-10-14 18:13:34,935 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 3390 transitions. Word has length 3195 [2018-10-14 18:13:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:34,936 INFO L481 AbstractCegarLoop]: Abstraction has 3373 states and 3390 transitions. [2018-10-14 18:13:34,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 18:13:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 3390 transitions. [2018-10-14 18:13:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3217 [2018-10-14 18:13:34,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:34,991 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-14 18:13:34,991 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:34,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:34,991 INFO L82 PathProgramCache]: Analyzing trace with hash -742410768, now seen corresponding path program 43 times [2018-10-14 18:13:34,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:40,132 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-14 18:13:40,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:40,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 18:13:40,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 18:13:40,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 18:13:40,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:13:40,135 INFO L87 Difference]: Start difference. First operand 3373 states and 3390 transitions. Second operand 47 states. [2018-10-14 18:13:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:46,019 INFO L93 Difference]: Finished difference Result 3419 states and 3436 transitions. [2018-10-14 18:13:46,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-14 18:13:46,020 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 3216 [2018-10-14 18:13:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:46,024 INFO L225 Difference]: With dead ends: 3419 [2018-10-14 18:13:46,025 INFO L226 Difference]: Without dead ends: 3419 [2018-10-14 18:13:46,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3716, Invalid=17454, Unknown=0, NotChecked=0, Total=21170 [2018-10-14 18:13:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2018-10-14 18:13:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3387. [2018-10-14 18:13:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3387 states. [2018-10-14 18:13:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 3404 transitions. [2018-10-14 18:13:46,043 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 3404 transitions. Word has length 3216 [2018-10-14 18:13:46,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:46,045 INFO L481 AbstractCegarLoop]: Abstraction has 3387 states and 3404 transitions. [2018-10-14 18:13:46,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 18:13:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 3404 transitions. [2018-10-14 18:13:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3231 [2018-10-14 18:13:46,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:46,097 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-14 18:13:46,097 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:46,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1816733668, now seen corresponding path program 44 times [2018-10-14 18:13:46,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:03,104 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-14 18:14:03,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:03,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-14 18:14:03,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-14 18:14:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-14 18:14:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=4113, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 18:14:03,107 INFO L87 Difference]: Start difference. First operand 3387 states and 3404 transitions. Second operand 68 states. [2018-10-14 18:14:14,489 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 18:14:15,063 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 18:14:15,669 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 18:14:16,940 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 18:14:17,164 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 18:14:17,689 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 18:14:17,872 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 18:14:18,390 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 18:14:18,591 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 18:14:19,112 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 18:14:19,300 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-10-14 18:14:19,826 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-10-14 18:14:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:22,661 INFO L93 Difference]: Finished difference Result 3821 states and 3842 transitions. [2018-10-14 18:14:22,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-14 18:14:22,662 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 3230 [2018-10-14 18:14:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:22,666 INFO L225 Difference]: With dead ends: 3821 [2018-10-14 18:14:22,666 INFO L226 Difference]: Without dead ends: 3821 [2018-10-14 18:14:22,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8379 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=5739, Invalid=26481, Unknown=0, NotChecked=0, Total=32220 [2018-10-14 18:14:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2018-10-14 18:14:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3408. [2018-10-14 18:14:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3408 states. [2018-10-14 18:14:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 3426 transitions. [2018-10-14 18:14:22,688 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 3426 transitions. Word has length 3230 [2018-10-14 18:14:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:22,690 INFO L481 AbstractCegarLoop]: Abstraction has 3408 states and 3426 transitions. [2018-10-14 18:14:22,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-14 18:14:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 3426 transitions. [2018-10-14 18:14:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3252 [2018-10-14 18:14:22,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:22,783 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-14 18:14:22,784 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:22,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:22,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1018880814, now seen corresponding path program 45 times [2018-10-14 18:14:22,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:30,563 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-14 18:14:30,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:30,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 18:14:30,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 18:14:30,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 18:14:30,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2490, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 18:14:30,566 INFO L87 Difference]: Start difference. First operand 3408 states and 3426 transitions. Second operand 54 states. [2018-10-14 18:14:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:42,732 INFO L93 Difference]: Finished difference Result 4060 states and 4081 transitions. [2018-10-14 18:14:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 319 states. [2018-10-14 18:14:42,733 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 3251 [2018-10-14 18:14:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:42,737 INFO L225 Difference]: With dead ends: 4060 [2018-10-14 18:14:42,737 INFO L226 Difference]: Without dead ends: 4060 [2018-10-14 18:14:42,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60625 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=19321, Invalid=116471, Unknown=0, NotChecked=0, Total=135792 [2018-10-14 18:14:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2018-10-14 18:14:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 3868. [2018-10-14 18:14:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3868 states. [2018-10-14 18:14:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 3888 transitions. [2018-10-14 18:14:42,764 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 3888 transitions. Word has length 3251 [2018-10-14 18:14:42,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:42,766 INFO L481 AbstractCegarLoop]: Abstraction has 3868 states and 3888 transitions. [2018-10-14 18:14:42,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 18:14:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 3888 transitions. [2018-10-14 18:14:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3691 [2018-10-14 18:14:42,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:42,830 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-14 18:14:42,830 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:42,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:42,830 INFO L82 PathProgramCache]: Analyzing trace with hash -472780762, now seen corresponding path program 46 times [2018-10-14 18:14:42,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:51,986 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-14 18:14:51,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:51,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 18:14:51,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 18:14:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 18:14:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2307, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 18:14:51,988 INFO L87 Difference]: Start difference. First operand 3868 states and 3888 transitions. Second operand 52 states. [2018-10-14 18:14:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:56,797 INFO L93 Difference]: Finished difference Result 3868 states and 3886 transitions. [2018-10-14 18:14:56,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 18:14:56,797 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 3690 [2018-10-14 18:14:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:56,802 INFO L225 Difference]: With dead ends: 3868 [2018-10-14 18:14:56,803 INFO L226 Difference]: Without dead ends: 3868 [2018-10-14 18:14:56,804 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-14 18:14:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2018-10-14 18:14:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3868. [2018-10-14 18:14:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3868 states. [2018-10-14 18:14:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 3886 transitions. [2018-10-14 18:14:56,823 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 3886 transitions. Word has length 3690 [2018-10-14 18:14:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:56,824 INFO L481 AbstractCegarLoop]: Abstraction has 3868 states and 3886 transitions. [2018-10-14 18:14:56,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 18:14:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 3886 transitions. [2018-10-14 18:14:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3712 [2018-10-14 18:14:56,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:56,890 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-14 18:14:56,890 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:56,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:56,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1198785500, now seen corresponding path program 47 times [2018-10-14 18:14:56,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:15:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 132072 backedges. 48973 proven. 1214 refuted. 0 times theorem prover too weak. 81885 trivial. 0 not checked. [2018-10-14 18:15:04,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:15:04,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 18:15:04,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 18:15:04,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 18:15:04,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:15:04,684 INFO L87 Difference]: Start difference. First operand 3868 states and 3886 transitions. Second operand 51 states.