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/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:27:12,677 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:27:12,679 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:27:12,691 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:27:12,692 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:27:12,693 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:27:12,694 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:27:12,696 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:27:12,698 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:27:12,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:27:12,700 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:27:12,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:27:12,701 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:27:12,702 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:27:12,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:27:12,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:27:12,706 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:27:12,708 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:27:12,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:27:12,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:27:12,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:27:12,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:27:12,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:27:12,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:27:12,717 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:27:12,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:27:12,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:27:12,720 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:27:12,721 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:27:12,723 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:27:12,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:27:12,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:27:12,724 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:27:12,724 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:27:12,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:27:12,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:27:12,730 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 16:27:12,740 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:27:12,740 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:27:12,741 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:27:12,741 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:27:12,742 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:27:12,742 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:27:12,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:27:12,743 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:27:12,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:27:12,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:27:12,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:27:12,744 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:27:12,744 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:27:12,745 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:27:12,745 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:27:12,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:27:12,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:27:12,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:27:12,813 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:27:12,814 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:27:12,815 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl [2018-10-10 16:27:12,815 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl' [2018-10-10 16:27:12,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:27:12,870 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:27:12,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:27:12,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:27:12,871 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:27:12,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:27:12" (1/1) ... [2018-10-10 16:27:12,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:27:12" (1/1) ... [2018-10-10 16:27:12,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:27:12" (1/1) ... [2018-10-10 16:27:12,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:27:12" (1/1) ... [2018-10-10 16:27:12,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:27:12" (1/1) ... [2018-10-10 16:27:12,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:27:12" (1/1) ... [2018-10-10 16:27:12,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:27:12" (1/1) ... [2018-10-10 16:27:12,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:27:12,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:27:12,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:27:12,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:27:12,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:27:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 16:27:13,002 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:27:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:27:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:27:13,516 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:27:13,517 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:27:13 BoogieIcfgContainer [2018-10-10 16:27:13,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:27:13,518 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:27:13,518 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:27:13,519 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:27:13,523 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:27:13" (1/1) ... [2018-10-10 16:27:13,532 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:27:13,532 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:27:13,573 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:27:13,615 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:27:13,631 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:27:13,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:27:26,792 INFO L315 AbstractInterpreter]: Visited 71 different actions 257 times. Merged at 42 different actions 176 times. Widened at 4 different actions 7 times. Found 7 fixpoints after 3 different actions. Largest state had 0 variables. [2018-10-10 16:27:26,796 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:27:26,802 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:27:26,811 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:27:26,813 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_6|) |v_ULTIMATE.start_read~int_#ptr.offset_4|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:27:26,841 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-10 16:27:26,842 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:27:26,843 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:27:26,843 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:27:26,844 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:27:26,845 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:27:26,845 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:27:26,845 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:27:26,845 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:27:26,846 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:27:26,846 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:27:26,846 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:27:26,846 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:27:26,846 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:27:26,847 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:27:26,848 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:27:26,850 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:27:26,885 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:27:26 BasicIcfg [2018-10-10 16:27:26,885 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:27:26,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:27:26,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:27:26,893 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:27:26,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:27:12" (1/3) ... [2018-10-10 16:27:26,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e57e386 and model type ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:27:26, skipping insertion in model container [2018-10-10 16:27:26,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:27:13" (2/3) ... [2018-10-10 16:27:26,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e57e386 and model type ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:27:26, skipping insertion in model container [2018-10-10 16:27:26,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:27:26" (3/3) ... [2018-10-10 16:27:26,897 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:27:26,908 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:27:26,919 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:27:26,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:27:26,972 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:27:26,973 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:27:26,973 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:27:26,973 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:27:26,975 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:27:26,975 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:27:26,975 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:27:26,975 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:27:26,975 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:27:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-10 16:27:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-10 16:27:27,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:27,005 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] [2018-10-10 16:27:27,006 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:27,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash -68527658, now seen corresponding path program 1 times [2018-10-10 16:27:27,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:27:27,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:27:27,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 16:27:27,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 16:27:27,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 16:27:27,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:27:27,824 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 7 states. [2018-10-10 16:27:28,511 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-10 16:27:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:29,439 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-10 16:27:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 16:27:29,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-10-10 16:27:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:29,520 INFO L225 Difference]: With dead ends: 160 [2018-10-10 16:27:29,520 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 16:27:29,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:27:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 16:27:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 80. [2018-10-10 16:27:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-10 16:27:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-10-10 16:27:29,578 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 39 [2018-10-10 16:27:29,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:29,579 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-10-10 16:27:29,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 16:27:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-10-10 16:27:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-10 16:27:29,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:29,582 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 16:27:29,583 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:29,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:29,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2073640410, now seen corresponding path program 1 times [2018-10-10 16:27:29,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:27:29,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:29,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:27:29,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:27:29,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:27:29,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:27:29,980 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 8 states. [2018-10-10 16:27:30,273 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:27:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:30,530 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-10-10 16:27:30,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:27:30,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-10-10 16:27:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:30,538 INFO L225 Difference]: With dead ends: 114 [2018-10-10 16:27:30,538 INFO L226 Difference]: Without dead ends: 114 [2018-10-10 16:27:30,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:27:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-10 16:27:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2018-10-10 16:27:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-10 16:27:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-10-10 16:27:30,555 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 54 [2018-10-10 16:27:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:30,556 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-10-10 16:27:30,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:27:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-10-10 16:27:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 16:27:30,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:30,562 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:30,562 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:30,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1846344002, now seen corresponding path program 1 times [2018-10-10 16:27:30,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-10 16:27:30,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:30,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 16:27:30,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 16:27:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 16:27:30,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 16:27:30,736 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 5 states. [2018-10-10 16:27:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:31,012 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-10 16:27:31,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 16:27:31,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-10-10 16:27:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:31,015 INFO L225 Difference]: With dead ends: 160 [2018-10-10 16:27:31,015 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 16:27:31,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:27:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 16:27:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2018-10-10 16:27:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 16:27:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-10-10 16:27:31,025 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 94 [2018-10-10 16:27:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:31,026 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-10-10 16:27:31,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 16:27:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-10-10 16:27:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 16:27:31,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:31,036 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:31,036 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:31,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1969117122, now seen corresponding path program 2 times [2018-10-10 16:27:31,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 5 proven. 58 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:27:31,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:31,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:27:31,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:27:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:27:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:27:31,343 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 12 states. [2018-10-10 16:27:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:32,286 INFO L93 Difference]: Finished difference Result 203 states and 208 transitions. [2018-10-10 16:27:32,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:27:32,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-10-10 16:27:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:32,290 INFO L225 Difference]: With dead ends: 203 [2018-10-10 16:27:32,290 INFO L226 Difference]: Without dead ends: 203 [2018-10-10 16:27:32,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:27:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-10 16:27:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 165. [2018-10-10 16:27:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 16:27:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 170 transitions. [2018-10-10 16:27:32,302 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 170 transitions. Word has length 109 [2018-10-10 16:27:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:32,303 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 170 transitions. [2018-10-10 16:27:32,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:27:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 170 transitions. [2018-10-10 16:27:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 16:27:32,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:32,306 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:32,306 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:32,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:32,306 INFO L82 PathProgramCache]: Analyzing trace with hash 403371814, now seen corresponding path program 3 times [2018-10-10 16:27:32,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 71 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-10 16:27:32,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:32,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:27:32,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:27:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:27:32,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:27:32,466 INFO L87 Difference]: Start difference. First operand 165 states and 170 transitions. Second operand 8 states. [2018-10-10 16:27:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:32,667 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2018-10-10 16:27:32,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:27:32,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2018-10-10 16:27:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:32,670 INFO L225 Difference]: With dead ends: 184 [2018-10-10 16:27:32,670 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 16:27:32,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:27:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 16:27:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2018-10-10 16:27:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 16:27:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2018-10-10 16:27:32,684 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 134 [2018-10-10 16:27:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:32,684 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2018-10-10 16:27:32,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:27:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-10-10 16:27:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 16:27:32,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:32,687 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:32,688 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:32,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:32,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1440356518, now seen corresponding path program 4 times [2018-10-10 16:27:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 103 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-10 16:27:32,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:32,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:27:32,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:27:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:27:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:27:32,906 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 10 states. [2018-10-10 16:27:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:33,369 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-10-10 16:27:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:27:33,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2018-10-10 16:27:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:33,371 INFO L225 Difference]: With dead ends: 184 [2018-10-10 16:27:33,372 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 16:27:33,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:27:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 16:27:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2018-10-10 16:27:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 16:27:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-10-10 16:27:33,380 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 149 [2018-10-10 16:27:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:33,380 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-10-10 16:27:33,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:27:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-10-10 16:27:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-10 16:27:33,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:33,384 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:33,384 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:33,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1991493414, now seen corresponding path program 5 times [2018-10-10 16:27:33,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 102 proven. 19 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-10 16:27:33,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:33,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 16:27:33,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 16:27:33,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 16:27:33,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:27:33,657 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand 7 states. [2018-10-10 16:27:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:33,899 INFO L93 Difference]: Finished difference Result 249 states and 253 transitions. [2018-10-10 16:27:33,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 16:27:33,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2018-10-10 16:27:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:33,904 INFO L225 Difference]: With dead ends: 249 [2018-10-10 16:27:33,904 INFO L226 Difference]: Without dead ends: 249 [2018-10-10 16:27:33,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:27:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-10 16:27:33,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 180. [2018-10-10 16:27:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 16:27:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 184 transitions. [2018-10-10 16:27:33,913 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 184 transitions. Word has length 164 [2018-10-10 16:27:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:33,913 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 184 transitions. [2018-10-10 16:27:33,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 16:27:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 184 transitions. [2018-10-10 16:27:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 16:27:33,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:33,917 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:33,917 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:33,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:33,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1752495402, now seen corresponding path program 6 times [2018-10-10 16:27:33,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 259 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-10 16:27:34,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:34,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 16:27:34,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 16:27:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 16:27:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-10 16:27:34,974 INFO L87 Difference]: Start difference. First operand 180 states and 184 transitions. Second operand 13 states. [2018-10-10 16:27:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:36,382 INFO L93 Difference]: Finished difference Result 323 states and 331 transitions. [2018-10-10 16:27:36,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:27:36,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 179 [2018-10-10 16:27:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:36,389 INFO L225 Difference]: With dead ends: 323 [2018-10-10 16:27:36,389 INFO L226 Difference]: Without dead ends: 323 [2018-10-10 16:27:36,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=465, Invalid=1515, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:27:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-10 16:27:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 219. [2018-10-10 16:27:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 16:27:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 224 transitions. [2018-10-10 16:27:36,397 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 224 transitions. Word has length 179 [2018-10-10 16:27:36,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:36,397 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 224 transitions. [2018-10-10 16:27:36,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 16:27:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 224 transitions. [2018-10-10 16:27:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-10 16:27:36,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:36,401 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:36,401 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:36,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:36,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1087311426, now seen corresponding path program 7 times [2018-10-10 16:27:36,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 225 proven. 4 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-10 16:27:36,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:36,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:27:36,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:27:36,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:27:36,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:27:36,656 INFO L87 Difference]: Start difference. First operand 219 states and 224 transitions. Second operand 10 states. [2018-10-10 16:27:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:36,940 INFO L93 Difference]: Finished difference Result 240 states and 245 transitions. [2018-10-10 16:27:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 16:27:36,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 204 [2018-10-10 16:27:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:36,942 INFO L225 Difference]: With dead ends: 240 [2018-10-10 16:27:36,942 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 16:27:36,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:27:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 16:27:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 220. [2018-10-10 16:27:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-10 16:27:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 224 transitions. [2018-10-10 16:27:36,948 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 224 transitions. Word has length 204 [2018-10-10 16:27:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:36,948 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 224 transitions. [2018-10-10 16:27:36,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:27:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 224 transitions. [2018-10-10 16:27:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-10 16:27:36,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:36,951 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:36,951 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:36,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1771649682, now seen corresponding path program 8 times [2018-10-10 16:27:36,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 260 proven. 126 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-10 16:27:37,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:37,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:27:37,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:27:37,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:27:37,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:27:37,163 INFO L87 Difference]: Start difference. First operand 220 states and 224 transitions. Second operand 12 states. [2018-10-10 16:27:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:37,667 INFO L93 Difference]: Finished difference Result 248 states and 251 transitions. [2018-10-10 16:27:37,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:27:37,667 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 219 [2018-10-10 16:27:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:37,669 INFO L225 Difference]: With dead ends: 248 [2018-10-10 16:27:37,670 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 16:27:37,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:27:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 16:27:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 235. [2018-10-10 16:27:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-10 16:27:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 238 transitions. [2018-10-10 16:27:37,676 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 238 transitions. Word has length 219 [2018-10-10 16:27:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:37,676 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 238 transitions. [2018-10-10 16:27:37,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:27:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 238 transitions. [2018-10-10 16:27:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-10 16:27:37,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:37,678 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:37,678 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:37,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:37,679 INFO L82 PathProgramCache]: Analyzing trace with hash 481893310, now seen corresponding path program 9 times [2018-10-10 16:27:37,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 307 proven. 189 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-10 16:27:38,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:38,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:27:38,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:27:38,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:27:38,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:27:38,096 INFO L87 Difference]: Start difference. First operand 235 states and 238 transitions. Second operand 14 states. [2018-10-10 16:27:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:38,697 INFO L93 Difference]: Finished difference Result 250 states and 252 transitions. [2018-10-10 16:27:38,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:27:38,697 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 234 [2018-10-10 16:27:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:38,699 INFO L225 Difference]: With dead ends: 250 [2018-10-10 16:27:38,700 INFO L226 Difference]: Without dead ends: 250 [2018-10-10 16:27:38,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:27:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-10 16:27:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-10-10 16:27:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-10 16:27:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 252 transitions. [2018-10-10 16:27:38,706 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 252 transitions. Word has length 234 [2018-10-10 16:27:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:38,706 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 252 transitions. [2018-10-10 16:27:38,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:27:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 252 transitions. [2018-10-10 16:27:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-10 16:27:38,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:38,708 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:38,708 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:38,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1715821422, now seen corresponding path program 10 times [2018-10-10 16:27:38,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 29 proven. 576 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-10 16:27:39,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:39,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:27:39,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:27:39,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:27:39,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:27:39,033 INFO L87 Difference]: Start difference. First operand 250 states and 252 transitions. Second operand 15 states. [2018-10-10 16:27:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:39,908 INFO L93 Difference]: Finished difference Result 340 states and 343 transitions. [2018-10-10 16:27:39,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 16:27:39,908 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 249 [2018-10-10 16:27:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:39,910 INFO L225 Difference]: With dead ends: 340 [2018-10-10 16:27:39,911 INFO L226 Difference]: Without dead ends: 340 [2018-10-10 16:27:39,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=693, Invalid=1959, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:27:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-10 16:27:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 320. [2018-10-10 16:27:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-10 16:27:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 323 transitions. [2018-10-10 16:27:39,918 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 323 transitions. Word has length 249 [2018-10-10 16:27:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:39,919 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 323 transitions. [2018-10-10 16:27:39,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:27:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 323 transitions. [2018-10-10 16:27:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-10 16:27:39,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:39,921 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:39,921 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:39,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2071337478, now seen corresponding path program 11 times [2018-10-10 16:27:39,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 439 proven. 51 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2018-10-10 16:27:40,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:40,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 16:27:40,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:27:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:27:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:27:40,673 INFO L87 Difference]: Start difference. First operand 320 states and 323 transitions. Second operand 9 states. [2018-10-10 16:27:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:40,979 INFO L93 Difference]: Finished difference Result 441 states and 447 transitions. [2018-10-10 16:27:40,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:27:40,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 319 [2018-10-10 16:27:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:40,982 INFO L225 Difference]: With dead ends: 441 [2018-10-10 16:27:40,982 INFO L226 Difference]: Without dead ends: 441 [2018-10-10 16:27:40,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:27:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-10-10 16:27:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 335. [2018-10-10 16:27:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-10 16:27:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 339 transitions. [2018-10-10 16:27:40,991 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 339 transitions. Word has length 319 [2018-10-10 16:27:40,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:40,992 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 339 transitions. [2018-10-10 16:27:40,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:27:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 339 transitions. [2018-10-10 16:27:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-10 16:27:40,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:40,995 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:40,995 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:40,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1329372150, now seen corresponding path program 12 times [2018-10-10 16:27:40,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 51 proven. 1273 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-10 16:27:41,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:41,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:27:41,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:27:41,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:27:41,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:27:41,574 INFO L87 Difference]: Start difference. First operand 335 states and 339 transitions. Second operand 23 states. [2018-10-10 16:27:43,703 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:27:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:44,243 INFO L93 Difference]: Finished difference Result 565 states and 573 transitions. [2018-10-10 16:27:44,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 16:27:44,244 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 334 [2018-10-10 16:27:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:44,248 INFO L225 Difference]: With dead ends: 565 [2018-10-10 16:27:44,248 INFO L226 Difference]: Without dead ends: 565 [2018-10-10 16:27:44,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3748 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1805, Invalid=8701, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 16:27:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-10-10 16:27:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 405. [2018-10-10 16:27:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-10 16:27:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 410 transitions. [2018-10-10 16:27:44,260 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 410 transitions. Word has length 334 [2018-10-10 16:27:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:44,261 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 410 transitions. [2018-10-10 16:27:44,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:27:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 410 transitions. [2018-10-10 16:27:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-10 16:27:44,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:44,263 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:44,264 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:44,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:44,264 INFO L82 PathProgramCache]: Analyzing trace with hash -549573538, now seen corresponding path program 13 times [2018-10-10 16:27:44,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1289 proven. 711 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-10-10 16:27:45,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:45,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:27:45,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:27:45,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:27:45,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:27:45,965 INFO L87 Difference]: Start difference. First operand 405 states and 410 transitions. Second operand 20 states. [2018-10-10 16:27:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:47,058 INFO L93 Difference]: Finished difference Result 445 states and 449 transitions. [2018-10-10 16:27:47,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 16:27:47,059 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 404 [2018-10-10 16:27:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:47,062 INFO L225 Difference]: With dead ends: 445 [2018-10-10 16:27:47,062 INFO L226 Difference]: Without dead ends: 445 [2018-10-10 16:27:47,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:27:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-10 16:27:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 420. [2018-10-10 16:27:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-10 16:27:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 424 transitions. [2018-10-10 16:27:47,070 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 424 transitions. Word has length 404 [2018-10-10 16:27:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:47,071 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 424 transitions. [2018-10-10 16:27:47,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:27:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 424 transitions. [2018-10-10 16:27:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-10 16:27:47,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:47,073 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:47,074 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:47,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:47,074 INFO L82 PathProgramCache]: Analyzing trace with hash -50806674, now seen corresponding path program 14 times [2018-10-10 16:27:47,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 1435 proven. 489 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2018-10-10 16:27:48,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:27:48,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:27:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:27:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:27:48,319 INFO L87 Difference]: Start difference. First operand 420 states and 424 transitions. Second operand 18 states. [2018-10-10 16:27:49,176 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 16:27:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:49,513 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2018-10-10 16:27:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 16:27:49,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 419 [2018-10-10 16:27:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:49,516 INFO L225 Difference]: With dead ends: 435 [2018-10-10 16:27:49,517 INFO L226 Difference]: Without dead ends: 435 [2018-10-10 16:27:49,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:27:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-10 16:27:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-10-10 16:27:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-10 16:27:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 439 transitions. [2018-10-10 16:27:49,524 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 439 transitions. Word has length 419 [2018-10-10 16:27:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:49,525 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 439 transitions. [2018-10-10 16:27:49,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:27:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 439 transitions. [2018-10-10 16:27:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-10 16:27:49,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:49,527 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:49,528 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:49,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:49,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1260526222, now seen corresponding path program 15 times [2018-10-10 16:27:49,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2721 backedges. 43 proven. 2373 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-10 16:27:50,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:50,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:27:50,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:27:50,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:27:50,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:27:50,498 INFO L87 Difference]: Start difference. First operand 435 states and 439 transitions. Second operand 19 states. [2018-10-10 16:27:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:52,103 INFO L93 Difference]: Finished difference Result 540 states and 545 transitions. [2018-10-10 16:27:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 16:27:52,104 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 434 [2018-10-10 16:27:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:52,108 INFO L225 Difference]: With dead ends: 540 [2018-10-10 16:27:52,109 INFO L226 Difference]: Without dead ends: 540 [2018-10-10 16:27:52,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1398, Invalid=4302, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 16:27:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-10 16:27:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 520. [2018-10-10 16:27:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-10 16:27:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 525 transitions. [2018-10-10 16:27:52,120 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 525 transitions. Word has length 434 [2018-10-10 16:27:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:52,120 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 525 transitions. [2018-10-10 16:27:52,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:27:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 525 transitions. [2018-10-10 16:27:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-10 16:27:52,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:52,124 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:52,125 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:52,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash 817729750, now seen corresponding path program 16 times [2018-10-10 16:27:52,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4076 backedges. 2406 proven. 1318 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-10 16:27:54,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:54,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:27:54,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:27:54,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:27:54,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:27:54,829 INFO L87 Difference]: Start difference. First operand 520 states and 525 transitions. Second operand 24 states. [2018-10-10 16:27:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:58,406 INFO L93 Difference]: Finished difference Result 577 states and 582 transitions. [2018-10-10 16:27:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:27:58,407 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 519 [2018-10-10 16:27:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:58,411 INFO L225 Difference]: With dead ends: 577 [2018-10-10 16:27:58,412 INFO L226 Difference]: Without dead ends: 577 [2018-10-10 16:27:58,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=480, Invalid=1970, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:27:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-10-10 16:27:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 549. [2018-10-10 16:27:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-10-10 16:27:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 554 transitions. [2018-10-10 16:27:58,420 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 554 transitions. Word has length 519 [2018-10-10 16:27:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:58,421 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 554 transitions. [2018-10-10 16:27:58,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:27:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 554 transitions. [2018-10-10 16:27:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-10 16:27:58,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:58,425 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:58,425 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:58,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:58,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1420090614, now seen corresponding path program 17 times [2018-10-10 16:27:58,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4414 backedges. 0 proven. 3957 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2018-10-10 16:27:58,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:58,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:27:58,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:27:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:27:58,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:27:58,945 INFO L87 Difference]: Start difference. First operand 549 states and 554 transitions. Second operand 21 states. [2018-10-10 16:27:59,591 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 16:27:59,797 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:28:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:01,259 INFO L93 Difference]: Finished difference Result 668 states and 674 transitions. [2018-10-10 16:28:01,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 16:28:01,259 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 534 [2018-10-10 16:28:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:01,262 INFO L225 Difference]: With dead ends: 668 [2018-10-10 16:28:01,262 INFO L226 Difference]: Without dead ends: 668 [2018-10-10 16:28:01,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2937 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1769, Invalid=6421, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 16:28:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-10 16:28:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 649. [2018-10-10 16:28:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-10-10 16:28:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 655 transitions. [2018-10-10 16:28:01,273 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 655 transitions. Word has length 534 [2018-10-10 16:28:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:01,273 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 655 transitions. [2018-10-10 16:28:01,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:28:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 655 transitions. [2018-10-10 16:28:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2018-10-10 16:28:01,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:01,279 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:01,279 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:01,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:01,280 INFO L82 PathProgramCache]: Analyzing trace with hash -252359842, now seen corresponding path program 18 times [2018-10-10 16:28:01,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6517 backedges. 0 proven. 5905 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-10-10 16:28:02,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:02,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:28:02,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:28:02,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:28:02,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:28:02,850 INFO L87 Difference]: Start difference. First operand 649 states and 655 transitions. Second operand 23 states. [2018-10-10 16:28:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:05,188 INFO L93 Difference]: Finished difference Result 768 states and 775 transitions. [2018-10-10 16:28:05,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 16:28:05,188 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 634 [2018-10-10 16:28:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:05,193 INFO L225 Difference]: With dead ends: 768 [2018-10-10 16:28:05,194 INFO L226 Difference]: Without dead ends: 768 [2018-10-10 16:28:05,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3858 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2238, Invalid=8268, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 16:28:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-10-10 16:28:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 749. [2018-10-10 16:28:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-10-10 16:28:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 756 transitions. [2018-10-10 16:28:05,206 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 756 transitions. Word has length 634 [2018-10-10 16:28:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:05,207 INFO L481 AbstractCegarLoop]: Abstraction has 749 states and 756 transitions. [2018-10-10 16:28:05,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:28:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 756 transitions. [2018-10-10 16:28:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2018-10-10 16:28:05,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:05,213 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:05,213 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:05,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash 743269830, now seen corresponding path program 19 times [2018-10-10 16:28:05,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9030 backedges. 0 proven. 8263 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2018-10-10 16:28:05,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:05,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:28:05,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:28:05,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:28:05,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:28:05,942 INFO L87 Difference]: Start difference. First operand 749 states and 756 transitions. Second operand 25 states. [2018-10-10 16:28:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:09,033 INFO L93 Difference]: Finished difference Result 868 states and 876 transitions. [2018-10-10 16:28:09,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-10 16:28:09,034 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 734 [2018-10-10 16:28:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:09,038 INFO L225 Difference]: With dead ends: 868 [2018-10-10 16:28:09,038 INFO L226 Difference]: Without dead ends: 868 [2018-10-10 16:28:09,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4904 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2761, Invalid=10349, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 16:28:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-10-10 16:28:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 849. [2018-10-10 16:28:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-10-10 16:28:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 857 transitions. [2018-10-10 16:28:09,053 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 857 transitions. Word has length 734 [2018-10-10 16:28:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:09,053 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 857 transitions. [2018-10-10 16:28:09,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:28:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 857 transitions. [2018-10-10 16:28:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2018-10-10 16:28:09,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:09,061 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:09,061 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:09,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:09,061 INFO L82 PathProgramCache]: Analyzing trace with hash 770124846, now seen corresponding path program 20 times [2018-10-10 16:28:09,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 11953 backedges. 8207 proven. 2590 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2018-10-10 16:28:10,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:10,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:28:10,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:28:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:28:10,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:28:10,081 INFO L87 Difference]: Start difference. First operand 849 states and 857 transitions. Second operand 30 states. [2018-10-10 16:28:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:11,692 INFO L93 Difference]: Finished difference Result 937 states and 945 transitions. [2018-10-10 16:28:11,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:28:11,695 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 834 [2018-10-10 16:28:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:11,700 INFO L225 Difference]: With dead ends: 937 [2018-10-10 16:28:11,700 INFO L226 Difference]: Without dead ends: 937 [2018-10-10 16:28:11,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=750, Invalid=3156, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:28:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-10-10 16:28:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 894. [2018-10-10 16:28:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-10-10 16:28:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 903 transitions. [2018-10-10 16:28:11,712 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 903 transitions. Word has length 834 [2018-10-10 16:28:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:11,712 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 903 transitions. [2018-10-10 16:28:11,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:28:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 903 transitions. [2018-10-10 16:28:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2018-10-10 16:28:11,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:11,720 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:11,720 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:11,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:11,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1397810594, now seen corresponding path program 21 times [2018-10-10 16:28:11,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13130 backedges. 8523 proven. 3714 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-10-10 16:28:13,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:13,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:28:13,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:28:13,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:28:13,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:28:13,219 INFO L87 Difference]: Start difference. First operand 894 states and 903 transitions. Second operand 34 states. [2018-10-10 16:28:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:15,125 INFO L93 Difference]: Finished difference Result 956 states and 964 transitions. [2018-10-10 16:28:15,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 16:28:15,126 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 864 [2018-10-10 16:28:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:15,131 INFO L225 Difference]: With dead ends: 956 [2018-10-10 16:28:15,131 INFO L226 Difference]: Without dead ends: 956 [2018-10-10 16:28:15,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=976, Invalid=4136, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:28:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-10-10 16:28:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 924. [2018-10-10 16:28:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-10-10 16:28:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 934 transitions. [2018-10-10 16:28:15,142 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 934 transitions. Word has length 864 [2018-10-10 16:28:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:15,143 INFO L481 AbstractCegarLoop]: Abstraction has 924 states and 934 transitions. [2018-10-10 16:28:15,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:28:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 934 transitions. [2018-10-10 16:28:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-10-10 16:28:15,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:15,150 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:15,151 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:15,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1036915310, now seen corresponding path program 22 times [2018-10-10 16:28:15,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13741 backedges. 43 proven. 12530 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2018-10-10 16:28:16,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:16,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:28:16,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:28:16,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:28:16,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:28:16,277 INFO L87 Difference]: Start difference. First operand 924 states and 934 transitions. Second operand 27 states. [2018-10-10 16:28:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:18,962 INFO L93 Difference]: Finished difference Result 1073 states and 1084 transitions. [2018-10-10 16:28:18,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-10 16:28:18,963 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 879 [2018-10-10 16:28:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:18,968 INFO L225 Difference]: With dead ends: 1073 [2018-10-10 16:28:18,968 INFO L226 Difference]: Without dead ends: 1073 [2018-10-10 16:28:18,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5856 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3516, Invalid=11736, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 16:28:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2018-10-10 16:28:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1054. [2018-10-10 16:28:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-10-10 16:28:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1065 transitions. [2018-10-10 16:28:18,982 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1065 transitions. Word has length 879 [2018-10-10 16:28:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:18,983 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 1065 transitions. [2018-10-10 16:28:18,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:28:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1065 transitions. [2018-10-10 16:28:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2018-10-10 16:28:18,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:18,992 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:18,992 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:18,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:18,993 INFO L82 PathProgramCache]: Analyzing trace with hash -69558058, now seen corresponding path program 23 times [2018-10-10 16:28:18,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 17234 refuted. 0 times theorem prover too weak. 1487 trivial. 0 not checked. [2018-10-10 16:28:20,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:20,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:28:20,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:28:20,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:28:20,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:28:20,727 INFO L87 Difference]: Start difference. First operand 1054 states and 1065 transitions. Second operand 29 states. [2018-10-10 16:28:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:24,495 INFO L93 Difference]: Finished difference Result 1203 states and 1215 transitions. [2018-10-10 16:28:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-10 16:28:24,496 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1009 [2018-10-10 16:28:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:24,501 INFO L225 Difference]: With dead ends: 1203 [2018-10-10 16:28:24,501 INFO L226 Difference]: Without dead ends: 1203 [2018-10-10 16:28:24,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7371 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3969, Invalid=15213, Unknown=0, NotChecked=0, Total=19182 [2018-10-10 16:28:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-10-10 16:28:24,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1184. [2018-10-10 16:28:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2018-10-10 16:28:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1196 transitions. [2018-10-10 16:28:24,516 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1196 transitions. Word has length 1009 [2018-10-10 16:28:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:24,517 INFO L481 AbstractCegarLoop]: Abstraction has 1184 states and 1196 transitions. [2018-10-10 16:28:24,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:28:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1196 transitions. [2018-10-10 16:28:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1140 [2018-10-10 16:28:24,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:24,530 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:24,530 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:24,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:24,530 INFO L82 PathProgramCache]: Analyzing trace with hash 827241790, now seen corresponding path program 24 times [2018-10-10 16:28:24,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 24475 backedges. 43 proven. 22620 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2018-10-10 16:28:26,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:26,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:28:26,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:28:26,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:28:26,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:28:26,039 INFO L87 Difference]: Start difference. First operand 1184 states and 1196 transitions. Second operand 31 states. [2018-10-10 16:28:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:29,691 INFO L93 Difference]: Finished difference Result 1333 states and 1346 transitions. [2018-10-10 16:28:29,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-10 16:28:29,691 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1139 [2018-10-10 16:28:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:29,697 INFO L225 Difference]: With dead ends: 1333 [2018-10-10 16:28:29,697 INFO L226 Difference]: Without dead ends: 1333 [2018-10-10 16:28:29,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8564 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4929, Invalid=16827, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 16:28:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2018-10-10 16:28:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1314. [2018-10-10 16:28:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-10-10 16:28:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1327 transitions. [2018-10-10 16:28:29,713 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1327 transitions. Word has length 1139 [2018-10-10 16:28:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:29,714 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1327 transitions. [2018-10-10 16:28:29,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:28:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1327 transitions. [2018-10-10 16:28:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1270 [2018-10-10 16:28:29,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:29,729 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:29,729 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:29,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:29,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1006686118, now seen corresponding path program 25 times [2018-10-10 16:28:29,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31003 backedges. 3656 proven. 98 refuted. 0 times theorem prover too weak. 27249 trivial. 0 not checked. [2018-10-10 16:28:30,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:30,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 16:28:30,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 16:28:30,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 16:28:30,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:28:30,795 INFO L87 Difference]: Start difference. First operand 1314 states and 1327 transitions. Second operand 11 states. [2018-10-10 16:28:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:31,172 INFO L93 Difference]: Finished difference Result 1515 states and 1531 transitions. [2018-10-10 16:28:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 16:28:31,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1269 [2018-10-10 16:28:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:31,178 INFO L225 Difference]: With dead ends: 1515 [2018-10-10 16:28:31,178 INFO L226 Difference]: Without dead ends: 1515 [2018-10-10 16:28:31,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:28:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2018-10-10 16:28:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1314. [2018-10-10 16:28:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-10-10 16:28:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1326 transitions. [2018-10-10 16:28:31,191 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1326 transitions. Word has length 1269 [2018-10-10 16:28:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:31,192 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1326 transitions. [2018-10-10 16:28:31,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 16:28:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1326 transitions. [2018-10-10 16:28:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1285 [2018-10-10 16:28:31,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:31,206 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:31,206 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:31,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1182528086, now seen corresponding path program 26 times [2018-10-10 16:28:31,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 31947 backedges. 4538 proven. 160 refuted. 0 times theorem prover too weak. 27249 trivial. 0 not checked. [2018-10-10 16:28:32,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:32,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 16:28:32,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 16:28:32,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 16:28:32,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-10 16:28:32,234 INFO L87 Difference]: Start difference. First operand 1314 states and 1326 transitions. Second operand 13 states. [2018-10-10 16:28:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:32,888 INFO L93 Difference]: Finished difference Result 1698 states and 1718 transitions. [2018-10-10 16:28:32,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 16:28:32,888 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1284 [2018-10-10 16:28:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:32,893 INFO L225 Difference]: With dead ends: 1698 [2018-10-10 16:28:32,893 INFO L226 Difference]: Without dead ends: 1698 [2018-10-10 16:28:32,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:28:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2018-10-10 16:28:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1314. [2018-10-10 16:28:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-10-10 16:28:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1325 transitions. [2018-10-10 16:28:32,907 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1325 transitions. Word has length 1284 [2018-10-10 16:28:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:32,908 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1325 transitions. [2018-10-10 16:28:32,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 16:28:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1325 transitions. [2018-10-10 16:28:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2018-10-10 16:28:32,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:32,922 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:32,922 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:32,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:32,922 INFO L82 PathProgramCache]: Analyzing trace with hash 174135718, now seen corresponding path program 27 times [2018-10-10 16:28:32,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 32906 backedges. 0 proven. 30729 refuted. 0 times theorem prover too weak. 2177 trivial. 0 not checked. [2018-10-10 16:28:34,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:34,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:28:34,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:28:34,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:28:34,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:28:34,663 INFO L87 Difference]: Start difference. First operand 1314 states and 1325 transitions. Second operand 35 states. [2018-10-10 16:28:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:41,848 INFO L93 Difference]: Finished difference Result 1463 states and 1475 transitions. [2018-10-10 16:28:41,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-10-10 16:28:41,849 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1299 [2018-10-10 16:28:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:41,856 INFO L225 Difference]: With dead ends: 1463 [2018-10-10 16:28:41,856 INFO L226 Difference]: Without dead ends: 1463 [2018-10-10 16:28:41,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19023 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8262, Invalid=36894, Unknown=0, NotChecked=0, Total=45156 [2018-10-10 16:28:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2018-10-10 16:28:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1444. [2018-10-10 16:28:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2018-10-10 16:28:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1456 transitions. [2018-10-10 16:28:41,870 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1456 transitions. Word has length 1299 [2018-10-10 16:28:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:41,871 INFO L481 AbstractCegarLoop]: Abstraction has 1444 states and 1456 transitions. [2018-10-10 16:28:41,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:28:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1456 transitions. [2018-10-10 16:28:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1430 [2018-10-10 16:28:41,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:41,887 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:41,888 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:41,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2042696718, now seen corresponding path program 28 times [2018-10-10 16:28:41,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 40420 backedges. 0 proven. 37921 refuted. 0 times theorem prover too weak. 2499 trivial. 0 not checked. [2018-10-10 16:28:44,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:44,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:28:44,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:28:44,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:28:44,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:28:44,049 INFO L87 Difference]: Start difference. First operand 1444 states and 1456 transitions. Second operand 37 states. [2018-10-10 16:28:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:52,435 INFO L93 Difference]: Finished difference Result 1593 states and 1606 transitions. [2018-10-10 16:28:52,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-10 16:28:52,441 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1429 [2018-10-10 16:28:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:52,447 INFO L225 Difference]: With dead ends: 1593 [2018-10-10 16:28:52,447 INFO L226 Difference]: Without dead ends: 1593 [2018-10-10 16:28:52,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22196 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=9523, Invalid=42689, Unknown=0, NotChecked=0, Total=52212 [2018-10-10 16:28:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2018-10-10 16:28:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1574. [2018-10-10 16:28:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2018-10-10 16:28:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 1587 transitions. [2018-10-10 16:28:52,462 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 1587 transitions. Word has length 1429 [2018-10-10 16:28:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:52,463 INFO L481 AbstractCegarLoop]: Abstraction has 1574 states and 1587 transitions. [2018-10-10 16:28:52,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:28:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1587 transitions. [2018-10-10 16:28:52,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1560 [2018-10-10 16:28:52,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:52,483 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:52,484 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:52,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1721603190, now seen corresponding path program 29 times [2018-10-10 16:28:52,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 48708 backedges. 15506 proven. 973 refuted. 0 times theorem prover too weak. 32229 trivial. 0 not checked. [2018-10-10 16:28:54,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:54,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:28:54,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:28:54,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:28:54,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:28:54,724 INFO L87 Difference]: Start difference. First operand 1574 states and 1587 transitions. Second operand 22 states. [2018-10-10 16:28:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:55,906 INFO L93 Difference]: Finished difference Result 1589 states and 1602 transitions. [2018-10-10 16:28:55,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 16:28:55,907 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1559 [2018-10-10 16:28:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:55,913 INFO L225 Difference]: With dead ends: 1589 [2018-10-10 16:28:55,913 INFO L226 Difference]: Without dead ends: 1589 [2018-10-10 16:28:55,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=477, Invalid=1973, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:28:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2018-10-10 16:28:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2018-10-10 16:28:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2018-10-10 16:28:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1602 transitions. [2018-10-10 16:28:55,925 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1602 transitions. Word has length 1559 [2018-10-10 16:28:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:55,925 INFO L481 AbstractCegarLoop]: Abstraction has 1589 states and 1602 transitions. [2018-10-10 16:28:55,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:28:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1602 transitions. [2018-10-10 16:28:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1575 [2018-10-10 16:28:55,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:55,946 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:55,946 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:55,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:55,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1787113274, now seen corresponding path program 30 times [2018-10-10 16:28:55,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 49894 backedges. 38336 proven. 8855 refuted. 0 times theorem prover too weak. 2703 trivial. 0 not checked. [2018-10-10 16:28:58,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:58,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:28:58,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:28:58,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:28:58,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1786, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:28:58,539 INFO L87 Difference]: Start difference. First operand 1589 states and 1602 transitions. Second operand 46 states. [2018-10-10 16:29:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:02,281 INFO L93 Difference]: Finished difference Result 1649 states and 1662 transitions. [2018-10-10 16:29:02,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 16:29:02,281 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1574 [2018-10-10 16:29:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:02,288 INFO L225 Difference]: With dead ends: 1649 [2018-10-10 16:29:02,288 INFO L226 Difference]: Without dead ends: 1649 [2018-10-10 16:29:02,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1784, Invalid=7528, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 16:29:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2018-10-10 16:29:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1619. [2018-10-10 16:29:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1619 states. [2018-10-10 16:29:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 1633 transitions. [2018-10-10 16:29:02,304 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 1633 transitions. Word has length 1574 [2018-10-10 16:29:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:02,305 INFO L481 AbstractCegarLoop]: Abstraction has 1619 states and 1633 transitions. [2018-10-10 16:29:02,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:29:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 1633 transitions. [2018-10-10 16:29:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1590 [2018-10-10 16:29:02,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:02,323 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:02,323 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:02,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1986481402, now seen corresponding path program 31 times [2018-10-10 16:29:02,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 51095 backedges. 21044 proven. 1686 refuted. 0 times theorem prover too weak. 28365 trivial. 0 not checked. [2018-10-10 16:29:04,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:04,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:29:04,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:29:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:29:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:29:04,356 INFO L87 Difference]: Start difference. First operand 1619 states and 1633 transitions. Second operand 26 states. [2018-10-10 16:29:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:05,546 INFO L93 Difference]: Finished difference Result 1649 states and 1663 transitions. [2018-10-10 16:29:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:29:05,546 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1589 [2018-10-10 16:29:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:05,551 INFO L225 Difference]: With dead ends: 1649 [2018-10-10 16:29:05,551 INFO L226 Difference]: Without dead ends: 1649 [2018-10-10 16:29:05,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=682, Invalid=2858, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:29:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2018-10-10 16:29:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2018-10-10 16:29:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2018-10-10 16:29:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 1663 transitions. [2018-10-10 16:29:05,564 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 1663 transitions. Word has length 1589 [2018-10-10 16:29:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:05,565 INFO L481 AbstractCegarLoop]: Abstraction has 1649 states and 1663 transitions. [2018-10-10 16:29:05,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:29:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1663 transitions. [2018-10-10 16:29:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1620 [2018-10-10 16:29:05,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:05,580 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:05,580 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:05,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:05,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1190023478, now seen corresponding path program 32 times [2018-10-10 16:29:05,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 53542 backedges. 30854 proven. 3354 refuted. 0 times theorem prover too weak. 19334 trivial. 0 not checked. [2018-10-10 16:29:07,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:07,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:29:07,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:29:07,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:29:07,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:29:07,786 INFO L87 Difference]: Start difference. First operand 1649 states and 1663 transitions. Second operand 32 states. [2018-10-10 16:29:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:09,946 INFO L93 Difference]: Finished difference Result 1744 states and 1757 transitions. [2018-10-10 16:29:09,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 16:29:09,946 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1619 [2018-10-10 16:29:09,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:09,953 INFO L225 Difference]: With dead ends: 1744 [2018-10-10 16:29:09,953 INFO L226 Difference]: Without dead ends: 1744 [2018-10-10 16:29:09,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=876, Invalid=3680, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:29:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2018-10-10 16:29:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1664. [2018-10-10 16:29:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2018-10-10 16:29:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 1678 transitions. [2018-10-10 16:29:09,969 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 1678 transitions. Word has length 1619 [2018-10-10 16:29:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:09,969 INFO L481 AbstractCegarLoop]: Abstraction has 1664 states and 1678 transitions. [2018-10-10 16:29:09,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:29:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 1678 transitions. [2018-10-10 16:29:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1635 [2018-10-10 16:29:09,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:09,985 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:09,985 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:09,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:09,986 INFO L82 PathProgramCache]: Analyzing trace with hash 190974390, now seen corresponding path program 33 times [2018-10-10 16:29:09,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 54788 backedges. 41981 proven. 7433 refuted. 0 times theorem prover too weak. 5374 trivial. 0 not checked. [2018-10-10 16:29:12,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:12,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:29:12,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:29:12,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:29:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:29:12,529 INFO L87 Difference]: Start difference. First operand 1664 states and 1678 transitions. Second operand 42 states. [2018-10-10 16:29:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:15,915 INFO L93 Difference]: Finished difference Result 1750 states and 1763 transitions. [2018-10-10 16:29:15,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 16:29:15,915 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1634 [2018-10-10 16:29:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:15,922 INFO L225 Difference]: With dead ends: 1750 [2018-10-10 16:29:15,922 INFO L226 Difference]: Without dead ends: 1750 [2018-10-10 16:29:15,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1488, Invalid=6344, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 16:29:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2018-10-10 16:29:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1694. [2018-10-10 16:29:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2018-10-10 16:29:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 1708 transitions. [2018-10-10 16:29:15,934 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 1708 transitions. Word has length 1634 [2018-10-10 16:29:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:15,935 INFO L481 AbstractCegarLoop]: Abstraction has 1694 states and 1708 transitions. [2018-10-10 16:29:15,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:29:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 1708 transitions. [2018-10-10 16:29:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1665 [2018-10-10 16:29:15,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:15,951 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:15,951 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:15,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1510197638, now seen corresponding path program 34 times [2018-10-10 16:29:15,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 57325 backedges. 43257 proven. 8375 refuted. 0 times theorem prover too weak. 5693 trivial. 0 not checked. [2018-10-10 16:29:18,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:18,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:29:18,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:29:18,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:29:18,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:29:18,570 INFO L87 Difference]: Start difference. First operand 1694 states and 1708 transitions. Second operand 44 states. [2018-10-10 16:29:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:22,217 INFO L93 Difference]: Finished difference Result 1812 states and 1825 transitions. [2018-10-10 16:29:22,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 16:29:22,218 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1664 [2018-10-10 16:29:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:22,225 INFO L225 Difference]: With dead ends: 1812 [2018-10-10 16:29:22,225 INFO L226 Difference]: Without dead ends: 1812 [2018-10-10 16:29:22,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1654, Invalid=7088, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 16:29:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2018-10-10 16:29:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1754. [2018-10-10 16:29:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2018-10-10 16:29:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 1769 transitions. [2018-10-10 16:29:22,240 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 1769 transitions. Word has length 1664 [2018-10-10 16:29:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:22,241 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 1769 transitions. [2018-10-10 16:29:22,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:29:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 1769 transitions. [2018-10-10 16:29:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1710 [2018-10-10 16:29:22,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:22,259 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:22,259 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:22,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash 816383510, now seen corresponding path program 35 times [2018-10-10 16:29:22,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 61243 backedges. 29325 proven. 2673 refuted. 0 times theorem prover too weak. 29245 trivial. 0 not checked. [2018-10-10 16:29:24,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:24,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:29:24,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:29:24,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:29:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:29:24,256 INFO L87 Difference]: Start difference. First operand 1754 states and 1769 transitions. Second operand 30 states. [2018-10-10 16:29:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:26,290 INFO L93 Difference]: Finished difference Result 1769 states and 1784 transitions. [2018-10-10 16:29:26,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 16:29:26,291 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1709 [2018-10-10 16:29:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:26,298 INFO L225 Difference]: With dead ends: 1769 [2018-10-10 16:29:26,298 INFO L226 Difference]: Without dead ends: 1769 [2018-10-10 16:29:26,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=925, Invalid=3905, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 16:29:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2018-10-10 16:29:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2018-10-10 16:29:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769 states. [2018-10-10 16:29:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 1784 transitions. [2018-10-10 16:29:26,315 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 1784 transitions. Word has length 1709 [2018-10-10 16:29:26,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:26,316 INFO L481 AbstractCegarLoop]: Abstraction has 1769 states and 1784 transitions. [2018-10-10 16:29:26,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:29:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 1784 transitions. [2018-10-10 16:29:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1725 [2018-10-10 16:29:26,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:26,337 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:26,337 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:26,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1613804646, now seen corresponding path program 36 times [2018-10-10 16:29:26,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 62579 backedges. 35310 proven. 3979 refuted. 0 times theorem prover too weak. 23290 trivial. 0 not checked. [2018-10-10 16:29:28,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:28,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:29:28,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:29:28,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:29:28,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:29:28,731 INFO L87 Difference]: Start difference. First operand 1769 states and 1784 transitions. Second operand 34 states. [2018-10-10 16:29:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:31,499 INFO L93 Difference]: Finished difference Result 1831 states and 1845 transitions. [2018-10-10 16:29:31,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 16:29:31,500 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1724 [2018-10-10 16:29:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:31,508 INFO L225 Difference]: With dead ends: 1831 [2018-10-10 16:29:31,508 INFO L226 Difference]: Without dead ends: 1831 [2018-10-10 16:29:31,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1206, Invalid=5114, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 16:29:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2018-10-10 16:29:31,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2018-10-10 16:29:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2018-10-10 16:29:31,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 1844 transitions. [2018-10-10 16:29:31,525 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 1844 transitions. Word has length 1724 [2018-10-10 16:29:31,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:31,526 INFO L481 AbstractCegarLoop]: Abstraction has 1829 states and 1844 transitions. [2018-10-10 16:29:31,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:29:31,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 1844 transitions. [2018-10-10 16:29:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1785 [2018-10-10 16:29:31,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:31,552 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:31,552 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:31,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1004142790, now seen corresponding path program 37 times [2018-10-10 16:29:31,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 68073 backedges. 71 proven. 63615 refuted. 0 times theorem prover too weak. 4387 trivial. 0 not checked. [2018-10-10 16:29:34,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:34,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:29:34,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:29:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:29:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:29:34,376 INFO L87 Difference]: Start difference. First operand 1829 states and 1844 transitions. Second operand 37 states. [2018-10-10 16:29:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:39,172 INFO L93 Difference]: Finished difference Result 2008 states and 2024 transitions. [2018-10-10 16:29:39,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-10 16:29:39,172 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1784 [2018-10-10 16:29:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:39,178 INFO L225 Difference]: With dead ends: 2008 [2018-10-10 16:29:39,178 INFO L226 Difference]: Without dead ends: 2008 [2018-10-10 16:29:39,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13586 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7491, Invalid=26181, Unknown=0, NotChecked=0, Total=33672 [2018-10-10 16:29:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2018-10-10 16:29:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1989. [2018-10-10 16:29:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-10-10 16:29:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2005 transitions. [2018-10-10 16:29:39,192 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2005 transitions. Word has length 1784 [2018-10-10 16:29:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:39,193 INFO L481 AbstractCegarLoop]: Abstraction has 1989 states and 2005 transitions. [2018-10-10 16:29:39,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:29:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2005 transitions. [2018-10-10 16:29:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1945 [2018-10-10 16:29:39,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:39,215 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:39,215 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:39,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:39,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1755593426, now seen corresponding path program 38 times [2018-10-10 16:29:39,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 81774 backedges. 49045 proven. 5649 refuted. 0 times theorem prover too weak. 27080 trivial. 0 not checked. [2018-10-10 16:29:41,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:29:41,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:29:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:29:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:29:41,968 INFO L87 Difference]: Start difference. First operand 1989 states and 2005 transitions. Second operand 38 states. [2018-10-10 16:29:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:45,348 INFO L93 Difference]: Finished difference Result 2038 states and 2052 transitions. [2018-10-10 16:29:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 16:29:45,349 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1944 [2018-10-10 16:29:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:45,353 INFO L225 Difference]: With dead ends: 2038 [2018-10-10 16:29:45,353 INFO L226 Difference]: Without dead ends: 2038 [2018-10-10 16:29:45,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1754 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1525, Invalid=6485, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 16:29:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2018-10-10 16:29:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2034. [2018-10-10 16:29:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2018-10-10 16:29:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2050 transitions. [2018-10-10 16:29:45,367 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2050 transitions. Word has length 1944 [2018-10-10 16:29:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:45,367 INFO L481 AbstractCegarLoop]: Abstraction has 2034 states and 2050 transitions. [2018-10-10 16:29:45,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:29:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2050 transitions. [2018-10-10 16:29:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1990 [2018-10-10 16:29:45,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:45,390 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:45,390 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:45,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:45,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1104763566, now seen corresponding path program 39 times [2018-10-10 16:29:45,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 86460 backedges. 0 proven. 81166 refuted. 0 times theorem prover too weak. 5294 trivial. 0 not checked. [2018-10-10 16:29:48,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:48,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:29:48,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:29:48,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:29:48,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:29:48,446 INFO L87 Difference]: Start difference. First operand 2034 states and 2050 transitions. Second operand 39 states. [2018-10-10 16:29:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:54,421 INFO L93 Difference]: Finished difference Result 2213 states and 2230 transitions. [2018-10-10 16:29:54,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-10 16:29:54,422 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1989 [2018-10-10 16:29:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:54,425 INFO L225 Difference]: With dead ends: 2213 [2018-10-10 16:29:54,425 INFO L226 Difference]: Without dead ends: 2213 [2018-10-10 16:29:54,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15726 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7934, Invalid=31468, Unknown=0, NotChecked=0, Total=39402 [2018-10-10 16:29:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2018-10-10 16:29:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2194. [2018-10-10 16:29:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2018-10-10 16:29:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 2211 transitions. [2018-10-10 16:29:54,444 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 2211 transitions. Word has length 1989 [2018-10-10 16:29:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:54,445 INFO L481 AbstractCegarLoop]: Abstraction has 2194 states and 2211 transitions. [2018-10-10 16:29:54,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:29:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2211 transitions. [2018-10-10 16:29:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2150 [2018-10-10 16:29:54,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:54,484 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:54,484 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:54,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:54,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2108882710, now seen corresponding path program 40 times [2018-10-10 16:29:54,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 101827 backedges. 0 proven. 95984 refuted. 0 times theorem prover too weak. 5843 trivial. 0 not checked. [2018-10-10 16:29:58,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:58,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 16:29:58,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 16:29:58,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 16:29:58,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:29:58,120 INFO L87 Difference]: Start difference. First operand 2194 states and 2211 transitions. Second operand 41 states. [2018-10-10 16:30:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:04,867 INFO L93 Difference]: Finished difference Result 2373 states and 2391 transitions. [2018-10-10 16:30:04,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-10 16:30:04,868 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 2149 [2018-10-10 16:30:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:04,873 INFO L225 Difference]: With dead ends: 2373 [2018-10-10 16:30:04,873 INFO L226 Difference]: Without dead ends: 2373 [2018-10-10 16:30:04,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17772 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8889, Invalid=35421, Unknown=0, NotChecked=0, Total=44310 [2018-10-10 16:30:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2018-10-10 16:30:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2354. [2018-10-10 16:30:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2354 states. [2018-10-10 16:30:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 2372 transitions. [2018-10-10 16:30:04,893 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 2372 transitions. Word has length 2149 [2018-10-10 16:30:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:04,895 INFO L481 AbstractCegarLoop]: Abstraction has 2354 states and 2372 transitions. [2018-10-10 16:30:04,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 16:30:04,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 2372 transitions. [2018-10-10 16:30:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2310 [2018-10-10 16:30:04,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:04,934 INFO L375 BasicCegarLoop]: trace histogram [124, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:04,934 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:04,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash 183665534, now seen corresponding path program 41 times [2018-10-10 16:30:04,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 118452 backedges. 0 proven. 112121 refuted. 0 times theorem prover too weak. 6331 trivial. 0 not checked. [2018-10-10 16:30:09,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:09,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 16:30:09,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 16:30:09,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 16:30:09,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=1603, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:30:09,149 INFO L87 Difference]: Start difference. First operand 2354 states and 2372 transitions. Second operand 45 states. [2018-10-10 16:30:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:21,900 INFO L93 Difference]: Finished difference Result 2533 states and 2552 transitions. [2018-10-10 16:30:21,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2018-10-10 16:30:21,900 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 2309 [2018-10-10 16:30:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:21,905 INFO L225 Difference]: With dead ends: 2533 [2018-10-10 16:30:21,906 INFO L226 Difference]: Without dead ends: 2533 [2018-10-10 16:30:21,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37338 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=15457, Invalid=70099, Unknown=0, NotChecked=0, Total=85556 [2018-10-10 16:30:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2018-10-10 16:30:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2514. [2018-10-10 16:30:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2018-10-10 16:30:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 2533 transitions. [2018-10-10 16:30:21,927 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 2533 transitions. Word has length 2309 [2018-10-10 16:30:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:21,929 INFO L481 AbstractCegarLoop]: Abstraction has 2514 states and 2533 transitions. [2018-10-10 16:30:21,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 16:30:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 2533 transitions. [2018-10-10 16:30:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2470 [2018-10-10 16:30:21,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:21,972 INFO L375 BasicCegarLoop]: trace histogram [133, 132, 132, 132, 132, 132, 132, 132, 132, 132, 132, 132, 132, 132, 132, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:21,972 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:21,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:21,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1676154906, now seen corresponding path program 42 times [2018-10-10 16:30:21,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 136335 backedges. 111404 proven. 17598 refuted. 0 times theorem prover too weak. 7333 trivial. 0 not checked. [2018-10-10 16:30:27,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:27,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 16:30:27,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 16:30:27,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 16:30:27,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=2663, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 16:30:27,132 INFO L87 Difference]: Start difference. First operand 2514 states and 2533 transitions. Second operand 56 states. [2018-10-10 16:30:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:32,453 INFO L93 Difference]: Finished difference Result 2606 states and 2623 transitions. [2018-10-10 16:30:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 16:30:32,454 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2469 [2018-10-10 16:30:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:32,457 INFO L225 Difference]: With dead ends: 2606 [2018-10-10 16:30:32,457 INFO L226 Difference]: Without dead ends: 2606 [2018-10-10 16:30:32,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3311 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2679, Invalid=11363, Unknown=0, NotChecked=0, Total=14042 [2018-10-10 16:30:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2018-10-10 16:30:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2559. [2018-10-10 16:30:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2559 states. [2018-10-10 16:30:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 2579 transitions. [2018-10-10 16:30:32,475 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 2579 transitions. Word has length 2469 [2018-10-10 16:30:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:32,476 INFO L481 AbstractCegarLoop]: Abstraction has 2559 states and 2579 transitions. [2018-10-10 16:30:32,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 16:30:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 2579 transitions. [2018-10-10 16:30:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2500 [2018-10-10 16:30:32,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:32,532 INFO L375 BasicCegarLoop]: trace histogram [135, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:32,532 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:32,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1684101098, now seen corresponding path program 43 times [2018-10-10 16:30:32,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 140350 backedges. 0 proven. 133137 refuted. 0 times theorem prover too weak. 7213 trivial. 0 not checked. [2018-10-10 16:30:37,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:37,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 16:30:37,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 16:30:37,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 16:30:37,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1568, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:30:37,324 INFO L87 Difference]: Start difference. First operand 2559 states and 2579 transitions. Second operand 45 states. [2018-10-10 16:30:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:44,940 INFO L93 Difference]: Finished difference Result 2753 states and 2774 transitions. [2018-10-10 16:30:44,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-10 16:30:44,940 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 2499 [2018-10-10 16:30:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:44,946 INFO L225 Difference]: With dead ends: 2753 [2018-10-10 16:30:44,946 INFO L226 Difference]: Without dead ends: 2753 [2018-10-10 16:30:44,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22239 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10961, Invalid=44029, Unknown=0, NotChecked=0, Total=54990 [2018-10-10 16:30:44,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2018-10-10 16:30:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2734. [2018-10-10 16:30:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2018-10-10 16:30:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 2755 transitions. [2018-10-10 16:30:44,970 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 2755 transitions. Word has length 2499 [2018-10-10 16:30:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:44,971 INFO L481 AbstractCegarLoop]: Abstraction has 2734 states and 2755 transitions. [2018-10-10 16:30:44,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 16:30:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 2755 transitions. [2018-10-10 16:30:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2675 [2018-10-10 16:30:45,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:45,022 INFO L375 BasicCegarLoop]: trace histogram [145, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:45,022 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:45,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:45,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1182830514, now seen corresponding path program 44 times [2018-10-10 16:30:45,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 161929 backedges. 0 proven. 154092 refuted. 0 times theorem prover too weak. 7837 trivial. 0 not checked. [2018-10-10 16:30:50,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:50,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 16:30:50,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 16:30:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 16:30:50,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1895, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:30:50,951 INFO L87 Difference]: Start difference. First operand 2734 states and 2755 transitions. Second operand 49 states. [2018-10-10 16:31:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:04,922 INFO L93 Difference]: Finished difference Result 2928 states and 2950 transitions. [2018-10-10 16:31:04,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 282 states. [2018-10-10 16:31:04,923 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2674 [2018-10-10 16:31:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:04,927 INFO L225 Difference]: With dead ends: 2928 [2018-10-10 16:31:04,927 INFO L226 Difference]: Without dead ends: 2928 [2018-10-10 16:31:04,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46379 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18958, Invalid=86342, Unknown=0, NotChecked=0, Total=105300 [2018-10-10 16:31:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2018-10-10 16:31:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2909. [2018-10-10 16:31:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2909 states. [2018-10-10 16:31:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 2931 transitions. [2018-10-10 16:31:04,954 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 2931 transitions. Word has length 2674 [2018-10-10 16:31:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:04,955 INFO L481 AbstractCegarLoop]: Abstraction has 2909 states and 2931 transitions. [2018-10-10 16:31:04,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 16:31:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 2931 transitions. [2018-10-10 16:31:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2850 [2018-10-10 16:31:05,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:05,018 INFO L375 BasicCegarLoop]: trace histogram [155, 154, 154, 154, 154, 154, 154, 154, 154, 154, 154, 154, 154, 154, 154, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:05,019 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:05,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:05,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1167364374, now seen corresponding path program 45 times [2018-10-10 16:31:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 185053 backedges. 71 proven. 176394 refuted. 0 times theorem prover too weak. 8588 trivial. 0 not checked. [2018-10-10 16:31:11,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:11,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 16:31:11,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 16:31:11,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 16:31:11,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:31:11,151 INFO L87 Difference]: Start difference. First operand 2909 states and 2931 transitions. Second operand 49 states. [2018-10-10 16:31:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:19,389 INFO L93 Difference]: Finished difference Result 3103 states and 3126 transitions. [2018-10-10 16:31:19,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-10-10 16:31:19,389 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2849 [2018-10-10 16:31:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:19,395 INFO L225 Difference]: With dead ends: 3103 [2018-10-10 16:31:19,395 INFO L226 Difference]: Without dead ends: 3103 [2018-10-10 16:31:19,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27086 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=14208, Invalid=51072, Unknown=0, NotChecked=0, Total=65280 [2018-10-10 16:31:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2018-10-10 16:31:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 3084. [2018-10-10 16:31:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3084 states. [2018-10-10 16:31:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 3107 transitions. [2018-10-10 16:31:19,417 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 3107 transitions. Word has length 2849 [2018-10-10 16:31:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:19,418 INFO L481 AbstractCegarLoop]: Abstraction has 3084 states and 3107 transitions. [2018-10-10 16:31:19,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 16:31:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 3107 transitions. [2018-10-10 16:31:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3025 [2018-10-10 16:31:19,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:19,470 INFO L375 BasicCegarLoop]: trace histogram [165, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 164, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:19,470 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:19,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1580308658, now seen corresponding path program 46 times [2018-10-10 16:31:19,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 209722 backedges. 0 proven. 200515 refuted. 0 times theorem prover too weak. 9207 trivial. 0 not checked. [2018-10-10 16:31:26,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:26,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 16:31:26,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 16:31:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 16:31:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=2211, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:31:26,465 INFO L87 Difference]: Start difference. First operand 3084 states and 3107 transitions. Second operand 53 states. [2018-10-10 16:31:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:42,860 INFO L93 Difference]: Finished difference Result 3278 states and 3302 transitions. [2018-10-10 16:31:42,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 310 states. [2018-10-10 16:31:42,860 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 3024 [2018-10-10 16:31:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:42,866 INFO L225 Difference]: With dead ends: 3278 [2018-10-10 16:31:42,866 INFO L226 Difference]: Without dead ends: 3278 [2018-10-10 16:31:42,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56400 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=22815, Invalid=104277, Unknown=0, NotChecked=0, Total=127092 [2018-10-10 16:31:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2018-10-10 16:31:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 3259. [2018-10-10 16:31:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3259 states. [2018-10-10 16:31:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 3283 transitions. [2018-10-10 16:31:42,898 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 3283 transitions. Word has length 3024 [2018-10-10 16:31:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:42,900 INFO L481 AbstractCegarLoop]: Abstraction has 3259 states and 3283 transitions. [2018-10-10 16:31:42,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 16:31:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 3283 transitions. [2018-10-10 16:31:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3200 [2018-10-10 16:31:42,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:42,973 INFO L375 BasicCegarLoop]: trace histogram [175, 174, 174, 174, 174, 174, 174, 174, 174, 174, 174, 174, 174, 174, 174, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:42,973 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:42,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash -970671594, now seen corresponding path program 47 times [2018-10-10 16:31:42,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 235936 backedges. 199413 proven. 26222 refuted. 0 times theorem prover too weak. 10301 trivial. 0 not checked. [2018-10-10 16:31:50,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:50,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 16:31:50,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 16:31:50,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 16:31:50,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=3698, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 16:31:50,804 INFO L87 Difference]: Start difference. First operand 3259 states and 3283 transitions. Second operand 66 states. [2018-10-10 16:31:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:54,680 INFO L93 Difference]: Finished difference Result 3353 states and 3374 transitions. [2018-10-10 16:31:54,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 16:31:54,680 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 3199 [2018-10-10 16:31:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:54,685 INFO L225 Difference]: With dead ends: 3353 [2018-10-10 16:31:54,685 INFO L226 Difference]: Without dead ends: 3353 [2018-10-10 16:31:54,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4640 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3756, Invalid=15704, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 16:31:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2018-10-10 16:31:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3304. [2018-10-10 16:31:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3304 states. [2018-10-10 16:31:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 3329 transitions. [2018-10-10 16:31:54,704 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 3329 transitions. Word has length 3199 [2018-10-10 16:31:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:54,705 INFO L481 AbstractCegarLoop]: Abstraction has 3304 states and 3329 transitions. [2018-10-10 16:31:54,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 16:31:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 3329 transitions. [2018-10-10 16:31:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3230 [2018-10-10 16:31:54,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:54,760 INFO L375 BasicCegarLoop]: trace histogram [177, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:54,760 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:54,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash 40214502, now seen corresponding path program 48 times [2018-10-10 16:31:54,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 241219 backedges. 203110 proven. 24509 refuted. 0 times theorem prover too weak. 13600 trivial. 0 not checked. [2018-10-10 16:32:02,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:02,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 16:32:02,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 16:32:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 16:32:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=3481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:32:02,420 INFO L87 Difference]: Start difference. First operand 3304 states and 3329 transitions. Second operand 64 states. [2018-10-10 16:32:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:07,533 INFO L93 Difference]: Finished difference Result 3381 states and 3402 transitions. [2018-10-10 16:32:07,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 16:32:07,533 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 3229 [2018-10-10 16:32:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:07,538 INFO L225 Difference]: With dead ends: 3381 [2018-10-10 16:32:07,538 INFO L226 Difference]: Without dead ends: 3381 [2018-10-10 16:32:07,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4378 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3524, Invalid=14836, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 16:32:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2018-10-10 16:32:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3319. [2018-10-10 16:32:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2018-10-10 16:32:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 3344 transitions. [2018-10-10 16:32:07,560 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 3344 transitions. Word has length 3229 [2018-10-10 16:32:07,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:07,561 INFO L481 AbstractCegarLoop]: Abstraction has 3319 states and 3344 transitions. [2018-10-10 16:32:07,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 16:32:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 3344 transitions. [2018-10-10 16:32:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3245 [2018-10-10 16:32:07,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:07,618 INFO L375 BasicCegarLoop]: trace histogram [178, 177, 177, 177, 177, 177, 177, 177, 177, 177, 177, 177, 177, 177, 177, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:32:07,619 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:07,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:07,619 INFO L82 PathProgramCache]: Analyzing trace with hash -810801274, now seen corresponding path program 49 times [2018-10-10 16:32:07,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 243883 backedges. 198243 proven. 21083 refuted. 0 times theorem prover too weak. 24557 trivial. 0 not checked. [2018-10-10 16:32:15,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:15,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 16:32:15,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 16:32:15,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 16:32:15,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=3065, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:32:15,189 INFO L87 Difference]: Start difference. First operand 3319 states and 3344 transitions. Second operand 60 states. [2018-10-10 16:32:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:19,862 INFO L93 Difference]: Finished difference Result 3437 states and 3458 transitions. [2018-10-10 16:32:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 16:32:19,863 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 3244 [2018-10-10 16:32:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:19,868 INFO L225 Difference]: With dead ends: 3437 [2018-10-10 16:32:19,868 INFO L226 Difference]: Without dead ends: 3437 [2018-10-10 16:32:19,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3872 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3090, Invalid=13166, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 16:32:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2018-10-10 16:32:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3349. [2018-10-10 16:32:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3349 states. [2018-10-10 16:32:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 3374 transitions. [2018-10-10 16:32:19,885 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 3374 transitions. Word has length 3244 [2018-10-10 16:32:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:19,886 INFO L481 AbstractCegarLoop]: Abstraction has 3349 states and 3374 transitions. [2018-10-10 16:32:19,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 16:32:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 3374 transitions. [2018-10-10 16:32:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3275 [2018-10-10 16:32:19,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:19,938 INFO L375 BasicCegarLoop]: trace histogram [180, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:32:19,938 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:19,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:19,938 INFO L82 PathProgramCache]: Analyzing trace with hash 730003286, now seen corresponding path program 50 times [2018-10-10 16:32:19,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 249256 backedges. 208241 proven. 27113 refuted. 0 times theorem prover too weak. 13902 trivial. 0 not checked. [2018-10-10 16:32:28,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:28,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 16:32:28,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 16:32:28,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 16:32:28,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=3714, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 16:32:28,110 INFO L87 Difference]: Start difference. First operand 3349 states and 3374 transitions. Second operand 66 states. [2018-10-10 16:32:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:34,375 INFO L93 Difference]: Finished difference Result 3473 states and 3494 transitions. [2018-10-10 16:32:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 16:32:34,375 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 3274 [2018-10-10 16:32:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:34,380 INFO L225 Difference]: With dead ends: 3473 [2018-10-10 16:32:34,380 INFO L226 Difference]: Without dead ends: 3473 [2018-10-10 16:32:34,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4746 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3756, Invalid=15984, Unknown=0, NotChecked=0, Total=19740 [2018-10-10 16:32:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2018-10-10 16:32:34,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 3409. [2018-10-10 16:32:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2018-10-10 16:32:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 3435 transitions. [2018-10-10 16:32:34,399 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 3435 transitions. Word has length 3274 [2018-10-10 16:32:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:34,401 INFO L481 AbstractCegarLoop]: Abstraction has 3409 states and 3435 transitions. [2018-10-10 16:32:34,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 16:32:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 3435 transitions. [2018-10-10 16:32:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3320 [2018-10-10 16:32:34,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:34,458 INFO L375 BasicCegarLoop]: trace histogram [183, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:32:34,458 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:34,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:34,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1446992454, now seen corresponding path program 51 times [2018-10-10 16:32:34,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 257428 backedges. 201307 proven. 19370 refuted. 0 times theorem prover too weak. 36751 trivial. 0 not checked. [2018-10-10 16:32:41,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:41,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 16:32:41,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 16:32:41,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 16:32:41,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=2866, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:32:41,870 INFO L87 Difference]: Start difference. First operand 3409 states and 3435 transitions. Second operand 58 states. [2018-10-10 16:32:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:46,446 INFO L93 Difference]: Finished difference Result 3473 states and 3494 transitions. [2018-10-10 16:32:46,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 16:32:46,446 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 3319 [2018-10-10 16:32:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:46,450 INFO L225 Difference]: With dead ends: 3473 [2018-10-10 16:32:46,450 INFO L226 Difference]: Without dead ends: 3473 [2018-10-10 16:32:46,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3628 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2888, Invalid=12364, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 16:32:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2018-10-10 16:32:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 3424. [2018-10-10 16:32:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3424 states. [2018-10-10 16:32:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 3450 transitions. [2018-10-10 16:32:46,466 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 3450 transitions. Word has length 3319 [2018-10-10 16:32:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:46,467 INFO L481 AbstractCegarLoop]: Abstraction has 3424 states and 3450 transitions. [2018-10-10 16:32:46,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 16:32:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 3450 transitions. [2018-10-10 16:32:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3335 [2018-10-10 16:32:46,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:46,525 INFO L375 BasicCegarLoop]: trace histogram [184, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:32:46,525 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:46,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:46,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1702200298, now seen corresponding path program 52 times [2018-10-10 16:32:46,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 260182 backedges. 215671 proven. 29595 refuted. 0 times theorem prover too weak. 14916 trivial. 0 not checked. [2018-10-10 16:32:55,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:55,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 16:32:55,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 16:32:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 16:32:55,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=603, Invalid=3953, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:32:55,264 INFO L87 Difference]: Start difference. First operand 3424 states and 3450 transitions. Second operand 68 states. [2018-10-10 16:32:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:59,535 INFO L93 Difference]: Finished difference Result 3550 states and 3571 transitions. [2018-10-10 16:32:59,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-10 16:32:59,536 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 3334 [2018-10-10 16:32:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:59,540 INFO L225 Difference]: With dead ends: 3550 [2018-10-10 16:32:59,540 INFO L226 Difference]: Without dead ends: 3550 [2018-10-10 16:32:59,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5126 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4002, Invalid=17168, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 16:32:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2018-10-10 16:32:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3484. [2018-10-10 16:32:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3484 states. [2018-10-10 16:32:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 3511 transitions. [2018-10-10 16:32:59,561 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 3511 transitions. Word has length 3334 [2018-10-10 16:32:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:59,562 INFO L481 AbstractCegarLoop]: Abstraction has 3484 states and 3511 transitions. [2018-10-10 16:32:59,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 16:32:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 3511 transitions. [2018-10-10 16:32:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3380 [2018-10-10 16:32:59,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:59,614 INFO L375 BasicCegarLoop]: trace histogram [187, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:32:59,615 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:59,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1314124410, now seen corresponding path program 53 times [2018-10-10 16:32:59,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 268534 backedges. 0 proven. 256695 refuted. 0 times theorem prover too weak. 11839 trivial. 0 not checked. [2018-10-10 16:33:09,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:09,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 16:33:09,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 16:33:09,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 16:33:09,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=2378, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:33:09,809 INFO L87 Difference]: Start difference. First operand 3484 states and 3511 transitions. Second operand 55 states. [2018-10-10 16:33:27,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:33:27,014 INFO L93 Difference]: Finished difference Result 3723 states and 3751 transitions. [2018-10-10 16:33:27,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 324 states. [2018-10-10 16:33:27,014 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 3379 [2018-10-10 16:33:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:33:27,018 INFO L225 Difference]: With dead ends: 3723 [2018-10-10 16:33:27,018 INFO L226 Difference]: Without dead ends: 3723 [2018-10-10 16:33:27,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61778 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=24877, Invalid=113879, Unknown=0, NotChecked=0, Total=138756 [2018-10-10 16:33:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2018-10-10 16:33:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3704. [2018-10-10 16:33:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3704 states. [2018-10-10 16:33:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 3732 transitions. [2018-10-10 16:33:27,044 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 3732 transitions. Word has length 3379 [2018-10-10 16:33:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:33:27,045 INFO L481 AbstractCegarLoop]: Abstraction has 3704 states and 3732 transitions. [2018-10-10 16:33:27,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 16:33:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 3732 transitions. [2018-10-10 16:33:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3600 [2018-10-10 16:33:27,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:33:27,160 INFO L375 BasicCegarLoop]: trace histogram [200, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:33:27,160 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:33:27,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:33:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1153640978, now seen corresponding path program 54 times [2018-10-10 16:33:27,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 307045 backedges. 71 proven. 293886 refuted. 0 times theorem prover too weak. 13088 trivial. 0 not checked. [2018-10-10 16:33:36,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:36,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 16:33:36,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 16:33:36,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 16:33:36,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=2330, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:33:36,589 INFO L87 Difference]: Start difference. First operand 3704 states and 3732 transitions. Second operand 55 states. [2018-10-10 16:33:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:33:46,593 INFO L93 Difference]: Finished difference Result 3943 states and 3972 transitions. [2018-10-10 16:33:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-10 16:33:46,594 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 3599 [2018-10-10 16:33:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:33:46,598 INFO L225 Difference]: With dead ends: 3943 [2018-10-10 16:33:46,598 INFO L226 Difference]: Without dead ends: 3943 [2018-10-10 16:33:46,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35564 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=18363, Invalid=66609, Unknown=0, NotChecked=0, Total=84972 [2018-10-10 16:33:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2018-10-10 16:33:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3924. [2018-10-10 16:33:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3924 states. [2018-10-10 16:33:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 3953 transitions. [2018-10-10 16:33:46,621 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 3953 transitions. Word has length 3599 [2018-10-10 16:33:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:33:46,622 INFO L481 AbstractCegarLoop]: Abstraction has 3924 states and 3953 transitions. [2018-10-10 16:33:46,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 16:33:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 3953 transitions. [2018-10-10 16:33:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3820 [2018-10-10 16:33:46,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:33:46,693 INFO L375 BasicCegarLoop]: trace histogram [213, 212, 212, 212, 212, 212, 212, 212, 212, 212, 212, 212, 212, 212, 212, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:33:46,693 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:33:46,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:33:46,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2122363478, now seen corresponding path program 55 times [2018-10-10 16:33:46,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 348142 backedges. 166710 proven. 9138 refuted. 0 times theorem prover too weak. 172294 trivial. 0 not checked. [2018-10-10 16:33:55,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:55,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:33:55,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:33:55,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:33:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1643, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:33:55,479 INFO L87 Difference]: Start difference. First operand 3924 states and 3953 transitions. Second operand 44 states. [2018-10-10 16:33:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:33:57,889 INFO L93 Difference]: Finished difference Result 4100 states and 4125 transitions. [2018-10-10 16:33:57,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 16:33:57,890 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 3819 [2018-10-10 16:33:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:33:57,893 INFO L225 Difference]: With dead ends: 4100 [2018-10-10 16:33:57,893 INFO L226 Difference]: Without dead ends: 4100 [2018-10-10 16:33:57,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2051 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1695, Invalid=7235, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 16:33:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2018-10-10 16:33:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 4014. [2018-10-10 16:33:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4014 states. [2018-10-10 16:33:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 4043 transitions. [2018-10-10 16:33:57,913 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 4043 transitions. Word has length 3819 [2018-10-10 16:33:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:33:57,914 INFO L481 AbstractCegarLoop]: Abstraction has 4014 states and 4043 transitions. [2018-10-10 16:33:57,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:33:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 4043 transitions. [2018-10-10 16:33:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3910 [2018-10-10 16:33:57,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:33:57,989 INFO L375 BasicCegarLoop]: trace histogram [219, 218, 218, 218, 218, 218, 218, 218, 218, 218, 218, 218, 218, 218, 218, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:33:57,989 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:33:57,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:33:57,990 INFO L82 PathProgramCache]: Analyzing trace with hash -976145690, now seen corresponding path program 56 times [2018-10-10 16:33:57,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:34:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 367603 backedges. 230668 proven. 15233 refuted. 0 times theorem prover too weak. 121702 trivial. 0 not checked. [2018-10-10 16:34:07,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:34:07,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 16:34:07,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 16:34:07,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 16:34:07,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2305, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:34:07,128 INFO L87 Difference]: Start difference. First operand 4014 states and 4043 transitions. Second operand 52 states. [2018-10-10 16:34:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:34:10,600 INFO L93 Difference]: Finished difference Result 4147 states and 4171 transitions. [2018-10-10 16:34:10,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 16:34:10,600 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 3909 [2018-10-10 16:34:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:34:10,604 INFO L225 Difference]: With dead ends: 4147 [2018-10-10 16:34:10,604 INFO L226 Difference]: Without dead ends: 4147 [2018-10-10 16:34:10,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2932 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2342, Invalid=10090, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 16:34:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4147 states. [2018-10-10 16:34:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4147 to 4059. [2018-10-10 16:34:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4059 states. [2018-10-10 16:34:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 4088 transitions. [2018-10-10 16:34:10,623 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 4088 transitions. Word has length 3909 [2018-10-10 16:34:10,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:34:10,624 INFO L481 AbstractCegarLoop]: Abstraction has 4059 states and 4088 transitions. [2018-10-10 16:34:10,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 16:34:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 4088 transitions. [2018-10-10 16:34:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3955 [2018-10-10 16:34:10,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:34:10,700 INFO L375 BasicCegarLoop]: trace histogram [222, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 221, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:34:10,700 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:34:10,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:34:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash -863532234, now seen corresponding path program 57 times [2018-10-10 16:34:10,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:34:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:34:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 377536 backedges. 0 proven. 362062 refuted. 0 times theorem prover too weak. 15474 trivial. 0 not checked. [2018-10-10 16:34:21,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:34:21,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 16:34:21,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 16:34:21,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 16:34:21,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=692, Invalid=2730, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:34:21,875 INFO L87 Difference]: Start difference. First operand 4059 states and 4088 transitions. Second operand 59 states. [2018-10-10 16:34:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:34:41,352 INFO L93 Difference]: Finished difference Result 4298 states and 4328 transitions. [2018-10-10 16:34:41,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2018-10-10 16:34:41,353 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 3954 [2018-10-10 16:34:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:34:41,357 INFO L225 Difference]: With dead ends: 4298 [2018-10-10 16:34:41,357 INFO L226 Difference]: Without dead ends: 4298 [2018-10-10 16:34:41,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73269 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=29268, Invalid=134352, Unknown=0, NotChecked=0, Total=163620 [2018-10-10 16:34:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2018-10-10 16:34:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4279. [2018-10-10 16:34:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4279 states. [2018-10-10 16:34:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 4309 transitions. [2018-10-10 16:34:41,384 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 4309 transitions. Word has length 3954 [2018-10-10 16:34:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:34:41,387 INFO L481 AbstractCegarLoop]: Abstraction has 4279 states and 4309 transitions. [2018-10-10 16:34:41,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 16:34:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 4309 transitions. [2018-10-10 16:34:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4175 [2018-10-10 16:34:41,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:34:41,479 INFO L375 BasicCegarLoop]: trace histogram [235, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:34:41,479 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:34:41,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:34:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash -293114978, now seen corresponding path program 58 times [2018-10-10 16:34:41,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:34:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:34:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 422983 backedges. 71 proven. 406189 refuted. 0 times theorem prover too weak. 16723 trivial. 0 not checked. [2018-10-10 16:34:54,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:34:54,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 16:34:54,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 16:34:54,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 16:34:54,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=2678, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:34:54,254 INFO L87 Difference]: Start difference. First operand 4279 states and 4309 transitions. Second operand 59 states. [2018-10-10 16:35:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:35:05,916 INFO L93 Difference]: Finished difference Result 4518 states and 4549 transitions. [2018-10-10 16:35:05,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2018-10-10 16:35:05,916 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 4174 [2018-10-10 16:35:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:35:05,922 INFO L225 Difference]: With dead ends: 4518 [2018-10-10 16:35:05,922 INFO L226 Difference]: Without dead ends: 4518 [2018-10-10 16:35:05,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41856 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=21428, Invalid=78112, Unknown=0, NotChecked=0, Total=99540 [2018-10-10 16:35:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2018-10-10 16:35:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 4499. [2018-10-10 16:35:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2018-10-10 16:35:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 4530 transitions. [2018-10-10 16:35:05,955 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 4530 transitions. Word has length 4174 [2018-10-10 16:35:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:35:05,958 INFO L481 AbstractCegarLoop]: Abstraction has 4499 states and 4530 transitions. [2018-10-10 16:35:05,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 16:35:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 4530 transitions. [2018-10-10 16:35:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4395 [2018-10-10 16:35:06,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:35:06,056 INFO L375 BasicCegarLoop]: trace histogram [248, 247, 247, 247, 247, 247, 247, 247, 247, 247, 247, 247, 247, 247, 247, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:35:06,056 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:35:06,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:35:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash 753295366, now seen corresponding path program 59 times [2018-10-10 16:35:06,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:35:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:35:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 471016 backedges. 22354 proven. 237 refuted. 0 times theorem prover too weak. 448425 trivial. 0 not checked. [2018-10-10 16:35:13,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:35:13,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:35:13,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:35:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:35:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:35:13,928 INFO L87 Difference]: Start difference. First operand 4499 states and 4530 transitions. Second operand 15 states. [2018-10-10 16:35:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:35:14,668 INFO L93 Difference]: Finished difference Result 4904 states and 4944 transitions. [2018-10-10 16:35:14,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:35:14,668 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 4394 [2018-10-10 16:35:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:35:14,674 INFO L225 Difference]: With dead ends: 4904 [2018-10-10 16:35:14,674 INFO L226 Difference]: Without dead ends: 4904 [2018-10-10 16:35:14,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:35:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2018-10-10 16:35:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4499. [2018-10-10 16:35:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2018-10-10 16:35:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 4529 transitions. [2018-10-10 16:35:14,703 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 4529 transitions. Word has length 4394 [2018-10-10 16:35:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:35:14,706 INFO L481 AbstractCegarLoop]: Abstraction has 4499 states and 4529 transitions. [2018-10-10 16:35:14,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:35:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 4529 transitions. [2018-10-10 16:35:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4410 [2018-10-10 16:35:14,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:35:14,813 INFO L375 BasicCegarLoop]: trace histogram [249, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 248, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:35:14,813 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:35:14,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:35:14,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1920439798, now seen corresponding path program 60 times [2018-10-10 16:35:14,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:35:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:35:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 474749 backedges. 237 proven. 456766 refuted. 0 times theorem prover too weak. 17746 trivial. 0 not checked. [2018-10-10 16:35:29,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:35:29,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 16:35:29,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 16:35:29,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 16:35:29,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=4386, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 16:35:29,949 INFO L87 Difference]: Start difference. First operand 4499 states and 4529 transitions. Second operand 73 states.