java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 22:29:42,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 22:29:42,598 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 22:29:42,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 22:29:42,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 22:29:42,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 22:29:42,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 22:29:42,615 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 22:29:42,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 22:29:42,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 22:29:42,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 22:29:42,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 22:29:42,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 22:29:42,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 22:29:42,622 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 22:29:42,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 22:29:42,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 22:29:42,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 22:29:42,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 22:29:42,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 22:29:42,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 22:29:42,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 22:29:42,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 22:29:42,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 22:29:42,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 22:29:42,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 22:29:42,636 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 22:29:42,637 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 22:29:42,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 22:29:42,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 22:29:42,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 22:29:42,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 22:29:42,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 22:29:42,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 22:29:42,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 22:29:42,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 22:29:42,643 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-12 22:29:42,652 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 22:29:42,652 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 22:29:42,653 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 22:29:42,653 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 22:29:42,653 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 22:29:42,654 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 22:29:42,654 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 22:29:42,654 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 22:29:42,655 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 22:29:42,655 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 22:29:42,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 22:29:42,655 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 22:29:42,655 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 22:29:42,656 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 22:29:42,656 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 22:29:42,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 22:29:42,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 22:29:42,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 22:29:42,734 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 22:29:42,735 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 22:29:42,736 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl [2018-10-12 22:29:42,736 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl' [2018-10-12 22:29:42,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 22:29:42,832 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-12 22:29:42,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 22:29:42,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 22:29:42,833 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 22:29:42,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:42" (1/1) ... [2018-10-12 22:29:42,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:42" (1/1) ... [2018-10-12 22:29:42,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:42" (1/1) ... [2018-10-12 22:29:42,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:42" (1/1) ... [2018-10-12 22:29:42,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:42" (1/1) ... [2018-10-12 22:29:42,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:42" (1/1) ... [2018-10-12 22:29:42,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:42" (1/1) ... [2018-10-12 22:29:42,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 22:29:42,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 22:29:42,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 22:29:42,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 22:29:42,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:42" (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-12 22:29:42,959 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 22:29:42,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 22:29:42,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 22:29:43,701 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 22:29:43,702 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:29:43 BoogieIcfgContainer [2018-10-12 22:29:43,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 22:29:43,702 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-12 22:29:43,703 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-12 22:29:43,704 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-12 22:29:43,708 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:29:43" (1/1) ... [2018-10-12 22:29:43,717 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-12 22:29:43,718 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-12 22:29:43,764 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-12 22:29:43,819 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-12 22:29:43,836 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-12 22:29:43,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-12 22:31:13,553 INFO L315 AbstractInterpreter]: Visited 110 different actions 672 times. Merged at 91 different actions 541 times. Widened at 7 different actions 17 times. Found 19 fixpoints after 9 different actions. Largest state had 0 variables. [2018-10-12 22:31:13,556 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-12 22:31:13,560 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-12 22:31:13,594 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_7|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:31:13,597 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_7|) |v_ULTIMATE.start_read~int_#ptr.offset_5|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:31:13,634 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_4_1_1| |v_ULTIMATE.start_write~int_#ptr.base_12|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-12 22:31:13,642 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_13|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:31:13,643 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_13|) |v_ULTIMATE.start_read~int_#ptr.offset_9|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:31:13,700 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-12 22:31:13,702 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-12 22:31:13,702 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:31:13,703 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:31:13,703 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-12 22:31:13,703 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:13,703 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:31:13,703 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-12 22:31:13,704 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:13,704 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:31:13,704 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:31:13,704 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-12 22:31:13,705 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:13,705 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:31:13,705 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-12 22:31:13,705 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:13,706 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-12 22:31:13,747 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:31:13 BasicIcfg [2018-10-12 22:31:13,747 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-12 22:31:13,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 22:31:13,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 22:31:13,755 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 22:31:13,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:42" (1/3) ... [2018-10-12 22:31:13,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7abb3e and model type ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:31:13, skipping insertion in model container [2018-10-12 22:31:13,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:29:43" (2/3) ... [2018-10-12 22:31:13,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7abb3e and model type ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:31:13, skipping insertion in model container [2018-10-12 22:31:13,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:31:13" (3/3) ... [2018-10-12 22:31:13,759 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-12 22:31:13,769 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 22:31:13,778 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 22:31:13,795 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 22:31:13,816 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 22:31:13,818 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 22:31:13,818 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 22:31:13,818 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 22:31:13,818 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 22:31:13,818 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 22:31:13,818 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 22:31:13,818 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 22:31:13,818 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 22:31:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-10-12 22:31:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-12 22:31:13,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:13,839 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:13,840 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:13,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash 219326866, now seen corresponding path program 1 times [2018-10-12 22:31:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:14,367 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-12 22:31:14,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 22:31:14,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-12 22:31:14,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 22:31:14,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 22:31:14,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-12 22:31:14,389 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 6 states. [2018-10-12 22:31:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:14,804 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-10-12 22:31:14,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 22:31:14,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-10-12 22:31:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:14,819 INFO L225 Difference]: With dead ends: 177 [2018-10-12 22:31:14,819 INFO L226 Difference]: Without dead ends: 177 [2018-10-12 22:31:14,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:31:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-12 22:31:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 126. [2018-10-12 22:31:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-12 22:31:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-10-12 22:31:14,867 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 41 [2018-10-12 22:31:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:14,868 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-10-12 22:31:14,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 22:31:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-10-12 22:31:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-12 22:31:14,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:14,873 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:14,873 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:14,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:14,874 INFO L82 PathProgramCache]: Analyzing trace with hash 269123840, now seen corresponding path program 1 times [2018-10-12 22:31:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 22:31:16,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:16,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 22:31:16,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 22:31:16,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 22:31:16,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-12 22:31:16,135 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 19 states. [2018-10-12 22:31:16,630 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-12 22:31:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:18,523 INFO L93 Difference]: Finished difference Result 246 states and 252 transitions. [2018-10-12 22:31:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-12 22:31:18,524 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 95 [2018-10-12 22:31:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:18,528 INFO L225 Difference]: With dead ends: 246 [2018-10-12 22:31:18,529 INFO L226 Difference]: Without dead ends: 246 [2018-10-12 22:31:18,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=461, Invalid=1891, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 22:31:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-12 22:31:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 130. [2018-10-12 22:31:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-12 22:31:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2018-10-12 22:31:18,544 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 95 [2018-10-12 22:31:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:18,545 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2018-10-12 22:31:18,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 22:31:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2018-10-12 22:31:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-12 22:31:18,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:18,547 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:18,548 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:18,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash -630936978, now seen corresponding path program 1 times [2018-10-12 22:31:18,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:18,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:18,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 22:31:18,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 22:31:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 22:31:18,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:31:18,730 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand 10 states. [2018-10-12 22:31:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:19,581 INFO L93 Difference]: Finished difference Result 320 states and 327 transitions. [2018-10-12 22:31:19,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 22:31:19,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-10-12 22:31:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:19,585 INFO L225 Difference]: With dead ends: 320 [2018-10-12 22:31:19,585 INFO L226 Difference]: Without dead ends: 320 [2018-10-12 22:31:19,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-12 22:31:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-12 22:31:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 218. [2018-10-12 22:31:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-12 22:31:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 223 transitions. [2018-10-12 22:31:19,602 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 223 transitions. Word has length 116 [2018-10-12 22:31:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:19,603 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 223 transitions. [2018-10-12 22:31:19,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 22:31:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-10-12 22:31:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-12 22:31:19,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:19,607 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:19,607 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:19,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:19,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1008595520, now seen corresponding path program 2 times [2018-10-12 22:31:19,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-12 22:31:19,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:19,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 22:31:19,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 22:31:19,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 22:31:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 22:31:19,832 INFO L87 Difference]: Start difference. First operand 218 states and 223 transitions. Second operand 8 states. [2018-10-12 22:31:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:20,045 INFO L93 Difference]: Finished difference Result 269 states and 274 transitions. [2018-10-12 22:31:20,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 22:31:20,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2018-10-12 22:31:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:20,052 INFO L225 Difference]: With dead ends: 269 [2018-10-12 22:31:20,052 INFO L226 Difference]: Without dead ends: 269 [2018-10-12 22:31:20,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-12 22:31:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-12 22:31:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-10-12 22:31:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-12 22:31:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 222 transitions. [2018-10-12 22:31:20,069 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 222 transitions. Word has length 170 [2018-10-12 22:31:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:20,070 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 222 transitions. [2018-10-12 22:31:20,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 22:31:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2018-10-12 22:31:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-12 22:31:20,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:20,074 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:20,074 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:20,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1102948370, now seen corresponding path program 3 times [2018-10-12 22:31:20,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 92 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-12 22:31:20,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:20,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 22:31:20,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 22:31:20,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 22:31:20,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:31:20,311 INFO L87 Difference]: Start difference. First operand 218 states and 222 transitions. Second operand 10 states. [2018-10-12 22:31:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:20,628 INFO L93 Difference]: Finished difference Result 327 states and 334 transitions. [2018-10-12 22:31:20,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 22:31:20,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2018-10-12 22:31:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:20,631 INFO L225 Difference]: With dead ends: 327 [2018-10-12 22:31:20,631 INFO L226 Difference]: Without dead ends: 327 [2018-10-12 22:31:20,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-12 22:31:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-12 22:31:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 227. [2018-10-12 22:31:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-12 22:31:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2018-10-12 22:31:20,641 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 191 [2018-10-12 22:31:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:20,642 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2018-10-12 22:31:20,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 22:31:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2018-10-12 22:31:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-12 22:31:20,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:20,646 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:20,647 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:20,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash 123824574, now seen corresponding path program 1 times [2018-10-12 22:31:20,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 22:31:21,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:21,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 22:31:21,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 22:31:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 22:31:21,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-10-12 22:31:21,907 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 23 states. [2018-10-12 22:31:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:24,988 INFO L93 Difference]: Finished difference Result 552 states and 565 transitions. [2018-10-12 22:31:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-12 22:31:24,989 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 205 [2018-10-12 22:31:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:24,994 INFO L225 Difference]: With dead ends: 552 [2018-10-12 22:31:24,994 INFO L226 Difference]: Without dead ends: 552 [2018-10-12 22:31:24,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=480, Invalid=3060, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 22:31:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-12 22:31:25,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 306. [2018-10-12 22:31:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-12 22:31:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 312 transitions. [2018-10-12 22:31:25,008 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 312 transitions. Word has length 205 [2018-10-12 22:31:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:25,009 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 312 transitions. [2018-10-12 22:31:25,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 22:31:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 312 transitions. [2018-10-12 22:31:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-12 22:31:25,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:25,013 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:25,014 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:25,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash -47233936, now seen corresponding path program 2 times [2018-10-12 22:31:25,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 11 proven. 164 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 22:31:25,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:25,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 22:31:25,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 22:31:25,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 22:31:25,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-12 22:31:25,831 INFO L87 Difference]: Start difference. First operand 306 states and 312 transitions. Second operand 14 states. [2018-10-12 22:31:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:26,806 INFO L93 Difference]: Finished difference Result 430 states and 439 transitions. [2018-10-12 22:31:26,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-12 22:31:26,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 226 [2018-10-12 22:31:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:26,810 INFO L225 Difference]: With dead ends: 430 [2018-10-12 22:31:26,810 INFO L226 Difference]: Without dead ends: 430 [2018-10-12 22:31:26,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 22:31:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-12 22:31:26,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 328. [2018-10-12 22:31:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-12 22:31:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 335 transitions. [2018-10-12 22:31:26,818 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 335 transitions. Word has length 226 [2018-10-12 22:31:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:26,819 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 335 transitions. [2018-10-12 22:31:26,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 22:31:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 335 transitions. [2018-10-12 22:31:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-12 22:31:26,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:26,821 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:26,822 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:26,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:26,822 INFO L82 PathProgramCache]: Analyzing trace with hash 705697168, now seen corresponding path program 3 times [2018-10-12 22:31:26,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 160 proven. 94 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-12 22:31:27,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:27,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 22:31:27,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 22:31:27,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 22:31:27,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:31:27,023 INFO L87 Difference]: Start difference. First operand 328 states and 335 transitions. Second operand 10 states. [2018-10-12 22:31:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:27,271 INFO L93 Difference]: Finished difference Result 344 states and 349 transitions. [2018-10-12 22:31:27,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 22:31:27,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-10-12 22:31:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:27,275 INFO L225 Difference]: With dead ends: 344 [2018-10-12 22:31:27,275 INFO L226 Difference]: Without dead ends: 344 [2018-10-12 22:31:27,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-12 22:31:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-12 22:31:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 328. [2018-10-12 22:31:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-12 22:31:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 333 transitions. [2018-10-12 22:31:27,282 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 333 transitions. Word has length 259 [2018-10-12 22:31:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:27,283 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 333 transitions. [2018-10-12 22:31:27,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 22:31:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 333 transitions. [2018-10-12 22:31:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-12 22:31:27,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:27,285 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:27,285 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:27,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:27,286 INFO L82 PathProgramCache]: Analyzing trace with hash 827963074, now seen corresponding path program 4 times [2018-10-12 22:31:27,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 185 proven. 118 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-12 22:31:28,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:28,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 22:31:28,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 22:31:28,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 22:31:28,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 22:31:28,042 INFO L87 Difference]: Start difference. First operand 328 states and 333 transitions. Second operand 12 states. [2018-10-12 22:31:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:28,378 INFO L93 Difference]: Finished difference Result 346 states and 350 transitions. [2018-10-12 22:31:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-12 22:31:28,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 280 [2018-10-12 22:31:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:28,382 INFO L225 Difference]: With dead ends: 346 [2018-10-12 22:31:28,382 INFO L226 Difference]: Without dead ends: 346 [2018-10-12 22:31:28,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-10-12 22:31:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-12 22:31:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-10-12 22:31:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-12 22:31:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2018-10-12 22:31:28,389 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 280 [2018-10-12 22:31:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:28,389 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2018-10-12 22:31:28,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 22:31:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2018-10-12 22:31:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-12 22:31:28,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:28,392 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:28,392 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:28,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:28,392 INFO L82 PathProgramCache]: Analyzing trace with hash 573384912, now seen corresponding path program 5 times [2018-10-12 22:31:28,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 191 proven. 159 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-12 22:31:28,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:28,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 22:31:28,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 22:31:28,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 22:31:28,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-12 22:31:28,923 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 12 states. [2018-10-12 22:31:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:29,325 INFO L93 Difference]: Finished difference Result 362 states and 366 transitions. [2018-10-12 22:31:29,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 22:31:29,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 301 [2018-10-12 22:31:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:29,328 INFO L225 Difference]: With dead ends: 362 [2018-10-12 22:31:29,328 INFO L226 Difference]: Without dead ends: 362 [2018-10-12 22:31:29,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-10-12 22:31:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-12 22:31:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 347. [2018-10-12 22:31:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-12 22:31:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2018-10-12 22:31:29,336 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 301 [2018-10-12 22:31:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:29,337 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2018-10-12 22:31:29,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 22:31:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2018-10-12 22:31:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-12 22:31:29,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:29,339 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:29,339 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:29,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1602864636, now seen corresponding path program 6 times [2018-10-12 22:31:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 191 proven. 176 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-12 22:31:30,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:30,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 22:31:30,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 22:31:30,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 22:31:30,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-12 22:31:30,672 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 14 states. [2018-10-12 22:31:31,271 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-12 22:31:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:31,767 INFO L93 Difference]: Finished difference Result 364 states and 368 transitions. [2018-10-12 22:31:31,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 22:31:31,768 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 315 [2018-10-12 22:31:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:31,770 INFO L225 Difference]: With dead ends: 364 [2018-10-12 22:31:31,770 INFO L226 Difference]: Without dead ends: 364 [2018-10-12 22:31:31,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-12 22:31:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-12 22:31:31,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2018-10-12 22:31:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-12 22:31:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 365 transitions. [2018-10-12 22:31:31,777 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 365 transitions. Word has length 315 [2018-10-12 22:31:31,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:31,778 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 365 transitions. [2018-10-12 22:31:31,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 22:31:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 365 transitions. [2018-10-12 22:31:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-12 22:31:31,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:31,780 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:31,781 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:31,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash 231073320, now seen corresponding path program 7 times [2018-10-12 22:31:31,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:32,277 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 22:31:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 121 proven. 286 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-12 22:31:33,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:33,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 22:31:33,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 22:31:33,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 22:31:33,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-10-12 22:31:33,116 INFO L87 Difference]: Start difference. First operand 361 states and 365 transitions. Second operand 26 states. [2018-10-12 22:31:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:36,717 INFO L93 Difference]: Finished difference Result 459 states and 465 transitions. [2018-10-12 22:31:36,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 22:31:36,723 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 329 [2018-10-12 22:31:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:36,726 INFO L225 Difference]: With dead ends: 459 [2018-10-12 22:31:36,726 INFO L226 Difference]: Without dead ends: 459 [2018-10-12 22:31:36,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=849, Invalid=3441, Unknown=0, NotChecked=0, Total=4290 [2018-10-12 22:31:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-12 22:31:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 364. [2018-10-12 22:31:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-12 22:31:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 368 transitions. [2018-10-12 22:31:36,735 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 368 transitions. Word has length 329 [2018-10-12 22:31:36,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:36,736 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 368 transitions. [2018-10-12 22:31:36,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 22:31:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 368 transitions. [2018-10-12 22:31:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-12 22:31:36,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:36,739 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:36,739 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:36,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash 386895430, now seen corresponding path program 8 times [2018-10-12 22:31:36,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:37,847 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 22:31:38,082 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 22:31:38,336 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-12 22:31:38,603 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 22:31:38,908 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 22:31:39,257 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-12 22:31:40,299 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-12 22:31:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 2 proven. 485 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-12 22:31:41,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:41,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 22:31:41,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 22:31:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 22:31:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2268, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 22:31:41,843 INFO L87 Difference]: Start difference. First operand 364 states and 368 transitions. Second operand 50 states. [2018-10-12 22:31:43,091 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-10-12 22:31:43,416 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-10-12 22:31:48,760 WARN L178 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-10-12 22:31:50,110 WARN L178 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-10-12 22:31:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:58,701 INFO L93 Difference]: Finished difference Result 587 states and 595 transitions. [2018-10-12 22:31:58,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-12 22:31:58,701 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 350 [2018-10-12 22:31:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:58,706 INFO L225 Difference]: With dead ends: 587 [2018-10-12 22:31:58,706 INFO L226 Difference]: Without dead ends: 587 [2018-10-12 22:31:58,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5558 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=2037, Invalid=16323, Unknown=0, NotChecked=0, Total=18360 [2018-10-12 22:31:58,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-10-12 22:31:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 488. [2018-10-12 22:31:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-12 22:31:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 494 transitions. [2018-10-12 22:31:58,720 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 494 transitions. Word has length 350 [2018-10-12 22:31:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:58,721 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 494 transitions. [2018-10-12 22:31:58,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 22:31:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 494 transitions. [2018-10-12 22:31:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-12 22:31:58,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:58,724 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:58,725 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:58,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:58,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1182192412, now seen corresponding path program 9 times [2018-10-12 22:31:58,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 649 proven. 326 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-12 22:32:00,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:00,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 22:32:00,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 22:32:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 22:32:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 22:32:00,577 INFO L87 Difference]: Start difference. First operand 488 states and 494 transitions. Second operand 16 states. [2018-10-12 22:32:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:01,149 INFO L93 Difference]: Finished difference Result 527 states and 533 transitions. [2018-10-12 22:32:01,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 22:32:01,150 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 474 [2018-10-12 22:32:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:01,154 INFO L225 Difference]: With dead ends: 527 [2018-10-12 22:32:01,154 INFO L226 Difference]: Without dead ends: 527 [2018-10-12 22:32:01,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 22:32:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-12 22:32:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-10-12 22:32:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-12 22:32:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 533 transitions. [2018-10-12 22:32:01,163 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 533 transitions. Word has length 474 [2018-10-12 22:32:01,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:01,164 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 533 transitions. [2018-10-12 22:32:01,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 22:32:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 533 transitions. [2018-10-12 22:32:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-10-12 22:32:01,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:01,167 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:01,167 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:01,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash -399603010, now seen corresponding path program 10 times [2018-10-12 22:32:01,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 765 proven. 80 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-10-12 22:32:01,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:01,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 22:32:01,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 22:32:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 22:32:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-12 22:32:01,807 INFO L87 Difference]: Start difference. First operand 527 states and 533 transitions. Second operand 15 states. [2018-10-12 22:32:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:02,890 INFO L93 Difference]: Finished difference Result 544 states and 550 transitions. [2018-10-12 22:32:02,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-12 22:32:02,891 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 495 [2018-10-12 22:32:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:02,894 INFO L225 Difference]: With dead ends: 544 [2018-10-12 22:32:02,895 INFO L226 Difference]: Without dead ends: 544 [2018-10-12 22:32:02,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 22:32:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-10-12 22:32:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 541. [2018-10-12 22:32:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-10-12 22:32:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 547 transitions. [2018-10-12 22:32:02,906 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 547 transitions. Word has length 495 [2018-10-12 22:32:02,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:02,906 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 547 transitions. [2018-10-12 22:32:02,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 22:32:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 547 transitions. [2018-10-12 22:32:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-12 22:32:02,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:02,910 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:02,910 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:02,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:02,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1632430354, now seen corresponding path program 11 times [2018-10-12 22:32:02,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 553 proven. 635 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-12 22:32:04,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:04,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 22:32:04,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 22:32:04,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 22:32:04,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2018-10-12 22:32:04,496 INFO L87 Difference]: Start difference. First operand 541 states and 547 transitions. Second operand 31 states. [2018-10-12 22:32:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:08,961 INFO L93 Difference]: Finished difference Result 653 states and 661 transitions. [2018-10-12 22:32:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 22:32:08,962 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 509 [2018-10-12 22:32:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:08,966 INFO L225 Difference]: With dead ends: 653 [2018-10-12 22:32:08,966 INFO L226 Difference]: Without dead ends: 653 [2018-10-12 22:32:08,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1067, Invalid=4785, Unknown=0, NotChecked=0, Total=5852 [2018-10-12 22:32:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-10-12 22:32:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 544. [2018-10-12 22:32:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-12 22:32:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 550 transitions. [2018-10-12 22:32:08,976 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 550 transitions. Word has length 509 [2018-10-12 22:32:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:08,976 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 550 transitions. [2018-10-12 22:32:08,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 22:32:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 550 transitions. [2018-10-12 22:32:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-12 22:32:08,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:08,980 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:08,980 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:08,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:08,981 INFO L82 PathProgramCache]: Analyzing trace with hash 261775772, now seen corresponding path program 12 times [2018-10-12 22:32:08,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1466 backedges. 553 proven. 811 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-12 22:32:10,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:10,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-12 22:32:10,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-12 22:32:10,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-12 22:32:10,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 22:32:10,567 INFO L87 Difference]: Start difference. First operand 544 states and 550 transitions. Second operand 33 states. [2018-10-12 22:32:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:16,576 INFO L93 Difference]: Finished difference Result 754 states and 764 transitions. [2018-10-12 22:32:16,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-12 22:32:16,576 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 530 [2018-10-12 22:32:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:16,580 INFO L225 Difference]: With dead ends: 754 [2018-10-12 22:32:16,580 INFO L226 Difference]: Without dead ends: 754 [2018-10-12 22:32:16,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1371, Invalid=6285, Unknown=0, NotChecked=0, Total=7656 [2018-10-12 22:32:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-12 22:32:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 565. [2018-10-12 22:32:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-12 22:32:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 572 transitions. [2018-10-12 22:32:16,590 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 572 transitions. Word has length 530 [2018-10-12 22:32:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:16,591 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 572 transitions. [2018-10-12 22:32:16,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-12 22:32:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 572 transitions. [2018-10-12 22:32:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-10-12 22:32:16,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:16,595 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:16,595 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:16,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1996391250, now seen corresponding path program 13 times [2018-10-12 22:32:16,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 99 proven. 1412 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-12 22:32:17,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:17,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 22:32:17,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 22:32:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 22:32:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-12 22:32:17,524 INFO L87 Difference]: Start difference. First operand 565 states and 572 transitions. Second operand 22 states. [2018-10-12 22:32:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:19,262 INFO L93 Difference]: Finished difference Result 846 states and 856 transitions. [2018-10-12 22:32:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 22:32:19,263 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 551 [2018-10-12 22:32:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:19,267 INFO L225 Difference]: With dead ends: 846 [2018-10-12 22:32:19,268 INFO L226 Difference]: Without dead ends: 846 [2018-10-12 22:32:19,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2287 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1320, Invalid=5652, Unknown=0, NotChecked=0, Total=6972 [2018-10-12 22:32:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-10-12 22:32:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 766. [2018-10-12 22:32:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-10-12 22:32:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 775 transitions. [2018-10-12 22:32:19,279 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 775 transitions. Word has length 551 [2018-10-12 22:32:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:19,279 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 775 transitions. [2018-10-12 22:32:19,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 22:32:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 775 transitions. [2018-10-12 22:32:19,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2018-10-12 22:32:19,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:19,285 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:19,285 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:19,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash -459428346, now seen corresponding path program 14 times [2018-10-12 22:32:19,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 1592 proven. 992 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-10-12 22:32:21,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:21,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 22:32:21,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 22:32:21,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 22:32:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-10-12 22:32:21,904 INFO L87 Difference]: Start difference. First operand 766 states and 775 transitions. Second operand 22 states. [2018-10-12 22:32:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:23,538 INFO L93 Difference]: Finished difference Result 783 states and 792 transitions. [2018-10-12 22:32:23,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-12 22:32:23,539 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 710 [2018-10-12 22:32:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:23,543 INFO L225 Difference]: With dead ends: 783 [2018-10-12 22:32:23,543 INFO L226 Difference]: Without dead ends: 783 [2018-10-12 22:32:23,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=473, Invalid=1977, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 22:32:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-12 22:32:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 780. [2018-10-12 22:32:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-10-12 22:32:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 789 transitions. [2018-10-12 22:32:23,552 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 789 transitions. Word has length 710 [2018-10-12 22:32:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:23,553 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 789 transitions. [2018-10-12 22:32:23,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 22:32:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 789 transitions. [2018-10-12 22:32:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2018-10-12 22:32:23,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:23,559 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:23,559 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:23,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:23,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2028849830, now seen corresponding path program 15 times [2018-10-12 22:32:23,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 1867 proven. 93 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-10-12 22:32:24,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:24,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 22:32:24,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 22:32:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 22:32:24,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-12 22:32:24,787 INFO L87 Difference]: Start difference. First operand 780 states and 789 transitions. Second operand 19 states. [2018-10-12 22:32:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:26,630 INFO L93 Difference]: Finished difference Result 1173 states and 1185 transitions. [2018-10-12 22:32:26,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-12 22:32:26,631 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 724 [2018-10-12 22:32:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:26,636 INFO L225 Difference]: With dead ends: 1173 [2018-10-12 22:32:26,636 INFO L226 Difference]: Without dead ends: 1119 [2018-10-12 22:32:26,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3508 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1659, Invalid=8043, Unknown=0, NotChecked=0, Total=9702 [2018-10-12 22:32:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-12 22:32:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 902. [2018-10-12 22:32:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-12 22:32:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 912 transitions. [2018-10-12 22:32:26,651 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 912 transitions. Word has length 724 [2018-10-12 22:32:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:26,651 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 912 transitions. [2018-10-12 22:32:26,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 22:32:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 912 transitions. [2018-10-12 22:32:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2018-10-12 22:32:26,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:26,658 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:26,658 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:26,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:26,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2105626224, now seen corresponding path program 16 times [2018-10-12 22:32:26,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3357 backedges. 1582 proven. 1484 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-10-12 22:32:28,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:28,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-12 22:32:28,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-12 22:32:28,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-12 22:32:28,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2018-10-12 22:32:28,630 INFO L87 Difference]: Start difference. First operand 902 states and 912 transitions. Second operand 37 states. [2018-10-12 22:32:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:35,252 INFO L93 Difference]: Finished difference Result 1140 states and 1154 transitions. [2018-10-12 22:32:35,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-12 22:32:35,252 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 745 [2018-10-12 22:32:35,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:35,257 INFO L225 Difference]: With dead ends: 1140 [2018-10-12 22:32:35,257 INFO L226 Difference]: Without dead ends: 1140 [2018-10-12 22:32:35,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2319 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1629, Invalid=7877, Unknown=0, NotChecked=0, Total=9506 [2018-10-12 22:32:35,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-10-12 22:32:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 923. [2018-10-12 22:32:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-12 22:32:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 934 transitions. [2018-10-12 22:32:35,269 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 934 transitions. Word has length 745 [2018-10-12 22:32:35,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:35,270 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 934 transitions. [2018-10-12 22:32:35,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-12 22:32:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 934 transitions. [2018-10-12 22:32:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2018-10-12 22:32:35,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:35,277 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:35,277 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:35,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:35,278 INFO L82 PathProgramCache]: Analyzing trace with hash -156797986, now seen corresponding path program 17 times [2018-10-12 22:32:35,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 179 proven. 3111 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-10-12 22:32:37,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:37,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 22:32:37,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 22:32:37,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 22:32:37,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-12 22:32:37,439 INFO L87 Difference]: Start difference. First operand 923 states and 934 transitions. Second operand 26 states. [2018-10-12 22:32:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:39,700 INFO L93 Difference]: Finished difference Result 1232 states and 1246 transitions. [2018-10-12 22:32:39,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-12 22:32:39,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 766 [2018-10-12 22:32:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:39,709 INFO L225 Difference]: With dead ends: 1232 [2018-10-12 22:32:39,709 INFO L226 Difference]: Without dead ends: 1232 [2018-10-12 22:32:39,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2122, Invalid=9868, Unknown=0, NotChecked=0, Total=11990 [2018-10-12 22:32:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2018-10-12 22:32:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1138. [2018-10-12 22:32:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-10-12 22:32:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1151 transitions. [2018-10-12 22:32:39,724 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1151 transitions. Word has length 766 [2018-10-12 22:32:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:39,724 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1151 transitions. [2018-10-12 22:32:39,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 22:32:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1151 transitions. [2018-10-12 22:32:39,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2018-10-12 22:32:39,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:39,733 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:39,734 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:39,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:39,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1659834400, now seen corresponding path program 18 times [2018-10-12 22:32:39,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 4057 proven. 1324 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-10-12 22:32:40,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:40,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 22:32:40,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 22:32:40,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 22:32:40,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-12 22:32:40,739 INFO L87 Difference]: Start difference. First operand 1138 states and 1151 transitions. Second operand 24 states. [2018-10-12 22:32:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:41,996 INFO L93 Difference]: Finished difference Result 1138 states and 1149 transitions. [2018-10-12 22:32:41,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-12 22:32:41,997 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 960 [2018-10-12 22:32:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:42,001 INFO L225 Difference]: With dead ends: 1138 [2018-10-12 22:32:42,001 INFO L226 Difference]: Without dead ends: 1138 [2018-10-12 22:32:42,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 22:32:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2018-10-12 22:32:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2018-10-12 22:32:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-10-12 22:32:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1149 transitions. [2018-10-12 22:32:42,014 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1149 transitions. Word has length 960 [2018-10-12 22:32:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:42,014 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1149 transitions. [2018-10-12 22:32:42,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 22:32:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1149 transitions. [2018-10-12 22:32:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2018-10-12 22:32:42,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:42,024 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:42,024 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:42,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:42,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1898825170, now seen corresponding path program 19 times [2018-10-12 22:32:42,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6478 backedges. 3704 proven. 234 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2018-10-12 22:32:43,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:43,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 22:32:43,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 22:32:43,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 22:32:43,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-12 22:32:43,698 INFO L87 Difference]: Start difference. First operand 1138 states and 1149 transitions. Second operand 23 states. [2018-10-12 22:32:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:45,623 INFO L93 Difference]: Finished difference Result 1184 states and 1195 transitions. [2018-10-12 22:32:45,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 22:32:45,624 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 981 [2018-10-12 22:32:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:45,628 INFO L225 Difference]: With dead ends: 1184 [2018-10-12 22:32:45,629 INFO L226 Difference]: Without dead ends: 1184 [2018-10-12 22:32:45,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=812, Invalid=3744, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 22:32:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-12 22:32:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1152. [2018-10-12 22:32:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-12 22:32:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1163 transitions. [2018-10-12 22:32:45,642 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1163 transitions. Word has length 981 [2018-10-12 22:32:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:45,642 INFO L481 AbstractCegarLoop]: Abstraction has 1152 states and 1163 transitions. [2018-10-12 22:32:45,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 22:32:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1163 transitions. [2018-10-12 22:32:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-10-12 22:32:45,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:45,652 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:45,653 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:45,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:45,653 INFO L82 PathProgramCache]: Analyzing trace with hash 268134782, now seen corresponding path program 20 times [2018-10-12 22:32:45,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 3599 proven. 2459 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-10-12 22:32:48,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:48,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 22:32:48,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 22:32:48,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 22:32:48,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1632, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 22:32:48,606 INFO L87 Difference]: Start difference. First operand 1152 states and 1163 transitions. Second operand 43 states. [2018-10-12 22:32:54,109 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-12 22:32:54,257 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 22:32:54,698 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:32:54,878 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 22:32:55,300 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:32:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:57,831 INFO L93 Difference]: Finished difference Result 1418 states and 1433 transitions. [2018-10-12 22:32:57,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 22:32:57,831 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 995 [2018-10-12 22:32:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:57,836 INFO L225 Difference]: With dead ends: 1418 [2018-10-12 22:32:57,836 INFO L226 Difference]: Without dead ends: 1418 [2018-10-12 22:32:57,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3086 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2278, Invalid=10378, Unknown=0, NotChecked=0, Total=12656 [2018-10-12 22:32:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-10-12 22:32:57,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1173. [2018-10-12 22:32:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-10-12 22:32:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1185 transitions. [2018-10-12 22:32:57,848 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1185 transitions. Word has length 995 [2018-10-12 22:32:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:57,849 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1185 transitions. [2018-10-12 22:32:57,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 22:32:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1185 transitions. [2018-10-12 22:32:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1017 [2018-10-12 22:32:57,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:57,858 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:32:57,859 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:57,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:57,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1754882896, now seen corresponding path program 21 times [2018-10-12 22:32:57,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7110 backedges. 283 proven. 6097 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2018-10-12 22:32:59,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:59,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 22:32:59,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 22:32:59,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 22:32:59,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-12 22:32:59,358 INFO L87 Difference]: Start difference. First operand 1173 states and 1185 transitions. Second operand 30 states. [2018-10-12 22:33:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:02,489 INFO L93 Difference]: Finished difference Result 1531 states and 1546 transitions. [2018-10-12 22:33:02,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-12 22:33:02,490 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1016 [2018-10-12 22:33:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:02,496 INFO L225 Difference]: With dead ends: 1531 [2018-10-12 22:33:02,496 INFO L226 Difference]: Without dead ends: 1531 [2018-10-12 22:33:02,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7074 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3171, Invalid=15735, Unknown=0, NotChecked=0, Total=18906 [2018-10-12 22:33:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2018-10-12 22:33:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1423. [2018-10-12 22:33:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-10-12 22:33:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1437 transitions. [2018-10-12 22:33:02,509 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1437 transitions. Word has length 1016 [2018-10-12 22:33:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:02,509 INFO L481 AbstractCegarLoop]: Abstraction has 1423 states and 1437 transitions. [2018-10-12 22:33:02,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 22:33:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1437 transitions. [2018-10-12 22:33:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1246 [2018-10-12 22:33:02,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:02,522 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:33:02,522 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:02,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:02,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1154959952, now seen corresponding path program 22 times [2018-10-12 22:33:02,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11185 backedges. 7731 proven. 2240 refuted. 0 times theorem prover too weak. 1214 trivial. 0 not checked. [2018-10-12 22:33:04,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:04,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 22:33:04,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 22:33:04,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 22:33:04,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-12 22:33:04,196 INFO L87 Difference]: Start difference. First operand 1423 states and 1437 transitions. Second operand 28 states. [2018-10-12 22:33:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:05,925 INFO L93 Difference]: Finished difference Result 1423 states and 1435 transitions. [2018-10-12 22:33:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 22:33:05,926 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1245 [2018-10-12 22:33:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:05,932 INFO L225 Difference]: With dead ends: 1423 [2018-10-12 22:33:05,932 INFO L226 Difference]: Without dead ends: 1423 [2018-10-12 22:33:05,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=783, Invalid=3249, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 22:33:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2018-10-12 22:33:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1423. [2018-10-12 22:33:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-10-12 22:33:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1435 transitions. [2018-10-12 22:33:05,942 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1435 transitions. Word has length 1245 [2018-10-12 22:33:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:05,943 INFO L481 AbstractCegarLoop]: Abstraction has 1423 states and 1435 transitions. [2018-10-12 22:33:05,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 22:33:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1435 transitions. [2018-10-12 22:33:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-10-12 22:33:05,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:05,955 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:33:05,955 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:05,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:05,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1540158718, now seen corresponding path program 23 times [2018-10-12 22:33:05,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11742 backedges. 6292 proven. 332 refuted. 0 times theorem prover too weak. 5118 trivial. 0 not checked. [2018-10-12 22:33:07,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:07,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-12 22:33:07,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-12 22:33:07,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-12 22:33:07,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-12 22:33:07,566 INFO L87 Difference]: Start difference. First operand 1423 states and 1435 transitions. Second operand 27 states. [2018-10-12 22:33:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:10,279 INFO L93 Difference]: Finished difference Result 1469 states and 1481 transitions. [2018-10-12 22:33:10,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-12 22:33:10,282 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1266 [2018-10-12 22:33:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:10,286 INFO L225 Difference]: With dead ends: 1469 [2018-10-12 22:33:10,286 INFO L226 Difference]: Without dead ends: 1469 [2018-10-12 22:33:10,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1146, Invalid=5334, Unknown=0, NotChecked=0, Total=6480 [2018-10-12 22:33:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-12 22:33:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1437. [2018-10-12 22:33:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2018-10-12 22:33:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1449 transitions. [2018-10-12 22:33:10,297 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1449 transitions. Word has length 1266 [2018-10-12 22:33:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:10,297 INFO L481 AbstractCegarLoop]: Abstraction has 1437 states and 1449 transitions. [2018-10-12 22:33:10,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-12 22:33:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1449 transitions. [2018-10-12 22:33:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-10-12 22:33:10,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:10,307 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:33:10,307 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:10,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:10,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2137788330, now seen corresponding path program 24 times [2018-10-12 22:33:10,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:11,095 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 22:33:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12029 backedges. 7100 proven. 3799 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2018-10-12 22:33:14,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:14,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 22:33:14,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 22:33:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 22:33:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1965, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 22:33:14,637 INFO L87 Difference]: Start difference. First operand 1437 states and 1449 transitions. Second operand 47 states. [2018-10-12 22:33:21,797 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-12 22:33:21,951 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-10-12 22:33:22,415 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-10-12 22:33:22,567 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-12 22:33:23,064 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-10-12 22:33:23,212 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-12 22:33:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:25,662 INFO L93 Difference]: Finished difference Result 1731 states and 1747 transitions. [2018-10-12 22:33:25,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-12 22:33:25,662 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1280 [2018-10-12 22:33:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:25,667 INFO L225 Difference]: With dead ends: 1731 [2018-10-12 22:33:25,668 INFO L226 Difference]: Without dead ends: 1731 [2018-10-12 22:33:25,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3616 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2564, Invalid=12198, Unknown=0, NotChecked=0, Total=14762 [2018-10-12 22:33:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2018-10-12 22:33:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1458. [2018-10-12 22:33:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2018-10-12 22:33:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1471 transitions. [2018-10-12 22:33:25,680 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1471 transitions. Word has length 1280 [2018-10-12 22:33:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:25,681 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 1471 transitions. [2018-10-12 22:33:25,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 22:33:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1471 transitions. [2018-10-12 22:33:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1302 [2018-10-12 22:33:25,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:25,692 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:33:25,692 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:25,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1985170648, now seen corresponding path program 25 times [2018-10-12 22:33:25,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:28,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12607 backedges. 411 proven. 10929 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2018-10-12 22:33:28,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:28,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 22:33:28,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 22:33:28,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 22:33:28,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 22:33:28,471 INFO L87 Difference]: Start difference. First operand 1458 states and 1471 transitions. Second operand 34 states. [2018-10-12 22:33:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:32,820 INFO L93 Difference]: Finished difference Result 1865 states and 1881 transitions. [2018-10-12 22:33:32,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-12 22:33:32,821 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1301 [2018-10-12 22:33:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:32,827 INFO L225 Difference]: With dead ends: 1865 [2018-10-12 22:33:32,827 INFO L226 Difference]: Without dead ends: 1865 [2018-10-12 22:33:32,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11090 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4561, Invalid=23831, Unknown=0, NotChecked=0, Total=28392 [2018-10-12 22:33:32,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2018-10-12 22:33:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1743. [2018-10-12 22:33:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2018-10-12 22:33:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 1758 transitions. [2018-10-12 22:33:32,841 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 1758 transitions. Word has length 1301 [2018-10-12 22:33:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:32,842 INFO L481 AbstractCegarLoop]: Abstraction has 1743 states and 1758 transitions. [2018-10-12 22:33:32,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 22:33:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 1758 transitions. [2018-10-12 22:33:32,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1566 [2018-10-12 22:33:32,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:32,856 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:33:32,856 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:32,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash -638917902, now seen corresponding path program 26 times [2018-10-12 22:33:32,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 18991 backedges. 13521 proven. 3518 refuted. 0 times theorem prover too weak. 1952 trivial. 0 not checked. [2018-10-12 22:33:35,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:35,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 22:33:35,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 22:33:35,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 22:33:35,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-12 22:33:35,615 INFO L87 Difference]: Start difference. First operand 1743 states and 1758 transitions. Second operand 32 states. [2018-10-12 22:33:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:37,359 INFO L93 Difference]: Finished difference Result 1743 states and 1756 transitions. [2018-10-12 22:33:37,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 22:33:37,359 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1565 [2018-10-12 22:33:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:37,366 INFO L225 Difference]: With dead ends: 1743 [2018-10-12 22:33:37,366 INFO L226 Difference]: Without dead ends: 1743 [2018-10-12 22:33:37,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1044, Invalid=4358, Unknown=0, NotChecked=0, Total=5402 [2018-10-12 22:33:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2018-10-12 22:33:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2018-10-12 22:33:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2018-10-12 22:33:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 1756 transitions. [2018-10-12 22:33:37,378 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 1756 transitions. Word has length 1565 [2018-10-12 22:33:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:37,379 INFO L481 AbstractCegarLoop]: Abstraction has 1743 states and 1756 transitions. [2018-10-12 22:33:37,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 22:33:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 1756 transitions. [2018-10-12 22:33:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1587 [2018-10-12 22:33:37,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:37,393 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:33:37,394 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:37,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:37,394 INFO L82 PathProgramCache]: Analyzing trace with hash -971739728, now seen corresponding path program 27 times [2018-10-12 22:33:37,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 19717 backedges. 9893 proven. 444 refuted. 0 times theorem prover too weak. 9380 trivial. 0 not checked. [2018-10-12 22:33:39,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:39,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 22:33:39,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 22:33:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 22:33:39,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-12 22:33:39,110 INFO L87 Difference]: Start difference. First operand 1743 states and 1756 transitions. Second operand 31 states. [2018-10-12 22:33:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:42,534 INFO L93 Difference]: Finished difference Result 1789 states and 1802 transitions. [2018-10-12 22:33:42,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-12 22:33:42,534 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1586 [2018-10-12 22:33:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:42,541 INFO L225 Difference]: With dead ends: 1789 [2018-10-12 22:33:42,542 INFO L226 Difference]: Without dead ends: 1789 [2018-10-12 22:33:42,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=7202, Unknown=0, NotChecked=0, Total=8742 [2018-10-12 22:33:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-10-12 22:33:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1757. [2018-10-12 22:33:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1757 states. [2018-10-12 22:33:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 1770 transitions. [2018-10-12 22:33:42,555 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 1770 transitions. Word has length 1586 [2018-10-12 22:33:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:42,556 INFO L481 AbstractCegarLoop]: Abstraction has 1757 states and 1770 transitions. [2018-10-12 22:33:42,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 22:33:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 1770 transitions. [2018-10-12 22:33:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1601 [2018-10-12 22:33:42,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:42,571 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:33:42,571 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:42,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:42,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1485409756, now seen corresponding path program 28 times [2018-10-12 22:33:42,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 20103 backedges. 12686 proven. 5567 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2018-10-12 22:33:47,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:47,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 22:33:47,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 22:33:47,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 22:33:47,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2304, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 22:33:47,967 INFO L87 Difference]: Start difference. First operand 1757 states and 1770 transitions. Second operand 51 states. [2018-10-12 22:33:55,584 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 22:33:56,043 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:33:56,191 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 22:33:56,627 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:33:56,785 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 22:33:57,233 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:33:57,399 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 22:33:57,864 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:33:58,030 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-12 22:33:58,486 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-10-12 22:34:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:00,773 INFO L93 Difference]: Finished difference Result 2079 states and 2096 transitions. [2018-10-12 22:34:00,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-12 22:34:00,774 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1600 [2018-10-12 22:34:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:00,781 INFO L225 Difference]: With dead ends: 2079 [2018-10-12 22:34:00,781 INFO L226 Difference]: Without dead ends: 2079 [2018-10-12 22:34:00,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4534 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3237, Invalid=14853, Unknown=0, NotChecked=0, Total=18090 [2018-10-12 22:34:00,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2018-10-12 22:34:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1778. [2018-10-12 22:34:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-10-12 22:34:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 1792 transitions. [2018-10-12 22:34:00,799 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 1792 transitions. Word has length 1600 [2018-10-12 22:34:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:00,800 INFO L481 AbstractCegarLoop]: Abstraction has 1778 states and 1792 transitions. [2018-10-12 22:34:00,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 22:34:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 1792 transitions. [2018-10-12 22:34:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2018-10-12 22:34:00,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:00,819 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:00,819 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:00,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:00,820 INFO L82 PathProgramCache]: Analyzing trace with hash 116490002, now seen corresponding path program 29 times [2018-10-12 22:34:00,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20850 backedges. 563 proven. 18271 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-10-12 22:34:03,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:03,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 22:34:03,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 22:34:03,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 22:34:03,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 22:34:03,792 INFO L87 Difference]: Start difference. First operand 1778 states and 1792 transitions. Second operand 38 states. [2018-10-12 22:34:04,742 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-12 22:34:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:09,698 INFO L93 Difference]: Finished difference Result 2234 states and 2251 transitions. [2018-10-12 22:34:09,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-12 22:34:09,699 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1621 [2018-10-12 22:34:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:09,709 INFO L225 Difference]: With dead ends: 2234 [2018-10-12 22:34:09,709 INFO L226 Difference]: Without dead ends: 2234 [2018-10-12 22:34:09,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16593 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6362, Invalid=34644, Unknown=0, NotChecked=0, Total=41006 [2018-10-12 22:34:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2018-10-12 22:34:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2098. [2018-10-12 22:34:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-12 22:34:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2114 transitions. [2018-10-12 22:34:09,730 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2114 transitions. Word has length 1621 [2018-10-12 22:34:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:09,731 INFO L481 AbstractCegarLoop]: Abstraction has 2098 states and 2114 transitions. [2018-10-12 22:34:09,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 22:34:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2114 transitions. [2018-10-12 22:34:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1921 [2018-10-12 22:34:09,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:09,755 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:09,755 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:09,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1769283606, now seen corresponding path program 30 times [2018-10-12 22:34:09,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30291 backedges. 22133 proven. 5221 refuted. 0 times theorem prover too weak. 2937 trivial. 0 not checked. [2018-10-12 22:34:13,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:13,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 22:34:13,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 22:34:13,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 22:34:13,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 22:34:13,340 INFO L87 Difference]: Start difference. First operand 2098 states and 2114 transitions. Second operand 36 states. [2018-10-12 22:34:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:16,233 INFO L93 Difference]: Finished difference Result 2098 states and 2112 transitions. [2018-10-12 22:34:16,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-12 22:34:16,234 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1920 [2018-10-12 22:34:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:16,239 INFO L225 Difference]: With dead ends: 2098 [2018-10-12 22:34:16,239 INFO L226 Difference]: Without dead ends: 2098 [2018-10-12 22:34:16,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1343, Invalid=5629, Unknown=0, NotChecked=0, Total=6972 [2018-10-12 22:34:16,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2018-10-12 22:34:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2098. [2018-10-12 22:34:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-12 22:34:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2112 transitions. [2018-10-12 22:34:16,256 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2112 transitions. Word has length 1920 [2018-10-12 22:34:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:16,257 INFO L481 AbstractCegarLoop]: Abstraction has 2098 states and 2112 transitions. [2018-10-12 22:34:16,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 22:34:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2112 transitions. [2018-10-12 22:34:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1942 [2018-10-12 22:34:16,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:16,280 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:16,280 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:16,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:16,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1499094708, now seen corresponding path program 31 times [2018-10-12 22:34:16,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 31207 backedges. 14675 proven. 570 refuted. 0 times theorem prover too weak. 15962 trivial. 0 not checked. [2018-10-12 22:34:18,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:18,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 22:34:18,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 22:34:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 22:34:18,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 22:34:18,758 INFO L87 Difference]: Start difference. First operand 2098 states and 2112 transitions. Second operand 35 states. [2018-10-12 22:34:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:21,674 INFO L93 Difference]: Finished difference Result 2144 states and 2158 transitions. [2018-10-12 22:34:21,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-12 22:34:21,675 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1941 [2018-10-12 22:34:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:21,679 INFO L225 Difference]: With dead ends: 2144 [2018-10-12 22:34:21,679 INFO L226 Difference]: Without dead ends: 2144 [2018-10-12 22:34:21,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1994, Invalid=9348, Unknown=0, NotChecked=0, Total=11342 [2018-10-12 22:34:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2018-10-12 22:34:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 2112. [2018-10-12 22:34:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2018-10-12 22:34:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2126 transitions. [2018-10-12 22:34:21,692 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2126 transitions. Word has length 1941 [2018-10-12 22:34:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:21,693 INFO L481 AbstractCegarLoop]: Abstraction has 2112 states and 2126 transitions. [2018-10-12 22:34:21,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 22:34:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2126 transitions. [2018-10-12 22:34:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1956 [2018-10-12 22:34:21,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:21,714 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:21,714 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:21,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:21,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1858913312, now seen corresponding path program 32 times [2018-10-12 22:34:21,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 31706 backedges. 21063 proven. 7826 refuted. 0 times theorem prover too weak. 2817 trivial. 0 not checked. [2018-10-12 22:34:29,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:29,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-12 22:34:29,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-12 22:34:29,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-12 22:34:29,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2524, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 22:34:29,453 INFO L87 Difference]: Start difference. First operand 2112 states and 2126 transitions. Second operand 53 states. [2018-10-12 22:34:36,004 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-10-12 22:34:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:41,182 INFO L93 Difference]: Finished difference Result 2462 states and 2480 transitions. [2018-10-12 22:34:41,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-12 22:34:41,183 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1955 [2018-10-12 22:34:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:41,187 INFO L225 Difference]: With dead ends: 2462 [2018-10-12 22:34:41,187 INFO L226 Difference]: Without dead ends: 2462 [2018-10-12 22:34:41,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5011 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2921, Invalid=15985, Unknown=0, NotChecked=0, Total=18906 [2018-10-12 22:34:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2018-10-12 22:34:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2133. [2018-10-12 22:34:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2018-10-12 22:34:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2148 transitions. [2018-10-12 22:34:41,200 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2148 transitions. Word has length 1955 [2018-10-12 22:34:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:41,201 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2148 transitions. [2018-10-12 22:34:41,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-12 22:34:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2148 transitions. [2018-10-12 22:34:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1977 [2018-10-12 22:34:41,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:41,222 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:41,222 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:41,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2037488462, now seen corresponding path program 33 times [2018-10-12 22:34:41,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 32643 backedges. 739 proven. 28892 refuted. 0 times theorem prover too weak. 3012 trivial. 0 not checked. [2018-10-12 22:34:45,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:45,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 22:34:45,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 22:34:45,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 22:34:45,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 22:34:45,132 INFO L87 Difference]: Start difference. First operand 2133 states and 2148 transitions. Second operand 42 states. [2018-10-12 22:34:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:52,126 INFO L93 Difference]: Finished difference Result 2638 states and 2656 transitions. [2018-10-12 22:34:52,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-10-12 22:34:52,126 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1976 [2018-10-12 22:34:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:52,132 INFO L225 Difference]: With dead ends: 2638 [2018-10-12 22:34:52,132 INFO L226 Difference]: Without dead ends: 2638 [2018-10-12 22:34:52,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23915 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8651, Invalid=48709, Unknown=0, NotChecked=0, Total=57360 [2018-10-12 22:34:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2018-10-12 22:34:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2488. [2018-10-12 22:34:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2018-10-12 22:34:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 2505 transitions. [2018-10-12 22:34:52,154 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 2505 transitions. Word has length 1976 [2018-10-12 22:34:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:52,155 INFO L481 AbstractCegarLoop]: Abstraction has 2488 states and 2505 transitions. [2018-10-12 22:34:52,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 22:34:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2505 transitions. [2018-10-12 22:34:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2311 [2018-10-12 22:34:52,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:52,192 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:52,193 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:52,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:52,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1339587456, now seen corresponding path program 34 times [2018-10-12 22:34:52,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 45994 backedges. 34378 proven. 7412 refuted. 0 times theorem prover too weak. 4204 trivial. 0 not checked. [2018-10-12 22:34:56,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:56,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 22:34:56,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 22:34:56,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 22:34:56,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 22:34:56,454 INFO L87 Difference]: Start difference. First operand 2488 states and 2505 transitions. Second operand 40 states. [2018-10-12 22:34:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:59,969 INFO L93 Difference]: Finished difference Result 2488 states and 2503 transitions. [2018-10-12 22:34:59,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 22:34:59,970 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2310 [2018-10-12 22:34:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:59,975 INFO L225 Difference]: With dead ends: 2488 [2018-10-12 22:34:59,976 INFO L226 Difference]: Without dead ends: 2488 [2018-10-12 22:34:59,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1680, Invalid=7062, Unknown=0, NotChecked=0, Total=8742 [2018-10-12 22:34:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2018-10-12 22:34:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2488. [2018-10-12 22:34:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2018-10-12 22:34:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 2503 transitions. [2018-10-12 22:34:59,998 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 2503 transitions. Word has length 2310 [2018-10-12 22:35:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:00,000 INFO L481 AbstractCegarLoop]: Abstraction has 2488 states and 2503 transitions. [2018-10-12 22:35:00,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 22:35:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2503 transitions. [2018-10-12 22:35:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2332 [2018-10-12 22:35:00,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:00,043 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:00,044 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:00,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:00,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2066257298, now seen corresponding path program 35 times [2018-10-12 22:35:00,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 47121 backedges. 20806 proven. 710 refuted. 0 times theorem prover too weak. 25605 trivial. 0 not checked. [2018-10-12 22:35:03,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:03,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 22:35:03,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 22:35:03,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 22:35:03,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 22:35:03,038 INFO L87 Difference]: Start difference. First operand 2488 states and 2503 transitions. Second operand 39 states. [2018-10-12 22:35:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:08,229 INFO L93 Difference]: Finished difference Result 2534 states and 2549 transitions. [2018-10-12 22:35:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-12 22:35:08,229 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 2331 [2018-10-12 22:35:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:08,235 INFO L225 Difference]: With dead ends: 2534 [2018-10-12 22:35:08,235 INFO L226 Difference]: Without dead ends: 2534 [2018-10-12 22:35:08,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3754 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2508, Invalid=11772, Unknown=0, NotChecked=0, Total=14280 [2018-10-12 22:35:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2018-10-12 22:35:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2502. [2018-10-12 22:35:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2502 states. [2018-10-12 22:35:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 2517 transitions. [2018-10-12 22:35:08,255 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 2517 transitions. Word has length 2331 [2018-10-12 22:35:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:08,256 INFO L481 AbstractCegarLoop]: Abstraction has 2502 states and 2517 transitions. [2018-10-12 22:35:08,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 22:35:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2517 transitions. [2018-10-12 22:35:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2346 [2018-10-12 22:35:08,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:08,295 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:08,295 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:08,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:08,296 INFO L82 PathProgramCache]: Analyzing trace with hash -519857346, now seen corresponding path program 36 times [2018-10-12 22:35:08,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 47747 backedges. 33042 proven. 10639 refuted. 0 times theorem prover too weak. 4066 trivial. 0 not checked. [2018-10-12 22:35:18,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:18,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 22:35:18,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 22:35:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 22:35:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3201, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 22:35:18,320 INFO L87 Difference]: Start difference. First operand 2502 states and 2517 transitions. Second operand 60 states. [2018-10-12 22:35:28,972 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:35:29,120 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 22:35:29,552 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:35:29,705 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 22:35:30,149 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:35:30,793 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:35:32,067 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 22:35:32,661 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-10-12 22:35:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:35,208 INFO L93 Difference]: Finished difference Result 2880 states and 2899 transitions. [2018-10-12 22:35:35,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-12 22:35:35,208 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2345 [2018-10-12 22:35:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:35,212 INFO L225 Difference]: With dead ends: 2880 [2018-10-12 22:35:35,212 INFO L226 Difference]: Without dead ends: 2880 [2018-10-12 22:35:35,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6381 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=4404, Invalid=20402, Unknown=0, NotChecked=0, Total=24806 [2018-10-12 22:35:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2018-10-12 22:35:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2523. [2018-10-12 22:35:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2018-10-12 22:35:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2539 transitions. [2018-10-12 22:35:35,231 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2539 transitions. Word has length 2345 [2018-10-12 22:35:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:35,232 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 2539 transitions. [2018-10-12 22:35:35,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 22:35:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2539 transitions. [2018-10-12 22:35:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2367 [2018-10-12 22:35:35,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:35,276 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:35,276 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:35,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:35,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1201470736, now seen corresponding path program 37 times [2018-10-12 22:35:35,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 48895 backedges. 939 proven. 43666 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-12 22:35:40,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:40,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 22:35:40,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 22:35:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 22:35:40,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 22:35:40,085 INFO L87 Difference]: Start difference. First operand 2523 states and 2539 transitions. Second operand 46 states. [2018-10-12 22:35:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:48,643 INFO L93 Difference]: Finished difference Result 3077 states and 3096 transitions. [2018-10-12 22:35:48,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2018-10-12 22:35:48,644 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2366 [2018-10-12 22:35:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:48,648 INFO L225 Difference]: With dead ends: 3077 [2018-10-12 22:35:48,648 INFO L226 Difference]: Without dead ends: 3077 [2018-10-12 22:35:48,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33422 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11512, Invalid=66608, Unknown=0, NotChecked=0, Total=78120 [2018-10-12 22:35:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2018-10-12 22:35:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2913. [2018-10-12 22:35:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2018-10-12 22:35:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 2931 transitions. [2018-10-12 22:35:48,666 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 2931 transitions. Word has length 2366 [2018-10-12 22:35:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:48,667 INFO L481 AbstractCegarLoop]: Abstraction has 2913 states and 2931 transitions. [2018-10-12 22:35:48,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 22:35:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 2931 transitions. [2018-10-12 22:35:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2736 [2018-10-12 22:35:48,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:48,709 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:48,709 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:48,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash -435925280, now seen corresponding path program 38 times [2018-10-12 22:35:48,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 67114 backedges. 51172 proven. 10154 refuted. 0 times theorem prover too weak. 5788 trivial. 0 not checked. [2018-10-12 22:35:54,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:54,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 22:35:54,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 22:35:54,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 22:35:54,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1643, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 22:35:54,298 INFO L87 Difference]: Start difference. First operand 2913 states and 2931 transitions. Second operand 44 states. [2018-10-12 22:35:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:58,694 INFO L93 Difference]: Finished difference Result 2913 states and 2929 transitions. [2018-10-12 22:35:58,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-12 22:35:58,694 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2735 [2018-10-12 22:35:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:58,697 INFO L225 Difference]: With dead ends: 2913 [2018-10-12 22:35:58,697 INFO L226 Difference]: Without dead ends: 2913 [2018-10-12 22:35:58,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2384 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2055, Invalid=8657, Unknown=0, NotChecked=0, Total=10712 [2018-10-12 22:35:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2018-10-12 22:35:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2913. [2018-10-12 22:35:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2018-10-12 22:35:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 2929 transitions. [2018-10-12 22:35:58,714 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 2929 transitions. Word has length 2735 [2018-10-12 22:35:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:58,716 INFO L481 AbstractCegarLoop]: Abstraction has 2913 states and 2929 transitions. [2018-10-12 22:35:58,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 22:35:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 2929 transitions. [2018-10-12 22:35:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2757 [2018-10-12 22:35:58,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:58,759 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:58,759 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:58,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash -49264366, now seen corresponding path program 39 times [2018-10-12 22:35:58,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 68473 backedges. 28454 proven. 864 refuted. 0 times theorem prover too weak. 39155 trivial. 0 not checked. [2018-10-12 22:36:02,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:02,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 22:36:02,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 22:36:02,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 22:36:02,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 22:36:02,831 INFO L87 Difference]: Start difference. First operand 2913 states and 2929 transitions. Second operand 43 states. [2018-10-12 22:36:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:08,669 INFO L93 Difference]: Finished difference Result 2959 states and 2975 transitions. [2018-10-12 22:36:08,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-12 22:36:08,670 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2756 [2018-10-12 22:36:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:08,674 INFO L225 Difference]: With dead ends: 2959 [2018-10-12 22:36:08,674 INFO L226 Difference]: Without dead ends: 2959 [2018-10-12 22:36:08,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4672 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3082, Invalid=14474, Unknown=0, NotChecked=0, Total=17556 [2018-10-12 22:36:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2018-10-12 22:36:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2927. [2018-10-12 22:36:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2927 states. [2018-10-12 22:36:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 2943 transitions. [2018-10-12 22:36:08,692 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 2943 transitions. Word has length 2756 [2018-10-12 22:36:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:08,694 INFO L481 AbstractCegarLoop]: Abstraction has 2927 states and 2943 transitions. [2018-10-12 22:36:08,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 22:36:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 2943 transitions. [2018-10-12 22:36:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2771 [2018-10-12 22:36:08,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:08,735 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:08,735 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:08,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1017470874, now seen corresponding path program 40 times [2018-10-12 22:36:08,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 69240 backedges. 49539 proven. 14069 refuted. 0 times theorem prover too weak. 5632 trivial. 0 not checked. [2018-10-12 22:36:22,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:22,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-12 22:36:22,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-12 22:36:22,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-12 22:36:22,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=3662, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 22:36:22,223 INFO L87 Difference]: Start difference. First operand 2927 states and 2943 transitions. Second operand 64 states. [2018-10-12 22:36:33,880 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-10-12 22:36:34,048 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-10-12 22:36:34,712 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-12 22:36:34,885 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-12 22:36:35,403 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-12 22:36:35,569 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-12 22:36:36,059 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-12 22:36:36,232 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-12 22:36:36,719 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-12 22:36:36,902 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-12 22:36:37,406 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-12 22:36:37,594 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-12 22:36:38,116 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-12 22:36:38,308 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-12 22:36:38,847 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-10-12 22:36:39,106 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-12 22:36:39,488 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-10-12 22:36:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:42,020 INFO L93 Difference]: Finished difference Result 3333 states and 3353 transitions. [2018-10-12 22:36:42,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-12 22:36:42,020 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2770 [2018-10-12 22:36:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:42,023 INFO L225 Difference]: With dead ends: 3333 [2018-10-12 22:36:42,023 INFO L226 Difference]: Without dead ends: 3333 [2018-10-12 22:36:42,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7120 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=4810, Invalid=22912, Unknown=0, NotChecked=0, Total=27722 [2018-10-12 22:36:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2018-10-12 22:36:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2948. [2018-10-12 22:36:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2018-10-12 22:36:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 2965 transitions. [2018-10-12 22:36:42,042 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 2965 transitions. Word has length 2770 [2018-10-12 22:36:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:42,043 INFO L481 AbstractCegarLoop]: Abstraction has 2948 states and 2965 transitions. [2018-10-12 22:36:42,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-12 22:36:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 2965 transitions. [2018-10-12 22:36:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2792 [2018-10-12 22:36:42,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:42,082 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:42,082 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:42,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:42,083 INFO L82 PathProgramCache]: Analyzing trace with hash 603342536, now seen corresponding path program 41 times [2018-10-12 22:36:42,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 70620 backedges. 1163 proven. 63572 refuted. 0 times theorem prover too weak. 5885 trivial. 0 not checked. [2018-10-12 22:36:48,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:48,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 22:36:48,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 22:36:48,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 22:36:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2130, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 22:36:48,334 INFO L87 Difference]: Start difference. First operand 2948 states and 2965 transitions. Second operand 50 states. [2018-10-12 22:36:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:58,661 INFO L93 Difference]: Finished difference Result 3551 states and 3571 transitions. [2018-10-12 22:36:58,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2018-10-12 22:36:58,661 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2791 [2018-10-12 22:36:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:58,666 INFO L225 Difference]: With dead ends: 3551 [2018-10-12 22:36:58,666 INFO L226 Difference]: Without dead ends: 3551 [2018-10-12 22:36:58,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45514 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=15036, Invalid=88970, Unknown=0, NotChecked=0, Total=104006 [2018-10-12 22:36:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2018-10-12 22:36:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 3373. [2018-10-12 22:36:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2018-10-12 22:36:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 3392 transitions. [2018-10-12 22:36:58,688 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 3392 transitions. Word has length 2791 [2018-10-12 22:36:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:58,690 INFO L481 AbstractCegarLoop]: Abstraction has 3373 states and 3392 transitions. [2018-10-12 22:36:58,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 22:36:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 3392 transitions. [2018-10-12 22:36:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3196 [2018-10-12 22:36:58,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:58,740 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:58,740 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:58,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:58,740 INFO L82 PathProgramCache]: Analyzing trace with hash -841095662, now seen corresponding path program 42 times [2018-10-12 22:36:58,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:37:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 94770 backedges. 73536 proven. 13510 refuted. 0 times theorem prover too weak. 7724 trivial. 0 not checked. [2018-10-12 22:37:06,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:37:06,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 22:37:06,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 22:37:06,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 22:37:06,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 22:37:06,161 INFO L87 Difference]: Start difference. First operand 3373 states and 3392 transitions. Second operand 48 states. [2018-10-12 22:37:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:37:10,266 INFO L93 Difference]: Finished difference Result 3373 states and 3390 transitions. [2018-10-12 22:37:10,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-12 22:37:10,266 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 3195 [2018-10-12 22:37:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:37:10,271 INFO L225 Difference]: With dead ends: 3373 [2018-10-12 22:37:10,271 INFO L226 Difference]: Without dead ends: 3373 [2018-10-12 22:37:10,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2903 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2468, Invalid=10414, Unknown=0, NotChecked=0, Total=12882 [2018-10-12 22:37:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2018-10-12 22:37:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3373. [2018-10-12 22:37:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2018-10-12 22:37:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 3390 transitions. [2018-10-12 22:37:10,291 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 3390 transitions. Word has length 3195 [2018-10-12 22:37:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:37:10,292 INFO L481 AbstractCegarLoop]: Abstraction has 3373 states and 3390 transitions. [2018-10-12 22:37:10,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 22:37:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 3390 transitions. [2018-10-12 22:37:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3217 [2018-10-12 22:37:10,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:37:10,344 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:37:10,345 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:37:10,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:37:10,345 INFO L82 PathProgramCache]: Analyzing trace with hash -742410768, now seen corresponding path program 43 times [2018-10-12 22:37:10,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:37:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:37:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 96382 backedges. 37787 proven. 1032 refuted. 0 times theorem prover too weak. 57563 trivial. 0 not checked. [2018-10-12 22:37:15,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:37:15,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 22:37:15,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 22:37:15,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 22:37:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 22:37:15,119 INFO L87 Difference]: Start difference. First operand 3373 states and 3390 transitions. Second operand 47 states. [2018-10-12 22:37:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:37:21,165 INFO L93 Difference]: Finished difference Result 3419 states and 3436 transitions. [2018-10-12 22:37:21,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-12 22:37:21,166 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 3216 [2018-10-12 22:37:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:37:21,170 INFO L225 Difference]: With dead ends: 3419 [2018-10-12 22:37:21,170 INFO L226 Difference]: Without dead ends: 3419 [2018-10-12 22:37:21,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3716, Invalid=17454, Unknown=0, NotChecked=0, Total=21170 [2018-10-12 22:37:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2018-10-12 22:37:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3387. [2018-10-12 22:37:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3387 states. [2018-10-12 22:37:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 3404 transitions. [2018-10-12 22:37:21,189 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 3404 transitions. Word has length 3216 [2018-10-12 22:37:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:37:21,191 INFO L481 AbstractCegarLoop]: Abstraction has 3387 states and 3404 transitions. [2018-10-12 22:37:21,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 22:37:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 3404 transitions. [2018-10-12 22:37:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3231 [2018-10-12 22:37:21,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:37:21,244 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:37:21,244 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:37:21,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:37:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1816733668, now seen corresponding path program 44 times [2018-10-12 22:37:21,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:37:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:37:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 97304 backedges. 71575 proven. 18179 refuted. 0 times theorem prover too weak. 7550 trivial. 0 not checked. [2018-10-12 22:37:38,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:37:38,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-12 22:37:38,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-12 22:37:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-12 22:37:38,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=4113, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 22:37:38,691 INFO L87 Difference]: Start difference. First operand 3387 states and 3404 transitions. Second operand 68 states.