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/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:22:41,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:22:41,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:22:41,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:22:41,591 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:22:41,592 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:22:41,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:22:41,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:22:41,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:22:41,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:22:41,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:22:41,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:22:41,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:22:41,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:22:41,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:22:41,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:22:41,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:22:41,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:22:41,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:22:41,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:22:41,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:22:41,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:22:41,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:22:41,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:22:41,614 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:22:41,615 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:22:41,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:22:41,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:22:41,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:22:41,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:22:41,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:22:41,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:22:41,619 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:22:41,620 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:22:41,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:22:41,621 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:22:41,622 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 16:22:41,631 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:22:41,631 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:22:41,632 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:22:41,632 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:22:41,632 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:22:41,633 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:22:41,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:22:41,634 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:22:41,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:22:41,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:22:41,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:22:41,634 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:22:41,635 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:22:41,636 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:22:41,636 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:22:41,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:22:41,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:22:41,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:22:41,698 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:22:41,698 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:22:41,699 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl [2018-10-10 16:22:41,699 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl' [2018-10-10 16:22:41,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:22:41,776 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:22:41,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:22:41,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:22:41,777 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:22:41,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:41" (1/1) ... [2018-10-10 16:22:41,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:41" (1/1) ... [2018-10-10 16:22:41,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:41" (1/1) ... [2018-10-10 16:22:41,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:41" (1/1) ... [2018-10-10 16:22:41,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:41" (1/1) ... [2018-10-10 16:22:41,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:41" (1/1) ... [2018-10-10 16:22:41,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:41" (1/1) ... [2018-10-10 16:22:41,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:22:41,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:22:41,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:22:41,846 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:22:41,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 16:22:41,927 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:22:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:22:41,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:22:42,502 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:22:42,503 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:22:42 BoogieIcfgContainer [2018-10-10 16:22:42,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:22:42,504 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:22:42,504 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:22:42,505 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:22:42,509 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:22:42" (1/1) ... [2018-10-10 16:22:42,518 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:22:42,518 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:22:42,556 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:22:42,594 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:22:42,610 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:22:42,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:22:47,858 INFO L315 AbstractInterpreter]: Visited 62 different actions 246 times. Merged at 43 different actions 175 times. Widened at 3 different actions 5 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-10-10 16:22:47,860 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:22:47,864 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:22:47,898 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_7|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-10 16:22:47,902 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:22:47,902 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_6|) |v_ULTIMATE.start_read~int_#ptr.offset_4|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:22:47,904 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:22:47,904 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:47,904 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:47,905 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:47,905 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:47,905 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:47,905 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:47,905 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:47,906 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:47,906 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:47,906 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:47,906 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:47,906 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:47,907 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:47,907 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:47,909 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:22:47,930 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:47 BasicIcfg [2018-10-10 16:22:47,930 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:22:47,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:22:47,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:22:47,934 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:22:47,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:41" (1/3) ... [2018-10-10 16:22:47,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b33bfa4 and model type ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:22:47, skipping insertion in model container [2018-10-10 16:22:47,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:22:42" (2/3) ... [2018-10-10 16:22:47,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b33bfa4 and model type ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:22:47, skipping insertion in model container [2018-10-10 16:22:47,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:47" (3/3) ... [2018-10-10 16:22:47,938 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:22:47,948 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:22:47,957 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:22:47,974 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:22:47,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:22:48,000 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:22:48,001 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:22:48,001 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:22:48,001 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:22:48,001 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:22:48,001 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:22:48,002 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:22:48,002 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:22:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-10-10 16:22:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-10 16:22:48,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:48,031 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] [2018-10-10 16:22:48,033 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:48,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:48,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2033921432, now seen corresponding path program 1 times [2018-10-10 16:22:48,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:22:49,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:22:49,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 16:22:49,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:22:49,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:22:49,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:22:49,223 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 8 states. [2018-10-10 16:22:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:49,969 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-10 16:22:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 16:22:49,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-10-10 16:22:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:49,983 INFO L225 Difference]: With dead ends: 129 [2018-10-10 16:22:49,983 INFO L226 Difference]: Without dead ends: 129 [2018-10-10 16:22:49,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-10-10 16:22:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-10 16:22:50,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 91. [2018-10-10 16:22:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-10 16:22:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-10-10 16:22:50,028 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 36 [2018-10-10 16:22:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:50,029 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-10 16:22:50,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:22:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-10-10 16:22:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 16:22:50,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:50,032 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:50,032 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:50,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash -465539871, now seen corresponding path program 1 times [2018-10-10 16:22:50,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:22:50,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:50,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:22:50,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:22:50,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:22:50,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:22:50,311 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 8 states. [2018-10-10 16:22:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:50,984 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-10-10 16:22:50,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:22:50,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-10 16:22:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:50,988 INFO L225 Difference]: With dead ends: 159 [2018-10-10 16:22:50,988 INFO L226 Difference]: Without dead ends: 159 [2018-10-10 16:22:50,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:22:50,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-10 16:22:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 110. [2018-10-10 16:22:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 16:22:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-10-10 16:22:51,000 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 62 [2018-10-10 16:22:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:51,000 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-10-10 16:22:51,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:22:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-10-10 16:22:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 16:22:51,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:51,003 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:51,004 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:51,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash -283832255, now seen corresponding path program 1 times [2018-10-10 16:22:51,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:22:51,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:51,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:51,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:51,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:51,455 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 10 states. [2018-10-10 16:22:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:52,064 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2018-10-10 16:22:52,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:22:52,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-10-10 16:22:52,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:52,067 INFO L225 Difference]: With dead ends: 170 [2018-10-10 16:22:52,067 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 16:22:52,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:22:52,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 16:22:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2018-10-10 16:22:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 16:22:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-10-10 16:22:52,078 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 77 [2018-10-10 16:22:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:52,079 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-10-10 16:22:52,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-10-10 16:22:52,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 16:22:52,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:52,081 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:52,082 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:52,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:52,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1272455606, now seen corresponding path program 2 times [2018-10-10 16:22:52,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:22:52,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:52,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:52,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:52,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:52,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:52,306 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 10 states. [2018-10-10 16:22:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:52,695 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2018-10-10 16:22:52,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:22:52,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-10-10 16:22:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:52,699 INFO L225 Difference]: With dead ends: 158 [2018-10-10 16:22:52,699 INFO L226 Difference]: Without dead ends: 158 [2018-10-10 16:22:52,700 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-10 16:22:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-10 16:22:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2018-10-10 16:22:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-10 16:22:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-10-10 16:22:52,708 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 103 [2018-10-10 16:22:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:52,709 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-10-10 16:22:52,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-10-10 16:22:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-10 16:22:52,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:52,711 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:52,711 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:52,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:52,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1544650680, now seen corresponding path program 3 times [2018-10-10 16:22:52,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:22:52,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:52,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:22:52,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:22:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:22:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:22:52,995 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 12 states. [2018-10-10 16:22:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:53,904 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-10 16:22:53,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 16:22:53,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2018-10-10 16:22:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:53,907 INFO L225 Difference]: With dead ends: 160 [2018-10-10 16:22:53,907 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 16:22:53,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:22:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 16:22:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2018-10-10 16:22:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 16:22:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2018-10-10 16:22:53,916 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 118 [2018-10-10 16:22:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:53,917 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2018-10-10 16:22:53,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:22:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2018-10-10 16:22:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-10 16:22:53,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:53,919 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:53,920 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:53,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1849627786, now seen corresponding path program 4 times [2018-10-10 16:22:53,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 16:22:54,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:54,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:22:54,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:22:54,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:22:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:22:54,279 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 12 states. [2018-10-10 16:22:54,629 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 16:22:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:55,215 INFO L93 Difference]: Finished difference Result 258 states and 263 transitions. [2018-10-10 16:22:55,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 16:22:55,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2018-10-10 16:22:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:55,218 INFO L225 Difference]: With dead ends: 258 [2018-10-10 16:22:55,218 INFO L226 Difference]: Without dead ends: 258 [2018-10-10 16:22:55,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:22:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-10 16:22:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2018-10-10 16:22:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 16:22:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2018-10-10 16:22:55,228 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 133 [2018-10-10 16:22:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:55,229 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2018-10-10 16:22:55,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:22:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2018-10-10 16:22:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-10 16:22:55,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:55,233 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:55,233 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:55,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:55,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1858316755, now seen corresponding path program 5 times [2018-10-10 16:22:55,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 86 proven. 198 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 16:22:55,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:55,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:22:55,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:22:55,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:22:55,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:22:55,783 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand 16 states. [2018-10-10 16:22:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:56,680 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-10-10 16:22:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:22:56,681 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 189 [2018-10-10 16:22:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:56,683 INFO L225 Difference]: With dead ends: 231 [2018-10-10 16:22:56,683 INFO L226 Difference]: Without dead ends: 231 [2018-10-10 16:22:56,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:22:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-10 16:22:56,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2018-10-10 16:22:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 16:22:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2018-10-10 16:22:56,690 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 189 [2018-10-10 16:22:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:56,691 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2018-10-10 16:22:56,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:22:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2018-10-10 16:22:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-10 16:22:56,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:56,695 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:56,695 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:56,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash 437653775, now seen corresponding path program 6 times [2018-10-10 16:22:56,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-10 16:22:57,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:57,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:22:57,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:22:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:22:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:22:57,344 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 20 states. [2018-10-10 16:23:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:01,110 INFO L93 Difference]: Finished difference Result 461 states and 468 transitions. [2018-10-10 16:23:01,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 16:23:01,111 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 204 [2018-10-10 16:23:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:01,114 INFO L225 Difference]: With dead ends: 461 [2018-10-10 16:23:01,114 INFO L226 Difference]: Without dead ends: 460 [2018-10-10 16:23:01,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1079, Invalid=4033, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:23:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-10 16:23:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 276. [2018-10-10 16:23:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 16:23:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2018-10-10 16:23:01,124 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 204 [2018-10-10 16:23:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:01,124 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2018-10-10 16:23:01,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:23:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2018-10-10 16:23:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-10 16:23:01,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:01,129 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:01,129 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:01,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:01,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2086374634, now seen corresponding path program 7 times [2018-10-10 16:23:01,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 733 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-10 16:23:02,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:02,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:23:02,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:23:02,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:23:02,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:23:02,668 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 22 states. [2018-10-10 16:23:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:06,990 INFO L93 Difference]: Finished difference Result 531 states and 539 transitions. [2018-10-10 16:23:06,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 16:23:06,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 275 [2018-10-10 16:23:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:06,995 INFO L225 Difference]: With dead ends: 531 [2018-10-10 16:23:06,995 INFO L226 Difference]: Without dead ends: 531 [2018-10-10 16:23:06,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1421, Invalid=5719, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 16:23:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-10 16:23:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 347. [2018-10-10 16:23:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-10 16:23:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 352 transitions. [2018-10-10 16:23:07,006 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 352 transitions. Word has length 275 [2018-10-10 16:23:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:07,007 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 352 transitions. [2018-10-10 16:23:07,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:23:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 352 transitions. [2018-10-10 16:23:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-10 16:23:07,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:07,012 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:07,012 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:07,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash -179934033, now seen corresponding path program 8 times [2018-10-10 16:23:07,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 1284 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-10-10 16:23:08,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:08,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:23:08,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:23:08,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:23:08,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:23:08,195 INFO L87 Difference]: Start difference. First operand 347 states and 352 transitions. Second operand 24 states. [2018-10-10 16:23:08,470 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-10-10 16:23:12,381 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-10 16:23:13,918 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-10 16:23:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:14,375 INFO L93 Difference]: Finished difference Result 602 states and 611 transitions. [2018-10-10 16:23:14,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 16:23:14,376 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 346 [2018-10-10 16:23:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:14,381 INFO L225 Difference]: With dead ends: 602 [2018-10-10 16:23:14,381 INFO L226 Difference]: Without dead ends: 602 [2018-10-10 16:23:14,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1820, Invalid=7686, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 16:23:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-10-10 16:23:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 418. [2018-10-10 16:23:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-10 16:23:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 424 transitions. [2018-10-10 16:23:14,394 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 424 transitions. Word has length 346 [2018-10-10 16:23:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:14,394 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 424 transitions. [2018-10-10 16:23:14,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:23:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 424 transitions. [2018-10-10 16:23:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-10 16:23:14,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:14,397 INFO L375 BasicCegarLoop]: trace histogram [15, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:14,398 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:14,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash 673701194, now seen corresponding path program 9 times [2018-10-10 16:23:14,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-10-10 16:23:15,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:15,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:23:15,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:23:15,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:23:15,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:23:15,659 INFO L87 Difference]: Start difference. First operand 418 states and 424 transitions. Second operand 26 states. [2018-10-10 16:23:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:22,453 INFO L93 Difference]: Finished difference Result 673 states and 683 transitions. [2018-10-10 16:23:22,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-10 16:23:22,453 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 417 [2018-10-10 16:23:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:22,457 INFO L225 Difference]: With dead ends: 673 [2018-10-10 16:23:22,457 INFO L226 Difference]: Without dead ends: 673 [2018-10-10 16:23:22,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3792 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2276, Invalid=9934, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 16:23:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-10 16:23:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 489. [2018-10-10 16:23:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-10 16:23:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 496 transitions. [2018-10-10 16:23:22,471 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 496 transitions. Word has length 417 [2018-10-10 16:23:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:22,472 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 496 transitions. [2018-10-10 16:23:22,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:23:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 496 transitions. [2018-10-10 16:23:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-10-10 16:23:22,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:22,476 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:22,477 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:22,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:22,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1082388559, now seen corresponding path program 10 times [2018-10-10 16:23:22,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3111 backedges. 0 proven. 2887 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-10-10 16:23:23,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:23,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:23:23,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:23:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:23:23,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:23:23,921 INFO L87 Difference]: Start difference. First operand 489 states and 496 transitions. Second operand 28 states. [2018-10-10 16:23:24,812 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-10-10 16:23:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:32,111 INFO L93 Difference]: Finished difference Result 744 states and 755 transitions. [2018-10-10 16:23:32,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-10 16:23:32,112 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 488 [2018-10-10 16:23:32,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:32,117 INFO L225 Difference]: With dead ends: 744 [2018-10-10 16:23:32,117 INFO L226 Difference]: Without dead ends: 744 [2018-10-10 16:23:32,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4919 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2789, Invalid=12463, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 16:23:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-10 16:23:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 560. [2018-10-10 16:23:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-10 16:23:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 568 transitions. [2018-10-10 16:23:32,132 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 568 transitions. Word has length 488 [2018-10-10 16:23:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:32,133 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 568 transitions. [2018-10-10 16:23:32,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:23:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 568 transitions. [2018-10-10 16:23:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-10 16:23:32,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:32,137 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:32,138 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:32,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1066010026, now seen corresponding path program 11 times [2018-10-10 16:23:32,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3939 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-10 16:23:34,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:34,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:23:34,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:23:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:23:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:23:34,193 INFO L87 Difference]: Start difference. First operand 560 states and 568 transitions. Second operand 30 states. [2018-10-10 16:23:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:42,980 INFO L93 Difference]: Finished difference Result 815 states and 827 transitions. [2018-10-10 16:23:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-10 16:23:42,980 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 559 [2018-10-10 16:23:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:42,985 INFO L225 Difference]: With dead ends: 815 [2018-10-10 16:23:42,985 INFO L226 Difference]: Without dead ends: 815 [2018-10-10 16:23:42,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6196 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3359, Invalid=15273, Unknown=0, NotChecked=0, Total=18632 [2018-10-10 16:23:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-10-10 16:23:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 631. [2018-10-10 16:23:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-10 16:23:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 640 transitions. [2018-10-10 16:23:43,001 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 640 transitions. Word has length 559 [2018-10-10 16:23:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:43,002 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 640 transitions. [2018-10-10 16:23:43,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:23:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 640 transitions. [2018-10-10 16:23:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-10-10 16:23:43,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:43,007 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:43,007 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:43,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash 254319599, now seen corresponding path program 12 times [2018-10-10 16:23:43,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 0 proven. 5158 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-10 16:23:45,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:45,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:23:45,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:23:45,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:23:45,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:23:45,194 INFO L87 Difference]: Start difference. First operand 631 states and 640 transitions. Second operand 32 states. [2018-10-10 16:23:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:54,756 INFO L93 Difference]: Finished difference Result 886 states and 899 transitions. [2018-10-10 16:23:54,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-10 16:23:54,763 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 630 [2018-10-10 16:23:54,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:54,767 INFO L225 Difference]: With dead ends: 886 [2018-10-10 16:23:54,767 INFO L226 Difference]: Without dead ends: 886 [2018-10-10 16:23:54,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7623 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3986, Invalid=18364, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 16:23:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-10-10 16:23:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 702. [2018-10-10 16:23:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-10-10 16:23:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 712 transitions. [2018-10-10 16:23:54,780 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 712 transitions. Word has length 630 [2018-10-10 16:23:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:54,781 INFO L481 AbstractCegarLoop]: Abstraction has 702 states and 712 transitions. [2018-10-10 16:23:54,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:23:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 712 transitions. [2018-10-10 16:23:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2018-10-10 16:23:54,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:54,786 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:54,787 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:54,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:54,787 INFO L82 PathProgramCache]: Analyzing trace with hash -437778934, now seen corresponding path program 13 times [2018-10-10 16:23:54,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 6544 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-10-10 16:23:57,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:57,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:23:57,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:23:57,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:23:57,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:23:57,623 INFO L87 Difference]: Start difference. First operand 702 states and 712 transitions. Second operand 34 states. [2018-10-10 16:24:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:08,108 INFO L93 Difference]: Finished difference Result 957 states and 971 transitions. [2018-10-10 16:24:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-10 16:24:08,108 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 701 [2018-10-10 16:24:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:08,112 INFO L225 Difference]: With dead ends: 957 [2018-10-10 16:24:08,113 INFO L226 Difference]: Without dead ends: 957 [2018-10-10 16:24:08,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9200 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=4670, Invalid=21736, Unknown=0, NotChecked=0, Total=26406 [2018-10-10 16:24:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-10-10 16:24:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 773. [2018-10-10 16:24:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-10-10 16:24:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 784 transitions. [2018-10-10 16:24:08,127 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 784 transitions. Word has length 701 [2018-10-10 16:24:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:08,128 INFO L481 AbstractCegarLoop]: Abstraction has 773 states and 784 transitions. [2018-10-10 16:24:08,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:24:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 784 transitions. [2018-10-10 16:24:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-10-10 16:24:08,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:08,135 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:08,135 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:08,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash -284266609, now seen corresponding path program 14 times [2018-10-10 16:24:08,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8513 backedges. 0 proven. 8097 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-10-10 16:24:10,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:10,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:24:10,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:24:10,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:24:10,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:24:10,736 INFO L87 Difference]: Start difference. First operand 773 states and 784 transitions. Second operand 36 states. [2018-10-10 16:24:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:22,840 INFO L93 Difference]: Finished difference Result 1028 states and 1043 transitions. [2018-10-10 16:24:22,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-10 16:24:22,841 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 772 [2018-10-10 16:24:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:22,845 INFO L225 Difference]: With dead ends: 1028 [2018-10-10 16:24:22,846 INFO L226 Difference]: Without dead ends: 1028 [2018-10-10 16:24:22,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10927 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=5411, Invalid=25389, Unknown=0, NotChecked=0, Total=30800 [2018-10-10 16:24:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-10-10 16:24:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 844. [2018-10-10 16:24:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-10 16:24:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 856 transitions. [2018-10-10 16:24:22,861 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 856 transitions. Word has length 772 [2018-10-10 16:24:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:22,862 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 856 transitions. [2018-10-10 16:24:22,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:24:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 856 transitions. [2018-10-10 16:24:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-10-10 16:24:22,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:22,869 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:22,869 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:22,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash -198713750, now seen corresponding path program 15 times [2018-10-10 16:24:22,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10281 backedges. 0 proven. 9817 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2018-10-10 16:24:26,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:26,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:24:26,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:24:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:24:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:24:26,178 INFO L87 Difference]: Start difference. First operand 844 states and 856 transitions. Second operand 38 states. [2018-10-10 16:24:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:38,896 INFO L93 Difference]: Finished difference Result 1099 states and 1115 transitions. [2018-10-10 16:24:38,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-10 16:24:38,896 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 843 [2018-10-10 16:24:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:38,901 INFO L225 Difference]: With dead ends: 1099 [2018-10-10 16:24:38,901 INFO L226 Difference]: Without dead ends: 1099 [2018-10-10 16:24:38,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12804 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=6209, Invalid=29323, Unknown=0, NotChecked=0, Total=35532 [2018-10-10 16:24:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-10-10 16:24:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 915. [2018-10-10 16:24:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-10-10 16:24:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 928 transitions. [2018-10-10 16:24:38,915 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 928 transitions. Word has length 843 [2018-10-10 16:24:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:38,916 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 928 transitions. [2018-10-10 16:24:38,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:24:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 928 transitions. [2018-10-10 16:24:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2018-10-10 16:24:38,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:38,924 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:38,924 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:38,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2003866833, now seen corresponding path program 16 times [2018-10-10 16:24:38,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12216 backedges. 0 proven. 11704 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-10-10 16:24:42,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:42,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:24:42,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:24:42,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:24:42,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:24:42,480 INFO L87 Difference]: Start difference. First operand 915 states and 928 transitions. Second operand 40 states. [2018-10-10 16:24:52,574 WARN L178 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-10 16:24:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:57,317 INFO L93 Difference]: Finished difference Result 1170 states and 1187 transitions. [2018-10-10 16:24:57,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-10 16:24:57,317 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 914 [2018-10-10 16:24:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:57,321 INFO L225 Difference]: With dead ends: 1170 [2018-10-10 16:24:57,321 INFO L226 Difference]: Without dead ends: 1170 [2018-10-10 16:24:57,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14831 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=7064, Invalid=33538, Unknown=0, NotChecked=0, Total=40602 [2018-10-10 16:24:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-10-10 16:24:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 986. [2018-10-10 16:24:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-10 16:24:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1000 transitions. [2018-10-10 16:24:57,335 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1000 transitions. Word has length 914 [2018-10-10 16:24:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:57,336 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1000 transitions. [2018-10-10 16:24:57,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:24:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1000 transitions. [2018-10-10 16:24:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2018-10-10 16:24:57,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:57,346 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:57,346 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:57,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:57,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1487900362, now seen corresponding path program 17 times [2018-10-10 16:24:57,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 0 proven. 13758 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2018-10-10 16:25:02,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:02,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:25:02,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:25:02,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:25:02,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1434, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:25:02,545 INFO L87 Difference]: Start difference. First operand 986 states and 1000 transitions. Second operand 42 states. [2018-10-10 16:25:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:18,178 INFO L93 Difference]: Finished difference Result 1241 states and 1259 transitions. [2018-10-10 16:25:18,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-10 16:25:18,178 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 985 [2018-10-10 16:25:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:18,182 INFO L225 Difference]: With dead ends: 1241 [2018-10-10 16:25:18,182 INFO L226 Difference]: Without dead ends: 1241 [2018-10-10 16:25:18,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17008 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=7976, Invalid=38034, Unknown=0, NotChecked=0, Total=46010 [2018-10-10 16:25:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-10-10 16:25:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1057. [2018-10-10 16:25:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2018-10-10 16:25:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1072 transitions. [2018-10-10 16:25:18,195 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1072 transitions. Word has length 985 [2018-10-10 16:25:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:18,196 INFO L481 AbstractCegarLoop]: Abstraction has 1057 states and 1072 transitions. [2018-10-10 16:25:18,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:25:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1072 transitions. [2018-10-10 16:25:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2018-10-10 16:25:18,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:18,206 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:18,207 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:18,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:18,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1048940239, now seen corresponding path program 18 times [2018-10-10 16:25:18,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16587 backedges. 0 proven. 15979 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-10-10 16:25:23,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:23,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:25:23,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:25:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:25:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:25:23,560 INFO L87 Difference]: Start difference. First operand 1057 states and 1072 transitions. Second operand 44 states. [2018-10-10 16:25:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:40,625 INFO L93 Difference]: Finished difference Result 1312 states and 1331 transitions. [2018-10-10 16:25:40,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-10 16:25:40,626 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1056 [2018-10-10 16:25:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:40,631 INFO L225 Difference]: With dead ends: 1312 [2018-10-10 16:25:40,631 INFO L226 Difference]: Without dead ends: 1312 [2018-10-10 16:25:40,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19335 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=8945, Invalid=42811, Unknown=0, NotChecked=0, Total=51756 [2018-10-10 16:25:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2018-10-10 16:25:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1128. [2018-10-10 16:25:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2018-10-10 16:25:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1144 transitions. [2018-10-10 16:25:40,645 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1144 transitions. Word has length 1056 [2018-10-10 16:25:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:40,645 INFO L481 AbstractCegarLoop]: Abstraction has 1128 states and 1144 transitions. [2018-10-10 16:25:40,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:25:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1144 transitions. [2018-10-10 16:25:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1128 [2018-10-10 16:25:40,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:40,657 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:40,657 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:40,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:40,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2003113770, now seen corresponding path program 19 times [2018-10-10 16:25:40,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 19023 backedges. 0 proven. 18367 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-10-10 16:25:45,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:45,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:25:45,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:25:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:25:45,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:25:45,887 INFO L87 Difference]: Start difference. First operand 1128 states and 1144 transitions. Second operand 46 states. [2018-10-10 16:26:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:04,751 INFO L93 Difference]: Finished difference Result 1383 states and 1403 transitions. [2018-10-10 16:26:04,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-10 16:26:04,751 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1127 [2018-10-10 16:26:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:04,756 INFO L225 Difference]: With dead ends: 1383 [2018-10-10 16:26:04,756 INFO L226 Difference]: Without dead ends: 1383 [2018-10-10 16:26:04,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21812 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=9971, Invalid=47869, Unknown=0, NotChecked=0, Total=57840 [2018-10-10 16:26:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-10-10 16:26:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1199. [2018-10-10 16:26:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-10-10 16:26:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1216 transitions. [2018-10-10 16:26:04,772 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1216 transitions. Word has length 1127 [2018-10-10 16:26:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:04,773 INFO L481 AbstractCegarLoop]: Abstraction has 1199 states and 1216 transitions. [2018-10-10 16:26:04,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:26:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1216 transitions. [2018-10-10 16:26:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2018-10-10 16:26:04,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:04,788 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:04,788 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:04,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:04,788 INFO L82 PathProgramCache]: Analyzing trace with hash -833955217, now seen corresponding path program 20 times [2018-10-10 16:26:04,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21626 backedges. 0 proven. 20922 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2018-10-10 16:26:10,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:10,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:26:10,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:26:10,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:26:10,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1863, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:26:10,201 INFO L87 Difference]: Start difference. First operand 1199 states and 1216 transitions. Second operand 48 states. [2018-10-10 16:26:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:29,576 INFO L93 Difference]: Finished difference Result 1454 states and 1475 transitions. [2018-10-10 16:26:29,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-10 16:26:29,579 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1198 [2018-10-10 16:26:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:29,584 INFO L225 Difference]: With dead ends: 1454 [2018-10-10 16:26:29,584 INFO L226 Difference]: Without dead ends: 1454 [2018-10-10 16:26:29,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24439 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=11054, Invalid=53208, Unknown=0, NotChecked=0, Total=64262 [2018-10-10 16:26:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2018-10-10 16:26:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1270. [2018-10-10 16:26:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-10-10 16:26:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1288 transitions. [2018-10-10 16:26:29,600 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1288 transitions. Word has length 1198 [2018-10-10 16:26:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:29,601 INFO L481 AbstractCegarLoop]: Abstraction has 1270 states and 1288 transitions. [2018-10-10 16:26:29,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:26:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1288 transitions. [2018-10-10 16:26:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1270 [2018-10-10 16:26:29,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:29,615 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:29,616 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:29,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:29,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1985054838, now seen corresponding path program 21 times [2018-10-10 16:26:29,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24396 backedges. 0 proven. 23644 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-10-10 16:26:35,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:35,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:26:35,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:26:35,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:26:35,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=2018, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:26:35,304 INFO L87 Difference]: Start difference. First operand 1270 states and 1288 transitions. Second operand 50 states. [2018-10-10 16:26:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:56,973 INFO L93 Difference]: Finished difference Result 1525 states and 1547 transitions. [2018-10-10 16:26:56,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-10 16:26:56,973 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1269 [2018-10-10 16:26:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:56,978 INFO L225 Difference]: With dead ends: 1525 [2018-10-10 16:26:56,978 INFO L226 Difference]: Without dead ends: 1525 [2018-10-10 16:26:56,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27216 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=12194, Invalid=58828, Unknown=0, NotChecked=0, Total=71022 [2018-10-10 16:26:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-10-10 16:26:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1341. [2018-10-10 16:26:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-10 16:26:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1360 transitions. [2018-10-10 16:26:56,994 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1360 transitions. Word has length 1269 [2018-10-10 16:26:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:56,995 INFO L481 AbstractCegarLoop]: Abstraction has 1341 states and 1360 transitions. [2018-10-10 16:26:56,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:26:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1360 transitions. [2018-10-10 16:26:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1341 [2018-10-10 16:26:57,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:57,010 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:57,010 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:57,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:57,011 INFO L82 PathProgramCache]: Analyzing trace with hash -273068529, now seen corresponding path program 22 times [2018-10-10 16:26:57,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 27333 backedges. 0 proven. 26533 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-10-10 16:27:03,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:03,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 16:27:03,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 16:27:03,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 16:27:03,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=2179, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:27:03,711 INFO L87 Difference]: Start difference. First operand 1341 states and 1360 transitions. Second operand 52 states. [2018-10-10 16:27:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:27,246 INFO L93 Difference]: Finished difference Result 1596 states and 1619 transitions. [2018-10-10 16:27:27,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-10-10 16:27:27,247 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1340 [2018-10-10 16:27:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:27,251 INFO L225 Difference]: With dead ends: 1596 [2018-10-10 16:27:27,251 INFO L226 Difference]: Without dead ends: 1596 [2018-10-10 16:27:27,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30143 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=13391, Invalid=64729, Unknown=0, NotChecked=0, Total=78120 [2018-10-10 16:27:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2018-10-10 16:27:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1412. [2018-10-10 16:27:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-10-10 16:27:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1432 transitions. [2018-10-10 16:27:27,265 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1432 transitions. Word has length 1340 [2018-10-10 16:27:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:27,267 INFO L481 AbstractCegarLoop]: Abstraction has 1412 states and 1432 transitions. [2018-10-10 16:27:27,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 16:27:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1432 transitions. [2018-10-10 16:27:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1412 [2018-10-10 16:27:27,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:27,284 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:27,284 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:27,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:27,285 INFO L82 PathProgramCache]: Analyzing trace with hash -26103830, now seen corresponding path program 23 times [2018-10-10 16:27:27,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 30437 backedges. 0 proven. 29589 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2018-10-10 16:27:34,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:34,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 16:27:34,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 16:27:34,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 16:27:34,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2346, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:27:34,133 INFO L87 Difference]: Start difference. First operand 1412 states and 1432 transitions. Second operand 54 states. [2018-10-10 16:27:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:58,420 INFO L93 Difference]: Finished difference Result 1667 states and 1691 transitions. [2018-10-10 16:27:58,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-10-10 16:27:58,420 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1411 [2018-10-10 16:27:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:58,425 INFO L225 Difference]: With dead ends: 1667 [2018-10-10 16:27:58,425 INFO L226 Difference]: Without dead ends: 1667 [2018-10-10 16:27:58,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33220 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=14645, Invalid=70911, Unknown=0, NotChecked=0, Total=85556 [2018-10-10 16:27:58,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-10-10 16:27:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1483. [2018-10-10 16:27:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2018-10-10 16:27:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1504 transitions. [2018-10-10 16:27:58,439 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1504 transitions. Word has length 1411 [2018-10-10 16:27:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:58,440 INFO L481 AbstractCegarLoop]: Abstraction has 1483 states and 1504 transitions. [2018-10-10 16:27:58,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 16:27:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1504 transitions. [2018-10-10 16:27:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2018-10-10 16:27:58,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:58,457 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:58,457 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:58,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:58,458 INFO L82 PathProgramCache]: Analyzing trace with hash -181737041, now seen corresponding path program 24 times [2018-10-10 16:27:58,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 33708 backedges. 0 proven. 32812 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2018-10-10 16:28:05,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:05,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 16:28:05,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 16:28:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 16:28:05,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2519, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 16:28:05,932 INFO L87 Difference]: Start difference. First operand 1483 states and 1504 transitions. Second operand 56 states. [2018-10-10 16:28:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:32,547 INFO L93 Difference]: Finished difference Result 1738 states and 1763 transitions. [2018-10-10 16:28:32,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2018-10-10 16:28:32,547 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1482 [2018-10-10 16:28:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:32,553 INFO L225 Difference]: With dead ends: 1738 [2018-10-10 16:28:32,553 INFO L226 Difference]: Without dead ends: 1738 [2018-10-10 16:28:32,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36447 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=15956, Invalid=77374, Unknown=0, NotChecked=0, Total=93330 [2018-10-10 16:28:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-10-10 16:28:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1554. [2018-10-10 16:28:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2018-10-10 16:28:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1576 transitions. [2018-10-10 16:28:32,572 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1576 transitions. Word has length 1482 [2018-10-10 16:28:32,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:32,573 INFO L481 AbstractCegarLoop]: Abstraction has 1554 states and 1576 transitions. [2018-10-10 16:28:32,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 16:28:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1576 transitions. [2018-10-10 16:28:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1554 [2018-10-10 16:28:32,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:32,589 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:32,589 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:32,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash -636174262, now seen corresponding path program 25 times [2018-10-10 16:28:32,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 37146 backedges. 0 proven. 36202 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2018-10-10 16:28:40,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:40,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 16:28:40,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 16:28:40,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 16:28:40,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2698, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:28:40,940 INFO L87 Difference]: Start difference. First operand 1554 states and 1576 transitions. Second operand 58 states. [2018-10-10 16:29:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:09,133 INFO L93 Difference]: Finished difference Result 1809 states and 1835 transitions. [2018-10-10 16:29:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2018-10-10 16:29:09,133 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1553 [2018-10-10 16:29:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:09,139 INFO L225 Difference]: With dead ends: 1809 [2018-10-10 16:29:09,139 INFO L226 Difference]: Without dead ends: 1809 [2018-10-10 16:29:09,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39824 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=17324, Invalid=84118, Unknown=0, NotChecked=0, Total=101442 [2018-10-10 16:29:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2018-10-10 16:29:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1625. [2018-10-10 16:29:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2018-10-10 16:29:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1648 transitions. [2018-10-10 16:29:09,156 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1648 transitions. Word has length 1553 [2018-10-10 16:29:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:09,156 INFO L481 AbstractCegarLoop]: Abstraction has 1625 states and 1648 transitions. [2018-10-10 16:29:09,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 16:29:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1648 transitions. [2018-10-10 16:29:09,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-10-10 16:29:09,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:09,172 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:09,172 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:09,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:09,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1803136335, now seen corresponding path program 26 times [2018-10-10 16:29:09,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 40751 backedges. 0 proven. 39759 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-10 16:29:17,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:17,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 16:29:17,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 16:29:17,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 16:29:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=2883, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:29:17,966 INFO L87 Difference]: Start difference. First operand 1625 states and 1648 transitions. Second operand 60 states. [2018-10-10 16:29:45,171 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-10-10 16:29:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:48,291 INFO L93 Difference]: Finished difference Result 1880 states and 1907 transitions. [2018-10-10 16:29:48,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 276 states. [2018-10-10 16:29:48,291 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1624 [2018-10-10 16:29:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:48,297 INFO L225 Difference]: With dead ends: 1880 [2018-10-10 16:29:48,297 INFO L226 Difference]: Without dead ends: 1880 [2018-10-10 16:29:48,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43351 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=18749, Invalid=91143, Unknown=0, NotChecked=0, Total=109892 [2018-10-10 16:29:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2018-10-10 16:29:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1696. [2018-10-10 16:29:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2018-10-10 16:29:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 1720 transitions. [2018-10-10 16:29:48,313 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 1720 transitions. Word has length 1624 [2018-10-10 16:29:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:48,314 INFO L481 AbstractCegarLoop]: Abstraction has 1696 states and 1720 transitions. [2018-10-10 16:29:48,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 16:29:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 1720 transitions. [2018-10-10 16:29:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2018-10-10 16:29:48,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:48,332 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:48,332 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:48,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash 377333930, now seen corresponding path program 27 times [2018-10-10 16:29:48,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 44523 backedges. 0 proven. 43483 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2018-10-10 16:29:58,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:58,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 16:29:58,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 16:29:58,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 16:29:58,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=3074, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:29:58,424 INFO L87 Difference]: Start difference. First operand 1696 states and 1720 transitions. Second operand 62 states. [2018-10-10 16:30:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:30,097 INFO L93 Difference]: Finished difference Result 1951 states and 1979 transitions. [2018-10-10 16:30:30,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2018-10-10 16:30:30,098 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1695 [2018-10-10 16:30:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:30,104 INFO L225 Difference]: With dead ends: 1951 [2018-10-10 16:30:30,104 INFO L226 Difference]: Without dead ends: 1951 [2018-10-10 16:30:30,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47028 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=20231, Invalid=98449, Unknown=0, NotChecked=0, Total=118680 [2018-10-10 16:30:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-10-10 16:30:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1767. [2018-10-10 16:30:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-10-10 16:30:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 1792 transitions. [2018-10-10 16:30:30,128 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 1792 transitions. Word has length 1695 [2018-10-10 16:30:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:30,128 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 1792 transitions. [2018-10-10 16:30:30,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 16:30:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 1792 transitions. [2018-10-10 16:30:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2018-10-10 16:30:30,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:30,148 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:30,149 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:30,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1174431505, now seen corresponding path program 28 times [2018-10-10 16:30:30,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 48462 backedges. 0 proven. 47374 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2018-10-10 16:30:40,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:40,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 16:30:40,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 16:30:40,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 16:30:40,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=3271, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:30:40,369 INFO L87 Difference]: Start difference. First operand 1767 states and 1792 transitions. Second operand 64 states. [2018-10-10 16:31:11,133 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-10-10 16:31:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:13,652 INFO L93 Difference]: Finished difference Result 2022 states and 2051 transitions. [2018-10-10 16:31:13,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2018-10-10 16:31:13,652 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1766 [2018-10-10 16:31:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:13,658 INFO L225 Difference]: With dead ends: 2022 [2018-10-10 16:31:13,659 INFO L226 Difference]: Without dead ends: 2022 [2018-10-10 16:31:13,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50855 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=21770, Invalid=106036, Unknown=0, NotChecked=0, Total=127806 [2018-10-10 16:31:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2018-10-10 16:31:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1838. [2018-10-10 16:31:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-10-10 16:31:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1864 transitions. [2018-10-10 16:31:13,675 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1864 transitions. Word has length 1766 [2018-10-10 16:31:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:13,676 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 1864 transitions. [2018-10-10 16:31:13,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 16:31:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1864 transitions. [2018-10-10 16:31:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1838 [2018-10-10 16:31:13,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:13,702 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:13,702 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:13,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash 51538186, now seen corresponding path program 29 times [2018-10-10 16:31:13,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat