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_false-valid-deref-read.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:26:36,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:26:36,560 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:26:36,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:26:36,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:26:36,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:26:36,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:26:36,577 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:26:36,579 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:26:36,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:26:36,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:26:36,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:26:36,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:26:36,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:26:36,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:26:36,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:26:36,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:26:36,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:26:36,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:26:36,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:26:36,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:26:36,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:26:36,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:26:36,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:26:36,597 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:26:36,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:26:36,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:26:36,600 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:26:36,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:26:36,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:26:36,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:26:36,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:26:36,603 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:26:36,603 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:26:36,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:26:36,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:26:36,605 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:26:36,615 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:26:36,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:26:36,616 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:26:36,616 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:26:36,616 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:26:36,617 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:26:36,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:26:36,618 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:26:36,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:26:36,618 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:26:36,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:26:36,618 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:26:36,619 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:26:36,619 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:26:36,620 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:26:36,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:26:36,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:26:36,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:26:36,716 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:26:36,716 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:26:36,717 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl [2018-10-10 16:26:36,718 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl' [2018-10-10 16:26:36,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:26:36,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:26:36,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:26:36,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:26:36,805 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:26:36,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:36" (1/1) ... [2018-10-10 16:26:36,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:36" (1/1) ... [2018-10-10 16:26:36,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:36" (1/1) ... [2018-10-10 16:26:36,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:36" (1/1) ... [2018-10-10 16:26:36,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:36" (1/1) ... [2018-10-10 16:26:36,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:36" (1/1) ... [2018-10-10 16:26:36,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:36" (1/1) ... [2018-10-10 16:26:36,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:26:36,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:26:36,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:26:36,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:26:36,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:36" (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:26:36,957 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:26:36,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:26:36,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:26:37,480 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:26:37,481 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:26:37 BoogieIcfgContainer [2018-10-10 16:26:37,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:26:37,482 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:26:37,482 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:26:37,483 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:26:37,486 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:26:37" (1/1) ... [2018-10-10 16:26:37,496 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:26:37,496 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:26:37,548 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:26:37,585 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:26:37,604 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:26:37,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:26:51,912 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:26:51,917 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:26:51,922 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:26:51,934 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_7|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:26:51,936 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_7|) |v_ULTIMATE.start_read~int_#ptr.offset_5|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:26:51,968 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:26:51,969 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:26:51,970 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:26:51,970 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:26:51,970 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:26:51,971 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:26:51,971 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:26:51,971 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:26:51,971 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:26:51,971 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:26:51,972 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:26:51,972 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:26:51,972 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:26:51,972 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:26:51,972 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:26:51,975 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:26:51,976 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:26:52,012 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:26:52 BasicIcfg [2018-10-10 16:26:52,012 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:26:52,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:26:52,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:26:52,018 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:26:52,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:36" (1/3) ... [2018-10-10 16:26:52,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9be42d and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:26:52, skipping insertion in model container [2018-10-10 16:26:52,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:26:37" (2/3) ... [2018-10-10 16:26:52,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9be42d and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:26:52, skipping insertion in model container [2018-10-10 16:26:52,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:26:52" (3/3) ... [2018-10-10 16:26:52,022 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:26:52,034 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:26:52,043 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:26:52,063 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:26:52,098 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:26:52,099 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:26:52,099 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:26:52,099 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:26:52,101 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:26:52,101 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:26:52,101 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:26:52,102 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:26:52,102 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:26:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-10 16:26:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-10 16:26:52,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:52,135 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:52,136 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:52,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:52,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1397757478, now seen corresponding path program 1 times [2018-10-10 16:26:52,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:53,578 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 16:26:54,061 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:26:54,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:26:54,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 16:26:54,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:26:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:26:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:26:54,086 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 10 states. [2018-10-10 16:26:55,178 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 16:26:55,488 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-10 16:26:55,943 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-10 16:26:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:56,359 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-10-10 16:26:56,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:26:56,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-10-10 16:26:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:56,375 INFO L225 Difference]: With dead ends: 155 [2018-10-10 16:26:56,375 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 16:26:56,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:26:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 16:26:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 73. [2018-10-10 16:26:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-10 16:26:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-10-10 16:26:56,423 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 42 [2018-10-10 16:26:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:56,424 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-10-10 16:26:56,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:26:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-10-10 16:26:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 16:26:56,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:56,427 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:56,427 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:56,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 2074534794, now seen corresponding path program 1 times [2018-10-10 16:26:56,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:26:57,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:57,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:26:57,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:26:57,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:26:57,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:26:57,058 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 12 states. [2018-10-10 16:26:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:58,581 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2018-10-10 16:26:58,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:26:58,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-10-10 16:26:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:58,586 INFO L225 Difference]: With dead ends: 189 [2018-10-10 16:26:58,586 INFO L226 Difference]: Without dead ends: 189 [2018-10-10 16:26:58,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:26:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-10 16:26:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 88. [2018-10-10 16:26:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-10 16:26:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-10-10 16:26:58,598 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 57 [2018-10-10 16:26:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:58,599 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-10-10 16:26:58,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:26:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-10-10 16:26:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-10 16:26:58,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:58,602 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-10-10 16:26:58,602 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:58,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:58,602 INFO L82 PathProgramCache]: Analyzing trace with hash 386356186, now seen corresponding path program 2 times [2018-10-10 16:26:58,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:26:58,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:58,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:26:58,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:26:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:26:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:26:58,821 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 10 states. [2018-10-10 16:26:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:59,286 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-10-10 16:26:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 16:26:59,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-10-10 16:26:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:59,293 INFO L225 Difference]: With dead ends: 147 [2018-10-10 16:26:59,293 INFO L226 Difference]: Without dead ends: 147 [2018-10-10 16:26:59,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:26:59,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-10 16:26:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2018-10-10 16:26:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 16:26:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2018-10-10 16:26:59,304 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 72 [2018-10-10 16:26:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:59,304 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2018-10-10 16:26:59,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:26:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-10-10 16:26:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-10 16:26:59,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:59,309 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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:26:59,309 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:59,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash 884185714, now seen corresponding path program 1 times [2018-10-10 16:26:59,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-10 16:26:59,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:59,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:26:59,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:26:59,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:26:59,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:26:59,480 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 8 states. [2018-10-10 16:26:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:59,635 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2018-10-10 16:26:59,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:26:59,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2018-10-10 16:26:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:59,640 INFO L225 Difference]: With dead ends: 147 [2018-10-10 16:26:59,640 INFO L226 Difference]: Without dead ends: 147 [2018-10-10 16:26:59,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:26:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-10 16:26:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2018-10-10 16:26:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 16:26:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2018-10-10 16:26:59,660 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 112 [2018-10-10 16:26:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:59,663 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2018-10-10 16:26:59,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:26:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-10-10 16:26:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-10 16:26:59,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:59,669 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:26:59,669 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:59,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1921978402, now seen corresponding path program 2 times [2018-10-10 16:26:59,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-10 16:27:00,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:00,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:27:00,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:27:00,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:27:00,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:27:00,145 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 14 states. [2018-10-10 16:27:01,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:01,677 INFO L93 Difference]: Finished difference Result 259 states and 265 transitions. [2018-10-10 16:27:01,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 16:27:01,678 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2018-10-10 16:27:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:01,681 INFO L225 Difference]: With dead ends: 259 [2018-10-10 16:27:01,681 INFO L226 Difference]: Without dead ends: 259 [2018-10-10 16:27:01,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:27:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-10 16:27:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 143. [2018-10-10 16:27:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 16:27:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-10-10 16:27:01,692 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 127 [2018-10-10 16:27:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:01,692 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-10-10 16:27:01,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:27:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-10-10 16:27:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-10 16:27:01,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:01,695 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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:01,695 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:01,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:01,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1943888962, now seen corresponding path program 3 times [2018-10-10 16:27:01,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 39 proven. 134 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-10 16:27:02,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:02,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:27:02,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:27:02,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:27:02,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:27:02,070 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 14 states. [2018-10-10 16:27:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:02,878 INFO L93 Difference]: Finished difference Result 251 states and 258 transitions. [2018-10-10 16:27:02,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 16:27:02,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 142 [2018-10-10 16:27:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:02,882 INFO L225 Difference]: With dead ends: 251 [2018-10-10 16:27:02,882 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 16:27:02,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=390, Invalid=1416, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:27:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 16:27:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2018-10-10 16:27:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 16:27:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 220 transitions. [2018-10-10 16:27:02,893 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 220 transitions. Word has length 142 [2018-10-10 16:27:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:02,893 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 220 transitions. [2018-10-10 16:27:02,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:27:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 220 transitions. [2018-10-10 16:27:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 16:27:02,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:02,897 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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:02,897 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:02,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1145745782, now seen corresponding path program 4 times [2018-10-10 16:27:02,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 141 proven. 12 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-10 16:27:03,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:03,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:27:03,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:27:03,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:27:03,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:27:03,293 INFO L87 Difference]: Start difference. First operand 213 states and 220 transitions. Second operand 8 states. [2018-10-10 16:27:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:03,435 INFO L93 Difference]: Finished difference Result 232 states and 238 transitions. [2018-10-10 16:27:03,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:27:03,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2018-10-10 16:27:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:03,438 INFO L225 Difference]: With dead ends: 232 [2018-10-10 16:27:03,438 INFO L226 Difference]: Without dead ends: 232 [2018-10-10 16:27:03,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:27:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-10 16:27:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 213. [2018-10-10 16:27:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 16:27:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 219 transitions. [2018-10-10 16:27:03,446 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 219 transitions. Word has length 167 [2018-10-10 16:27:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:03,446 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 219 transitions. [2018-10-10 16:27:03,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:27:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 219 transitions. [2018-10-10 16:27:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-10 16:27:03,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:03,450 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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:03,450 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:03,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:03,451 INFO L82 PathProgramCache]: Analyzing trace with hash -115014998, now seen corresponding path program 5 times [2018-10-10 16:27:03,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 191 proven. 44 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-10 16:27:03,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:03,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:27:03,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:27:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:27:03,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:27:03,670 INFO L87 Difference]: Start difference. First operand 213 states and 219 transitions. Second operand 10 states. [2018-10-10 16:27:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:03,939 INFO L93 Difference]: Finished difference Result 232 states and 237 transitions. [2018-10-10 16:27:03,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 16:27:03,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 182 [2018-10-10 16:27:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:03,942 INFO L225 Difference]: With dead ends: 232 [2018-10-10 16:27:03,942 INFO L226 Difference]: Without dead ends: 232 [2018-10-10 16:27:03,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:27:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-10 16:27:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 213. [2018-10-10 16:27:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 16:27:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 218 transitions. [2018-10-10 16:27:03,948 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 218 transitions. Word has length 182 [2018-10-10 16:27:03,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:03,949 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 218 transitions. [2018-10-10 16:27:03,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:27:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 218 transitions. [2018-10-10 16:27:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-10 16:27:03,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:03,952 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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:03,952 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:03,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:03,953 INFO L82 PathProgramCache]: Analyzing trace with hash 303205002, now seen corresponding path program 6 times [2018-10-10 16:27:03,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 241 proven. 91 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-10 16:27:04,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:04,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:27:04,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:27:04,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:27:04,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:27:04,144 INFO L87 Difference]: Start difference. First operand 213 states and 218 transitions. Second operand 12 states. [2018-10-10 16:27:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:04,558 INFO L93 Difference]: Finished difference Result 232 states and 236 transitions. [2018-10-10 16:27:04,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 16:27:04,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 197 [2018-10-10 16:27:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:04,561 INFO L225 Difference]: With dead ends: 232 [2018-10-10 16:27:04,561 INFO L226 Difference]: Without dead ends: 232 [2018-10-10 16:27:04,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:27:04,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-10 16:27:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 213. [2018-10-10 16:27:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 16:27:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2018-10-10 16:27:04,567 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 197 [2018-10-10 16:27:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:04,568 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2018-10-10 16:27:04,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:27:04,568 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2018-10-10 16:27:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-10 16:27:04,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:04,571 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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:04,571 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:04,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1389869398, now seen corresponding path program 7 times [2018-10-10 16:27:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-10 16:27:05,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:05,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 16:27:05,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 16:27:05,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 16:27:05,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:27:05,006 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 17 states. [2018-10-10 16:27:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:07,204 INFO L93 Difference]: Finished difference Result 333 states and 342 transitions. [2018-10-10 16:27:07,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:27:07,205 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 212 [2018-10-10 16:27:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:07,208 INFO L225 Difference]: With dead ends: 333 [2018-10-10 16:27:07,208 INFO L226 Difference]: Without dead ends: 333 [2018-10-10 16:27:07,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=633, Invalid=1529, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:27:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-10 16:27:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 252. [2018-10-10 16:27:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 16:27:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 257 transitions. [2018-10-10 16:27:07,217 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 257 transitions. Word has length 212 [2018-10-10 16:27:07,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:07,218 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 257 transitions. [2018-10-10 16:27:07,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 16:27:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2018-10-10 16:27:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-10 16:27:07,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:07,221 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 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:07,222 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:07,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1163292962, now seen corresponding path program 8 times [2018-10-10 16:27:07,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 336 proven. 4 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-10-10 16:27:07,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:07,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:27:07,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:27:07,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:27:07,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:27:07,490 INFO L87 Difference]: Start difference. First operand 252 states and 257 transitions. Second operand 10 states. [2018-10-10 16:27:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:07,750 INFO L93 Difference]: Finished difference Result 273 states and 278 transitions. [2018-10-10 16:27:07,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 16:27:07,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2018-10-10 16:27:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:07,752 INFO L225 Difference]: With dead ends: 273 [2018-10-10 16:27:07,752 INFO L226 Difference]: Without dead ends: 266 [2018-10-10 16:27:07,753 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:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-10 16:27:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 253. [2018-10-10 16:27:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-10 16:27:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 257 transitions. [2018-10-10 16:27:07,759 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 257 transitions. Word has length 237 [2018-10-10 16:27:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:07,760 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 257 transitions. [2018-10-10 16:27:07,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:27:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 257 transitions. [2018-10-10 16:27:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-10 16:27:07,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:07,762 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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:07,763 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:07,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:07,763 INFO L82 PathProgramCache]: Analyzing trace with hash 662134034, now seen corresponding path program 9 times [2018-10-10 16:27:07,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 463 proven. 5 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-10-10 16:27:08,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:08,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 16:27:08,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 16:27:08,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 16:27:08,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:27:08,632 INFO L87 Difference]: Start difference. First operand 253 states and 257 transitions. Second operand 11 states. [2018-10-10 16:27:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:08,987 INFO L93 Difference]: Finished difference Result 288 states and 292 transitions. [2018-10-10 16:27:08,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:27:08,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 252 [2018-10-10 16:27:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:08,990 INFO L225 Difference]: With dead ends: 288 [2018-10-10 16:27:08,990 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 16:27:08,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:27:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 16:27:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2018-10-10 16:27:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-10 16:27:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2018-10-10 16:27:08,997 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 252 [2018-10-10 16:27:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:08,997 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2018-10-10 16:27:08,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 16:27:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2018-10-10 16:27:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-10 16:27:08,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:08,999 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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:09,000 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:09,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:09,000 INFO L82 PathProgramCache]: Analyzing trace with hash 549655330, now seen corresponding path program 10 times [2018-10-10 16:27:09,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 422 proven. 313 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-10 16:27:09,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:09,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:27:09,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:27:09,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:27:09,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:27:09,270 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 14 states. [2018-10-10 16:27:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:09,792 INFO L93 Difference]: Finished difference Result 305 states and 307 transitions. [2018-10-10 16:27:09,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 16:27:09,793 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 267 [2018-10-10 16:27:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:09,795 INFO L225 Difference]: With dead ends: 305 [2018-10-10 16:27:09,795 INFO L226 Difference]: Without dead ends: 305 [2018-10-10 16:27:09,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:27:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-10 16:27:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2018-10-10 16:27:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 16:27:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 285 transitions. [2018-10-10 16:27:09,801 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 285 transitions. Word has length 267 [2018-10-10 16:27:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:09,802 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 285 transitions. [2018-10-10 16:27:09,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:27:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 285 transitions. [2018-10-10 16:27:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-10 16:27:09,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:09,804 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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:09,804 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:09,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:09,804 INFO L82 PathProgramCache]: Analyzing trace with hash -722306286, now seen corresponding path program 11 times [2018-10-10 16:27:09,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 472 proven. 421 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-10 16:27:10,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:10,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:27:10,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:27:10,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:27:10,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:27:10,569 INFO L87 Difference]: Start difference. First operand 283 states and 285 transitions. Second operand 16 states. [2018-10-10 16:27:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:12,282 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2018-10-10 16:27:12,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:27:12,283 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 282 [2018-10-10 16:27:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:12,285 INFO L225 Difference]: With dead ends: 309 [2018-10-10 16:27:12,285 INFO L226 Difference]: Without dead ends: 309 [2018-10-10 16:27:12,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:27:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-10 16:27:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-10-10 16:27:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-10 16:27:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 311 transitions. [2018-10-10 16:27:12,291 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 311 transitions. Word has length 282 [2018-10-10 16:27:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:12,292 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 311 transitions. [2018-10-10 16:27:12,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:27:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 311 transitions. [2018-10-10 16:27:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-10 16:27:12,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:12,294 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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:12,294 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:12,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:12,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2048379614, now seen corresponding path program 12 times [2018-10-10 16:27:12,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 0 proven. 543 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-10-10 16:27:13,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:13,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:27:13,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:27:13,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:27:13,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:27:13,266 INFO L87 Difference]: Start difference. First operand 309 states and 311 transitions. Second operand 16 states. [2018-10-10 16:27:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:14,469 INFO L93 Difference]: Finished difference Result 370 states and 374 transitions. [2018-10-10 16:27:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 16:27:14,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 297 [2018-10-10 16:27:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:14,473 INFO L225 Difference]: With dead ends: 370 [2018-10-10 16:27:14,473 INFO L226 Difference]: Without dead ends: 370 [2018-10-10 16:27:14,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:27:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-10 16:27:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 313. [2018-10-10 16:27:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-10 16:27:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 315 transitions. [2018-10-10 16:27:14,480 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 315 transitions. Word has length 297 [2018-10-10 16:27:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:14,480 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 315 transitions. [2018-10-10 16:27:14,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:27:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 315 transitions. [2018-10-10 16:27:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-10 16:27:14,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:14,483 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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:14,483 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:14,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 947232578, now seen corresponding path program 13 times [2018-10-10 16:27:14,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-10-10 16:27:15,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:15,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:27:15,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:27:15,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:27:15,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:27:15,078 INFO L87 Difference]: Start difference. First operand 313 states and 315 transitions. Second operand 19 states. [2018-10-10 16:27:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:16,979 INFO L93 Difference]: Finished difference Result 419 states and 425 transitions. [2018-10-10 16:27:16,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:27:16,980 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 312 [2018-10-10 16:27:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:16,983 INFO L225 Difference]: With dead ends: 419 [2018-10-10 16:27:16,984 INFO L226 Difference]: Without dead ends: 419 [2018-10-10 16:27:16,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=536, Invalid=1186, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:27:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-10 16:27:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 328. [2018-10-10 16:27:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-10 16:27:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 331 transitions. [2018-10-10 16:27:16,991 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 331 transitions. Word has length 312 [2018-10-10 16:27:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:16,991 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 331 transitions. [2018-10-10 16:27:16,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:27:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 331 transitions. [2018-10-10 16:27:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-10 16:27:16,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:16,994 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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:16,995 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:16,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash 308457762, now seen corresponding path program 14 times [2018-10-10 16:27:16,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 0 proven. 1268 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2018-10-10 16:27:17,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:17,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:27:17,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:27:17,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:27:17,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:27:17,929 INFO L87 Difference]: Start difference. First operand 328 states and 331 transitions. Second operand 19 states. [2018-10-10 16:27:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:20,323 INFO L93 Difference]: Finished difference Result 459 states and 464 transitions. [2018-10-10 16:27:20,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:27:20,323 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 327 [2018-10-10 16:27:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:20,327 INFO L225 Difference]: With dead ends: 459 [2018-10-10 16:27:20,328 INFO L226 Difference]: Without dead ends: 459 [2018-10-10 16:27:20,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=902, Invalid=2290, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 16:27:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-10 16:27:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 413. [2018-10-10 16:27:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-10-10 16:27:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 417 transitions. [2018-10-10 16:27:20,336 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 417 transitions. Word has length 327 [2018-10-10 16:27:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:20,337 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 417 transitions. [2018-10-10 16:27:20,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:27:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 417 transitions. [2018-10-10 16:27:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-10 16:27:20,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:20,340 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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:20,340 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:20,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:20,340 INFO L82 PathProgramCache]: Analyzing trace with hash -845668438, now seen corresponding path program 15 times [2018-10-10 16:27:20,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 1363 proven. 950 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-10-10 16:27:22,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:22,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:27:22,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:27:22,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:27:22,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:27:22,069 INFO L87 Difference]: Start difference. First operand 413 states and 417 transitions. Second operand 20 states. [2018-10-10 16:27:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:22,947 INFO L93 Difference]: Finished difference Result 428 states and 431 transitions. [2018-10-10 16:27:22,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:27:22,948 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 412 [2018-10-10 16:27:22,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:22,951 INFO L225 Difference]: With dead ends: 428 [2018-10-10 16:27:22,951 INFO L226 Difference]: Without dead ends: 428 [2018-10-10 16:27:22,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:27:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-10 16:27:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2018-10-10 16:27:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-10 16:27:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 431 transitions. [2018-10-10 16:27:22,959 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 431 transitions. Word has length 412 [2018-10-10 16:27:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:22,960 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 431 transitions. [2018-10-10 16:27:22,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:27:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 431 transitions. [2018-10-10 16:27:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-10 16:27:22,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:22,963 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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:22,963 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:22,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1226129014, now seen corresponding path program 16 times [2018-10-10 16:27:22,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2457 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-10-10 16:27:24,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:24,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:27:24,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:27:24,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:27:24,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:27:24,050 INFO L87 Difference]: Start difference. First operand 428 states and 431 transitions. Second operand 21 states. [2018-10-10 16:27:24,693 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-10 16:27:25,248 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-10 16:27:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:28,235 INFO L93 Difference]: Finished difference Result 559 states and 563 transitions. [2018-10-10 16:27:28,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 16:27:28,235 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 427 [2018-10-10 16:27:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:28,239 INFO L225 Difference]: With dead ends: 559 [2018-10-10 16:27:28,239 INFO L226 Difference]: Without dead ends: 559 [2018-10-10 16:27:28,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1215, Invalid=3207, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 16:27:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-10 16:27:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 528. [2018-10-10 16:27:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-10 16:27:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 532 transitions. [2018-10-10 16:27:28,247 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 532 transitions. Word has length 427 [2018-10-10 16:27:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:28,248 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 532 transitions. [2018-10-10 16:27:28,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:27:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 532 transitions. [2018-10-10 16:27:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-10 16:27:28,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:28,252 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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:28,252 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:28,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:28,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1489075698, now seen corresponding path program 17 times [2018-10-10 16:27:28,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4680 backedges. 57 proven. 4056 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2018-10-10 16:27:29,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:29,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:27:29,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:27:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:27:29,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:27:29,411 INFO L87 Difference]: Start difference. First operand 528 states and 532 transitions. Second operand 25 states. [2018-10-10 16:27:31,079 WARN L178 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-10 16:27:32,733 WARN L178 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-10 16:27:33,423 WARN L178 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-10 16:27:34,038 WARN L178 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-10 16:27:34,769 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-10 16:27:35,374 WARN L178 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-10 16:27:36,014 WARN L178 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-10 16:27:38,195 WARN L178 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-10 16:27:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:41,323 INFO L93 Difference]: Finished difference Result 659 states and 664 transitions. [2018-10-10 16:27:41,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-10 16:27:41,324 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 527 [2018-10-10 16:27:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:41,328 INFO L225 Difference]: With dead ends: 659 [2018-10-10 16:27:41,328 INFO L226 Difference]: Without dead ends: 659 [2018-10-10 16:27:41,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5351 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3460, Invalid=11546, Unknown=0, NotChecked=0, Total=15006 [2018-10-10 16:27:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-10-10 16:27:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 628. [2018-10-10 16:27:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-10 16:27:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 633 transitions. [2018-10-10 16:27:41,341 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 633 transitions. Word has length 527 [2018-10-10 16:27:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:41,342 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 633 transitions. [2018-10-10 16:27:41,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:27:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 633 transitions. [2018-10-10 16:27:41,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-10-10 16:27:41,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:41,346 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 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:41,347 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:41,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 262202970, now seen corresponding path program 18 times [2018-10-10 16:27:41,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 2173 refuted. 0 times theorem prover too weak. 4671 trivial. 0 not checked. [2018-10-10 16:27:43,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:43,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:27:43,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:27:43,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:27:43,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:27:43,737 INFO L87 Difference]: Start difference. First operand 628 states and 633 transitions. Second operand 20 states. [2018-10-10 16:27:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:45,779 INFO L93 Difference]: Finished difference Result 1002 states and 1018 transitions. [2018-10-10 16:27:45,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 16:27:45,780 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 627 [2018-10-10 16:27:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:45,785 INFO L225 Difference]: With dead ends: 1002 [2018-10-10 16:27:45,785 INFO L226 Difference]: Without dead ends: 1002 [2018-10-10 16:27:45,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=368, Invalid=1524, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:27:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-10-10 16:27:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 643. [2018-10-10 16:27:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-10-10 16:27:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 649 transitions. [2018-10-10 16:27:45,796 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 649 transitions. Word has length 627 [2018-10-10 16:27:45,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:45,797 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 649 transitions. [2018-10-10 16:27:45,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:27:45,797 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 649 transitions. [2018-10-10 16:27:45,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2018-10-10 16:27:45,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:45,803 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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:45,803 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:45,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash 973952778, now seen corresponding path program 19 times [2018-10-10 16:27:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7290 backedges. 0 proven. 6511 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2018-10-10 16:27:47,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:47,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:27:47,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:27:47,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:27:47,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:27:47,560 INFO L87 Difference]: Start difference. First operand 643 states and 649 transitions. Second operand 27 states. [2018-10-10 16:27:53,932 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-10 16:27:55,388 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-10 16:27:56,879 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-10-10 16:27:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:57,326 INFO L93 Difference]: Finished difference Result 789 states and 797 transitions. [2018-10-10 16:27:57,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-10 16:27:57,330 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 642 [2018-10-10 16:27:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:57,333 INFO L225 Difference]: With dead ends: 789 [2018-10-10 16:27:57,333 INFO L226 Difference]: Without dead ends: 789 [2018-10-10 16:27:57,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8050 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=4346, Invalid=17410, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 16:27:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-10 16:27:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 743. [2018-10-10 16:27:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-10-10 16:27:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 750 transitions. [2018-10-10 16:27:57,349 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 750 transitions. Word has length 642 [2018-10-10 16:27:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:57,350 INFO L481 AbstractCegarLoop]: Abstraction has 743 states and 750 transitions. [2018-10-10 16:27:57,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:27:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 750 transitions. [2018-10-10 16:27:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2018-10-10 16:27:57,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:57,356 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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:27:57,357 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:57,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1413290590, now seen corresponding path program 20 times [2018-10-10 16:27:57,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 6190 proven. 2871 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2018-10-10 16:27:58,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:58,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:27:58,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:27:58,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:27:58,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:27:58,862 INFO L87 Difference]: Start difference. First operand 743 states and 750 transitions. Second operand 28 states. [2018-10-10 16:28:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:00,289 INFO L93 Difference]: Finished difference Result 780 states and 786 transitions. [2018-10-10 16:28:00,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:28:00,290 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 742 [2018-10-10 16:28:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:00,294 INFO L225 Difference]: With dead ends: 780 [2018-10-10 16:28:00,295 INFO L226 Difference]: Without dead ends: 780 [2018-10-10 16:28:00,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=663, Invalid=2759, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:28:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-10-10 16:28:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 758. [2018-10-10 16:28:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-10-10 16:28:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 764 transitions. [2018-10-10 16:28:00,303 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 764 transitions. Word has length 742 [2018-10-10 16:28:00,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:00,304 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 764 transitions. [2018-10-10 16:28:00,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:28:00,304 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 764 transitions. [2018-10-10 16:28:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2018-10-10 16:28:00,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:00,310 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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:00,310 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:00,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1609033998, now seen corresponding path program 21 times [2018-10-10 16:28:00,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10477 backedges. 71 proven. 9391 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-10-10 16:28:02,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:02,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:28:02,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:28:02,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:28:02,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:28:02,286 INFO L87 Difference]: Start difference. First operand 758 states and 764 transitions. Second operand 29 states. [2018-10-10 16:28:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:11,914 INFO L93 Difference]: Finished difference Result 904 states and 911 transitions. [2018-10-10 16:28:11,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-10 16:28:11,915 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 757 [2018-10-10 16:28:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:11,920 INFO L225 Difference]: With dead ends: 904 [2018-10-10 16:28:11,920 INFO L226 Difference]: Without dead ends: 904 [2018-10-10 16:28:11,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9614 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=5464, Invalid=19658, Unknown=0, NotChecked=0, Total=25122 [2018-10-10 16:28:11,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-10-10 16:28:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 873. [2018-10-10 16:28:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-10-10 16:28:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 880 transitions. [2018-10-10 16:28:11,932 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 880 transitions. Word has length 757 [2018-10-10 16:28:11,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:11,933 INFO L481 AbstractCegarLoop]: Abstraction has 873 states and 880 transitions. [2018-10-10 16:28:11,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:28:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 880 transitions. [2018-10-10 16:28:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2018-10-10 16:28:11,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:11,942 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 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:11,942 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:11,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:11,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1501699594, now seen corresponding path program 22 times [2018-10-10 16:28:11,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14241 backedges. 9217 proven. 3313 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-10-10 16:28:13,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:13,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:28:13,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:28:13,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:28:13,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:28:13,214 INFO L87 Difference]: Start difference. First operand 873 states and 880 transitions. Second operand 30 states. [2018-10-10 16:28:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:14,928 INFO L93 Difference]: Finished difference Result 955 states and 962 transitions. [2018-10-10 16:28:14,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:28:14,929 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 872 [2018-10-10 16:28:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:14,932 INFO L225 Difference]: With dead ends: 955 [2018-10-10 16:28:14,932 INFO L226 Difference]: Without dead ends: 955 [2018-10-10 16:28:14,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=786, Invalid=3246, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:28:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-10-10 16:28:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 914. [2018-10-10 16:28:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-10-10 16:28:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 921 transitions. [2018-10-10 16:28:14,942 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 921 transitions. Word has length 872 [2018-10-10 16:28:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:14,943 INFO L481 AbstractCegarLoop]: Abstraction has 914 states and 921 transitions. [2018-10-10 16:28:14,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:28:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 921 transitions. [2018-10-10 16:28:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2018-10-10 16:28:14,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:14,951 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 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:14,952 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:14,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:14,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1003316678, now seen corresponding path program 23 times [2018-10-10 16:28:14,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15542 backedges. 9875 proven. 3770 refuted. 0 times theorem prover too weak. 1897 trivial. 0 not checked. [2018-10-10 16:28:16,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:16,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:28:16,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:28:16,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:28:16,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:28:16,489 INFO L87 Difference]: Start difference. First operand 914 states and 921 transitions. Second operand 32 states. [2018-10-10 16:28:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:18,848 INFO L93 Difference]: Finished difference Result 961 states and 968 transitions. [2018-10-10 16:28:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:28:18,848 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 902 [2018-10-10 16:28:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:18,852 INFO L225 Difference]: With dead ends: 961 [2018-10-10 16:28:18,852 INFO L226 Difference]: Without dead ends: 961 [2018-10-10 16:28:18,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1077, Invalid=4473, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 16:28:18,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-10-10 16:28:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-10-10 16:28:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-10-10 16:28:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 967 transitions. [2018-10-10 16:28:18,864 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 967 transitions. Word has length 902 [2018-10-10 16:28:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:18,864 INFO L481 AbstractCegarLoop]: Abstraction has 959 states and 967 transitions. [2018-10-10 16:28:18,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:28:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 967 transitions. [2018-10-10 16:28:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2018-10-10 16:28:18,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:18,873 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 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:18,873 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:18,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash 415491082, now seen corresponding path program 24 times [2018-10-10 16:28:18,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16903 backedges. 10096 proven. 5500 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2018-10-10 16:28:20,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:20,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:28:20,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:28:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:28:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:28:20,218 INFO L87 Difference]: Start difference. First operand 959 states and 967 transitions. Second operand 36 states. [2018-10-10 16:28:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:23,407 INFO L93 Difference]: Finished difference Result 993 states and 1000 transitions. [2018-10-10 16:28:23,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 16:28:23,408 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 932 [2018-10-10 16:28:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:23,412 INFO L225 Difference]: With dead ends: 993 [2018-10-10 16:28:23,412 INFO L226 Difference]: Without dead ends: 993 [2018-10-10 16:28:23,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1378, Invalid=5762, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 16:28:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-10-10 16:28:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 989. [2018-10-10 16:28:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2018-10-10 16:28:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 998 transitions. [2018-10-10 16:28:23,423 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 998 transitions. Word has length 932 [2018-10-10 16:28:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:23,424 INFO L481 AbstractCegarLoop]: Abstraction has 989 states and 998 transitions. [2018-10-10 16:28:23,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:28:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 998 transitions. [2018-10-10 16:28:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2018-10-10 16:28:23,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:23,433 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 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:23,433 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:23,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash -260211830, now seen corresponding path program 25 times [2018-10-10 16:28:23,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 17606 backedges. 9525 proven. 1723 refuted. 0 times theorem prover too weak. 6358 trivial. 0 not checked. [2018-10-10 16:28:24,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:24,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:28:24,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:28:24,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:28:24,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:28:24,615 INFO L87 Difference]: Start difference. First operand 989 states and 998 transitions. Second operand 24 states. [2018-10-10 16:28:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:26,028 INFO L93 Difference]: Finished difference Result 1019 states and 1028 transitions. [2018-10-10 16:28:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 16:28:26,028 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 947 [2018-10-10 16:28:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:26,031 INFO L225 Difference]: With dead ends: 1019 [2018-10-10 16:28:26,032 INFO L226 Difference]: Without dead ends: 1019 [2018-10-10 16:28:26,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:28:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-10-10 16:28:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2018-10-10 16:28:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2018-10-10 16:28:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1028 transitions. [2018-10-10 16:28:26,042 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1028 transitions. Word has length 947 [2018-10-10 16:28:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:26,043 INFO L481 AbstractCegarLoop]: Abstraction has 1019 states and 1028 transitions. [2018-10-10 16:28:26,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:28:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1028 transitions. [2018-10-10 16:28:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2018-10-10 16:28:26,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:26,052 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 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:26,052 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:26,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:26,053 INFO L82 PathProgramCache]: Analyzing trace with hash -465859654, now seen corresponding path program 26 times [2018-10-10 16:28:26,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 19057 backedges. 0 proven. 4452 refuted. 0 times theorem prover too weak. 14605 trivial. 0 not checked. [2018-10-10 16:28:28,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:28,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:28:28,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:28:28,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:28:28,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:28:28,581 INFO L87 Difference]: Start difference. First operand 1019 states and 1028 transitions. Second operand 23 states. [2018-10-10 16:28:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:31,145 INFO L93 Difference]: Finished difference Result 1435 states and 1454 transitions. [2018-10-10 16:28:31,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 16:28:31,146 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 977 [2018-10-10 16:28:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:31,152 INFO L225 Difference]: With dead ends: 1435 [2018-10-10 16:28:31,152 INFO L226 Difference]: Without dead ends: 1435 [2018-10-10 16:28:31,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=859, Invalid=2003, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:28:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2018-10-10 16:28:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1019. [2018-10-10 16:28:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2018-10-10 16:28:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1027 transitions. [2018-10-10 16:28:31,164 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1027 transitions. Word has length 977 [2018-10-10 16:28:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:31,165 INFO L481 AbstractCegarLoop]: Abstraction has 1019 states and 1027 transitions. [2018-10-10 16:28:31,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:28:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1027 transitions. [2018-10-10 16:28:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 993 [2018-10-10 16:28:31,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:31,174 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 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:31,175 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:31,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:31,175 INFO L82 PathProgramCache]: Analyzing trace with hash -119061078, now seen corresponding path program 27 times [2018-10-10 16:28:31,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19805 backedges. 0 proven. 17730 refuted. 0 times theorem prover too weak. 2075 trivial. 0 not checked. [2018-10-10 16:28:34,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:34,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:28:34,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:28:34,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:28:34,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:28:34,120 INFO L87 Difference]: Start difference. First operand 1019 states and 1027 transitions. Second operand 29 states. [2018-10-10 16:28:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:39,645 INFO L93 Difference]: Finished difference Result 1206 states and 1215 transitions. [2018-10-10 16:28:39,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 16:28:39,646 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 992 [2018-10-10 16:28:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:39,652 INFO L225 Difference]: With dead ends: 1206 [2018-10-10 16:28:39,652 INFO L226 Difference]: Without dead ends: 1206 [2018-10-10 16:28:39,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2907, Invalid=8435, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 16:28:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-10-10 16:28:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1179. [2018-10-10 16:28:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2018-10-10 16:28:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1188 transitions. [2018-10-10 16:28:39,665 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1188 transitions. Word has length 992 [2018-10-10 16:28:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:39,666 INFO L481 AbstractCegarLoop]: Abstraction has 1179 states and 1188 transitions. [2018-10-10 16:28:39,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:28:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1188 transitions. [2018-10-10 16:28:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1153 [2018-10-10 16:28:39,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:39,679 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 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:39,679 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:39,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:39,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1271138322, now seen corresponding path program 28 times [2018-10-10 16:28:39,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 27481 backedges. 15817 proven. 2785 refuted. 0 times theorem prover too weak. 8879 trivial. 0 not checked. [2018-10-10 16:28:41,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:41,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:28:41,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:28:41,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:28:41,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:28:41,016 INFO L87 Difference]: Start difference. First operand 1179 states and 1188 transitions. Second operand 28 states. [2018-10-10 16:28:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:42,776 INFO L93 Difference]: Finished difference Result 1194 states and 1203 transitions. [2018-10-10 16:28:42,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:28:42,777 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1152 [2018-10-10 16:28:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:42,780 INFO L225 Difference]: With dead ends: 1194 [2018-10-10 16:28:42,780 INFO L226 Difference]: Without dead ends: 1194 [2018-10-10 16:28:42,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=814, Invalid=3346, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 16:28:42,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-10-10 16:28:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2018-10-10 16:28:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2018-10-10 16:28:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1203 transitions. [2018-10-10 16:28:42,790 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1203 transitions. Word has length 1152 [2018-10-10 16:28:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:42,791 INFO L481 AbstractCegarLoop]: Abstraction has 1194 states and 1203 transitions. [2018-10-10 16:28:42,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:28:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1203 transitions. [2018-10-10 16:28:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1168 [2018-10-10 16:28:42,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:42,803 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 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:42,803 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:42,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:42,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1643975694, now seen corresponding path program 29 times [2018-10-10 16:28:42,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 28380 backedges. 18031 proven. 8155 refuted. 0 times theorem prover too weak. 2194 trivial. 0 not checked. [2018-10-10 16:28:44,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:44,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:28:44,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:28:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:28:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1351, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:28:44,781 INFO L87 Difference]: Start difference. First operand 1194 states and 1203 transitions. Second operand 40 states. [2018-10-10 16:28:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:48,156 INFO L93 Difference]: Finished difference Result 1228 states and 1236 transitions. [2018-10-10 16:28:48,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 16:28:48,156 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1167 [2018-10-10 16:28:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:48,160 INFO L225 Difference]: With dead ends: 1228 [2018-10-10 16:28:48,160 INFO L226 Difference]: Without dead ends: 1228 [2018-10-10 16:28:48,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1717, Invalid=7213, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 16:28:48,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-10-10 16:28:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1224. [2018-10-10 16:28:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2018-10-10 16:28:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1234 transitions. [2018-10-10 16:28:48,171 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1234 transitions. Word has length 1167 [2018-10-10 16:28:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:48,172 INFO L481 AbstractCegarLoop]: Abstraction has 1224 states and 1234 transitions. [2018-10-10 16:28:48,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:28:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1234 transitions. [2018-10-10 16:28:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1183 [2018-10-10 16:28:48,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:48,185 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 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:48,185 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:48,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash 997904450, now seen corresponding path program 30 times [2018-10-10 16:28:48,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 29294 backedges. 85 proven. 26443 refuted. 0 times theorem prover too weak. 2766 trivial. 0 not checked. [2018-10-10 16:28:52,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:52,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 16:28:52,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 16:28:52,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 16:28:52,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:28:52,171 INFO L87 Difference]: Start difference. First operand 1224 states and 1234 transitions. Second operand 33 states. [2018-10-10 16:28:58,966 WARN L178 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-10 16:29:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:05,367 INFO L93 Difference]: Finished difference Result 1426 states and 1437 transitions. [2018-10-10 16:29:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-10 16:29:05,375 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1182 [2018-10-10 16:29:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:05,380 INFO L225 Difference]: With dead ends: 1426 [2018-10-10 16:29:05,380 INFO L226 Difference]: Without dead ends: 1426 [2018-10-10 16:29:05,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15113 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=7900, Invalid=29930, Unknown=0, NotChecked=0, Total=37830 [2018-10-10 16:29:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2018-10-10 16:29:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1399. [2018-10-10 16:29:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2018-10-10 16:29:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1410 transitions. [2018-10-10 16:29:05,394 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1410 transitions. Word has length 1182 [2018-10-10 16:29:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:05,395 INFO L481 AbstractCegarLoop]: Abstraction has 1399 states and 1410 transitions. [2018-10-10 16:29:05,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 16:29:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1410 transitions. [2018-10-10 16:29:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1358 [2018-10-10 16:29:05,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:05,410 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 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:29:05,410 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:05,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:05,410 INFO L82 PathProgramCache]: Analyzing trace with hash 355123850, now seen corresponding path program 31 times [2018-10-10 16:29:05,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 39565 backedges. 0 proven. 7540 refuted. 0 times theorem prover too weak. 32025 trivial. 0 not checked. [2018-10-10 16:29:09,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:09,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:29:09,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:29:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:29:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:29:09,534 INFO L87 Difference]: Start difference. First operand 1399 states and 1410 transitions. Second operand 24 states. [2018-10-10 16:29:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:12,478 INFO L93 Difference]: Finished difference Result 1961 states and 1986 transitions. [2018-10-10 16:29:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:29:12,479 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1357 [2018-10-10 16:29:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:12,486 INFO L225 Difference]: With dead ends: 1961 [2018-10-10 16:29:12,486 INFO L226 Difference]: Without dead ends: 1961 [2018-10-10 16:29:12,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=466, Invalid=2396, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:29:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-10-10 16:29:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1399. [2018-10-10 16:29:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2018-10-10 16:29:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1409 transitions. [2018-10-10 16:29:12,499 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1409 transitions. Word has length 1357 [2018-10-10 16:29:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:12,500 INFO L481 AbstractCegarLoop]: Abstraction has 1399 states and 1409 transitions. [2018-10-10 16:29:12,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:29:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1409 transitions. [2018-10-10 16:29:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1373 [2018-10-10 16:29:12,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:12,510 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 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:29:12,510 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:12,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash -144075558, now seen corresponding path program 32 times [2018-10-10 16:29:12,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 40645 backedges. 99 proven. 37003 refuted. 0 times theorem prover too weak. 3543 trivial. 0 not checked. [2018-10-10 16:29:17,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:17,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:29:17,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:29:17,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:29:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:29:17,746 INFO L87 Difference]: Start difference. First operand 1399 states and 1409 transitions. Second operand 35 states. [2018-10-10 16:29:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:32,436 INFO L93 Difference]: Finished difference Result 1601 states and 1612 transitions. [2018-10-10 16:29:32,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-10 16:29:32,437 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1372 [2018-10-10 16:29:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:32,444 INFO L225 Difference]: With dead ends: 1601 [2018-10-10 16:29:32,444 INFO L226 Difference]: Without dead ends: 1601 [2018-10-10 16:29:32,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18326 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=9280, Invalid=35876, Unknown=0, NotChecked=0, Total=45156 [2018-10-10 16:29:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2018-10-10 16:29:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1574. [2018-10-10 16:29:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2018-10-10 16:29:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 1585 transitions. [2018-10-10 16:29:32,458 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 1585 transitions. Word has length 1372 [2018-10-10 16:29:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:32,459 INFO L481 AbstractCegarLoop]: Abstraction has 1574 states and 1585 transitions. [2018-10-10 16:29:32,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:29:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1585 transitions. [2018-10-10 16:29:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1548 [2018-10-10 16:29:32,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:32,473 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 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:29:32,473 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:32,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash -206653150, now seen corresponding path program 33 times [2018-10-10 16:29:32,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 52612 backedges. 36832 proven. 10823 refuted. 0 times theorem prover too weak. 4957 trivial. 0 not checked. [2018-10-10 16:29:35,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:35,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:29:35,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:29:35,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:29:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:29:35,589 INFO L87 Difference]: Start difference. First operand 1574 states and 1585 transitions. Second operand 44 states. [2018-10-10 16:29:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:39,891 INFO L93 Difference]: Finished difference Result 1623 states and 1633 transitions. [2018-10-10 16:29:39,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 16:29:39,892 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1547 [2018-10-10 16:29:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:39,897 INFO L225 Difference]: With dead ends: 1623 [2018-10-10 16:29:39,897 INFO L226 Difference]: Without dead ends: 1623 [2018-10-10 16:29:39,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2433 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2094, Invalid=8826, Unknown=0, NotChecked=0, Total=10920 [2018-10-10 16:29:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2018-10-10 16:29:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1619. [2018-10-10 16:29:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1619 states. [2018-10-10 16:29:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 1631 transitions. [2018-10-10 16:29:39,909 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 1631 transitions. Word has length 1547 [2018-10-10 16:29:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:39,910 INFO L481 AbstractCegarLoop]: Abstraction has 1619 states and 1631 transitions. [2018-10-10 16:29:39,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:29:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 1631 transitions. [2018-10-10 16:29:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1578 [2018-10-10 16:29:39,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:39,924 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 85, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 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:29:39,924 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:39,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1313743022, now seen corresponding path program 34 times [2018-10-10 16:29:39,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 55119 backedges. 99 proven. 50490 refuted. 0 times theorem prover too weak. 4530 trivial. 0 not checked. [2018-10-10 16:29:46,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:46,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:29:46,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:29:46,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:29:46,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:29:46,473 INFO L87 Difference]: Start difference. First operand 1619 states and 1631 transitions. Second operand 37 states. [2018-10-10 16:30:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:02,902 INFO L93 Difference]: Finished difference Result 1836 states and 1849 transitions. [2018-10-10 16:30:02,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-10 16:30:02,909 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1577 [2018-10-10 16:30:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:02,915 INFO L225 Difference]: With dead ends: 1836 [2018-10-10 16:30:02,915 INFO L226 Difference]: Without dead ends: 1836 [2018-10-10 16:30:02,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21848 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=10768, Invalid=42362, Unknown=0, NotChecked=0, Total=53130 [2018-10-10 16:30:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2018-10-10 16:30:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1809. [2018-10-10 16:30:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2018-10-10 16:30:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 1822 transitions. [2018-10-10 16:30:02,932 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 1822 transitions. Word has length 1577 [2018-10-10 16:30:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:02,933 INFO L481 AbstractCegarLoop]: Abstraction has 1809 states and 1822 transitions. [2018-10-10 16:30:02,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:30:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 1822 transitions. [2018-10-10 16:30:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1768 [2018-10-10 16:30:02,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:02,952 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 96, 96, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 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:30:02,952 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:02,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:02,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1893181418, now seen corresponding path program 35 times [2018-10-10 16:30:02,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 70360 backedges. 50286 proven. 14005 refuted. 0 times theorem prover too weak. 6069 trivial. 0 not checked. [2018-10-10 16:30:06,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:06,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:30:06,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:30:06,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:30:06,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1959, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:30:06,167 INFO L87 Difference]: Start difference. First operand 1809 states and 1822 transitions. Second operand 48 states. [2018-10-10 16:30:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:11,241 INFO L93 Difference]: Finished difference Result 1860 states and 1871 transitions. [2018-10-10 16:30:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 16:30:11,242 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1767 [2018-10-10 16:30:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:11,250 INFO L225 Difference]: With dead ends: 1860 [2018-10-10 16:30:11,250 INFO L226 Difference]: Without dead ends: 1860 [2018-10-10 16:30:11,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2959 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2509, Invalid=10601, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 16:30:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2018-10-10 16:30:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1854. [2018-10-10 16:30:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2018-10-10 16:30:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 1868 transitions. [2018-10-10 16:30:11,264 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 1868 transitions. Word has length 1767 [2018-10-10 16:30:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:11,264 INFO L481 AbstractCegarLoop]: Abstraction has 1854 states and 1868 transitions. [2018-10-10 16:30:11,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:30:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 1868 transitions. [2018-10-10 16:30:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1798 [2018-10-10 16:30:11,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:11,283 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 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:30:11,283 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:11,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:11,283 INFO L82 PathProgramCache]: Analyzing trace with hash -26396230, now seen corresponding path program 36 times [2018-10-10 16:30:11,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 73259 backedges. 99 proven. 67462 refuted. 0 times theorem prover too weak. 5698 trivial. 0 not checked. [2018-10-10 16:30:19,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:19,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:30:19,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:30:19,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:30:19,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:30:19,118 INFO L87 Difference]: Start difference. First operand 1854 states and 1868 transitions. Second operand 39 states. [2018-10-10 16:30:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:37,807 INFO L93 Difference]: Finished difference Result 2086 states and 2101 transitions. [2018-10-10 16:30:37,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-10-10 16:30:37,807 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1797 [2018-10-10 16:30:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:37,815 INFO L225 Difference]: With dead ends: 2086 [2018-10-10 16:30:37,816 INFO L226 Difference]: Without dead ends: 2086 [2018-10-10 16:30:37,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25679 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=12364, Invalid=49388, Unknown=0, NotChecked=0, Total=61752 [2018-10-10 16:30:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2018-10-10 16:30:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2059. [2018-10-10 16:30:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2018-10-10 16:30:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2074 transitions. [2018-10-10 16:30:37,838 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2074 transitions. Word has length 1797 [2018-10-10 16:30:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:37,839 INFO L481 AbstractCegarLoop]: Abstraction has 2059 states and 2074 transitions. [2018-10-10 16:30:37,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:30:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2074 transitions. [2018-10-10 16:30:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2003 [2018-10-10 16:30:37,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:37,862 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 110, 110, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 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:30:37,863 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:37,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1895798338, now seen corresponding path program 37 times [2018-10-10 16:30:37,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 92332 backedges. 99 proven. 85533 refuted. 0 times theorem prover too weak. 6700 trivial. 0 not checked. [2018-10-10 16:30:47,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:47,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 16:30:47,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 16:30:47,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 16:30:47,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1385, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:30:47,412 INFO L87 Difference]: Start difference. First operand 2059 states and 2074 transitions. Second operand 41 states. [2018-10-10 16:31:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:07,944 INFO L93 Difference]: Finished difference Result 2291 states and 2307 transitions. [2018-10-10 16:31:07,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-10-10 16:31:07,945 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 2002 [2018-10-10 16:31:07,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:07,950 INFO L225 Difference]: With dead ends: 2291 [2018-10-10 16:31:07,951 INFO L226 Difference]: Without dead ends: 2291 [2018-10-10 16:31:07,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29819 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=14068, Invalid=56954, Unknown=0, NotChecked=0, Total=71022 [2018-10-10 16:31:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2018-10-10 16:31:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2264. [2018-10-10 16:31:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2018-10-10 16:31:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2280 transitions. [2018-10-10 16:31:07,970 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2280 transitions. Word has length 2002 [2018-10-10 16:31:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:07,972 INFO L481 AbstractCegarLoop]: Abstraction has 2264 states and 2280 transitions. [2018-10-10 16:31:07,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 16:31:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2280 transitions. [2018-10-10 16:31:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2208 [2018-10-10 16:31:08,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:08,004 INFO L375 BasicCegarLoop]: trace histogram [122, 122, 122, 122, 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, 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:31:08,004 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:08,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:08,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1731630778, now seen corresponding path program 38 times [2018-10-10 16:31:08,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 113614 backedges. 0 proven. 14809 refuted. 0 times theorem prover too weak. 98805 trivial. 0 not checked. [2018-10-10 16:31:17,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:17,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:31:17,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:31:17,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:31:17,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:31:17,325 INFO L87 Difference]: Start difference. First operand 2264 states and 2280 transitions. Second operand 27 states. [2018-10-10 16:31:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:20,694 INFO L93 Difference]: Finished difference Result 3040 states and 3076 transitions. [2018-10-10 16:31:20,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:31:20,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 2207 [2018-10-10 16:31:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:20,700 INFO L225 Difference]: With dead ends: 3040 [2018-10-10 16:31:20,700 INFO L226 Difference]: Without dead ends: 3040 [2018-10-10 16:31:20,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=979, Invalid=2561, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:31:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2018-10-10 16:31:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 2264. [2018-10-10 16:31:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2018-10-10 16:31:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2279 transitions. [2018-10-10 16:31:20,720 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2279 transitions. Word has length 2207 [2018-10-10 16:31:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:20,721 INFO L481 AbstractCegarLoop]: Abstraction has 2264 states and 2279 transitions. [2018-10-10 16:31:20,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:31:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2279 transitions. [2018-10-10 16:31:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2223 [2018-10-10 16:31:20,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:20,748 INFO L375 BasicCegarLoop]: trace histogram [123, 123, 123, 123, 122, 122, 122, 122, 122, 122, 122, 122, 122, 122, 122, 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:31:20,748 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:20,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash 85252778, now seen corresponding path program 39 times [2018-10-10 16:31:20,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 115448 backedges. 0 proven. 16643 refuted. 0 times theorem prover too weak. 98805 trivial. 0 not checked. [2018-10-10 16:31:30,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:30,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:31:30,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:31:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:31:30,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:31:30,037 INFO L87 Difference]: Start difference. First operand 2264 states and 2279 transitions. Second operand 29 states. [2018-10-10 16:31:32,044 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-10-10 16:31:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:33,915 INFO L93 Difference]: Finished difference Result 3288 states and 3330 transitions. [2018-10-10 16:31:33,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:31:33,916 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 2222 [2018-10-10 16:31:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:33,922 INFO L225 Difference]: With dead ends: 3288 [2018-10-10 16:31:33,922 INFO L226 Difference]: Without dead ends: 3288 [2018-10-10 16:31:33,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1149, Invalid=3011, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 16:31:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2018-10-10 16:31:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 2264. [2018-10-10 16:31:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2018-10-10 16:31:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2278 transitions. [2018-10-10 16:31:33,946 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2278 transitions. Word has length 2222 [2018-10-10 16:31:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:33,948 INFO L481 AbstractCegarLoop]: Abstraction has 2264 states and 2278 transitions. [2018-10-10 16:31:33,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:31:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2278 transitions. [2018-10-10 16:31:33,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2238 [2018-10-10 16:31:33,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:33,986 INFO L375 BasicCegarLoop]: trace histogram [124, 124, 124, 124, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 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:31:33,987 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:33,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:33,987 INFO L82 PathProgramCache]: Analyzing trace with hash -716687174, now seen corresponding path program 40 times [2018-10-10 16:31:33,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 117297 backedges. 0 proven. 18492 refuted. 0 times theorem prover too weak. 98805 trivial. 0 not checked. [2018-10-10 16:31:43,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:43,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:31:43,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:31:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:31:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:31:43,712 INFO L87 Difference]: Start difference. First operand 2264 states and 2278 transitions. Second operand 31 states. [2018-10-10 16:31:47,541 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-10-10 16:31:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:48,247 INFO L93 Difference]: Finished difference Result 3578 states and 3627 transitions. [2018-10-10 16:31:48,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:31:48,247 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 2237 [2018-10-10 16:31:48,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:48,255 INFO L225 Difference]: With dead ends: 3578 [2018-10-10 16:31:48,255 INFO L226 Difference]: Without dead ends: 3578 [2018-10-10 16:31:48,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1333, Invalid=3497, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 16:31:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2018-10-10 16:31:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 2264. [2018-10-10 16:31:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2018-10-10 16:31:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2277 transitions. [2018-10-10 16:31:48,274 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2277 transitions. Word has length 2237 [2018-10-10 16:31:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:48,276 INFO L481 AbstractCegarLoop]: Abstraction has 2264 states and 2277 transitions. [2018-10-10 16:31:48,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:31:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2277 transitions. [2018-10-10 16:31:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2253 [2018-10-10 16:31:48,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:48,303 INFO L375 BasicCegarLoop]: trace histogram [125, 125, 125, 125, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 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:31:48,304 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:48,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:48,304 INFO L82 PathProgramCache]: Analyzing trace with hash -515180374, now seen corresponding path program 41 times [2018-10-10 16:31:48,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 119161 backedges. 0 proven. 20356 refuted. 0 times theorem prover too weak. 98805 trivial. 0 not checked. [2018-10-10 16:31:57,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:57,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 16:31:57,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 16:31:57,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 16:31:57,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:31:57,619 INFO L87 Difference]: Start difference. First operand 2264 states and 2277 transitions. Second operand 33 states. [2018-10-10 16:32:01,654 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2018-10-10 16:32:02,887 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-10 16:32:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:03,186 INFO L93 Difference]: Finished difference Result 4033 states and 4095 transitions. [2018-10-10 16:32:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 16:32:03,187 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 2252 [2018-10-10 16:32:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:03,197 INFO L225 Difference]: With dead ends: 4033 [2018-10-10 16:32:03,197 INFO L226 Difference]: Without dead ends: 4033 [2018-10-10 16:32:03,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1323, Invalid=4227, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 16:32:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2018-10-10 16:32:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 2268. [2018-10-10 16:32:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2018-10-10 16:32:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2281 transitions. [2018-10-10 16:32:03,222 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2281 transitions. Word has length 2252 [2018-10-10 16:32:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:03,223 INFO L481 AbstractCegarLoop]: Abstraction has 2268 states and 2281 transitions. [2018-10-10 16:32:03,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 16:32:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2281 transitions. [2018-10-10 16:32:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2268 [2018-10-10 16:32:03,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:03,259 INFO L375 BasicCegarLoop]: trace histogram [126, 126, 126, 126, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 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:32:03,260 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:03,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:03,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1582455482, now seen corresponding path program 42 times [2018-10-10 16:32:03,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 121040 backedges. 0 proven. 22235 refuted. 0 times theorem prover too weak. 98805 trivial. 0 not checked. [2018-10-10 16:32:13,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:13,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:32:13,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:32:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:32:13,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:32:13,228 INFO L87 Difference]: Start difference. First operand 2268 states and 2281 transitions. Second operand 35 states. [2018-10-10 16:32:16,382 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 35 [2018-10-10 16:32:16,527 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 37 [2018-10-10 16:32:17,165 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2018-10-10 16:32:17,331 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2018-10-10 16:32:17,789 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2018-10-10 16:32:17,937 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2018-10-10 16:32:18,605 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2018-10-10 16:32:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:20,119 INFO L93 Difference]: Finished difference Result 4456 states and 4531 transitions. [2018-10-10 16:32:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 16:32:20,120 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 2267 [2018-10-10 16:32:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:20,127 INFO L225 Difference]: With dead ends: 4456 [2018-10-10 16:32:20,128 INFO L226 Difference]: Without dead ends: 4456 [2018-10-10 16:32:20,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1208, Invalid=5112, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 16:32:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2018-10-10 16:32:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2283. [2018-10-10 16:32:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2283 states. [2018-10-10 16:32:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 2297 transitions. [2018-10-10 16:32:20,153 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 2297 transitions. Word has length 2267 [2018-10-10 16:32:20,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:20,155 INFO L481 AbstractCegarLoop]: Abstraction has 2283 states and 2297 transitions. [2018-10-10 16:32:20,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:32:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2297 transitions. [2018-10-10 16:32:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2283 [2018-10-10 16:32:20,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:20,192 INFO L375 BasicCegarLoop]: trace histogram [127, 127, 127, 127, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 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:32:20,192 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:20,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:20,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1115199146, now seen corresponding path program 43 times [2018-10-10 16:32:20,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 122934 backedges. 0 proven. 24129 refuted. 0 times theorem prover too weak. 98805 trivial. 0 not checked. [2018-10-10 16:32:30,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:30,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:32:30,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:32:30,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:32:30,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:32:30,351 INFO L87 Difference]: Start difference. First operand 2283 states and 2297 transitions. Second operand 36 states. [2018-10-10 16:32:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:37,601 INFO L93 Difference]: Finished difference Result 4879 states and 4967 transitions. [2018-10-10 16:32:37,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:32:37,602 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 2282 [2018-10-10 16:32:37,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:37,607 INFO L225 Difference]: With dead ends: 4879 [2018-10-10 16:32:37,608 INFO L226 Difference]: Without dead ends: 4879 [2018-10-10 16:32:37,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=760, Invalid=6212, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 16:32:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2018-10-10 16:32:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 2298. [2018-10-10 16:32:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2298 states. [2018-10-10 16:32:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 2313 transitions. [2018-10-10 16:32:37,632 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 2313 transitions. Word has length 2282 [2018-10-10 16:32:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:37,633 INFO L481 AbstractCegarLoop]: Abstraction has 2298 states and 2313 transitions. [2018-10-10 16:32:37,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:32:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2313 transitions. [2018-10-10 16:32:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2298 [2018-10-10 16:32:37,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:37,679 INFO L375 BasicCegarLoop]: trace histogram [128, 128, 128, 128, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 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:32:37,679 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:37,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash -462095174, now seen corresponding path program 44 times [2018-10-10 16:32:37,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 124843 backedges. 94111 proven. 22926 refuted. 0 times theorem prover too weak. 7806 trivial. 0 not checked. [2018-10-10 16:32:42,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:42,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 16:32:42,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 16:32:42,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 16:32:42,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2681, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 16:32:42,673 INFO L87 Difference]: Start difference. First operand 2298 states and 2313 transitions. Second operand 56 states. [2018-10-10 16:32:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:48,523 INFO L93 Difference]: Finished difference Result 2326 states and 2340 transitions. [2018-10-10 16:32:48,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 16:32:48,523 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2297 [2018-10-10 16:32:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:48,526 INFO L225 Difference]: With dead ends: 2326 [2018-10-10 16:32:48,526 INFO L226 Difference]: Without dead ends: 2326 [2018-10-10 16:32:48,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3524 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2784, Invalid=11978, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 16:32:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2018-10-10 16:32:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 2313. [2018-10-10 16:32:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2018-10-10 16:32:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2327 transitions. [2018-10-10 16:32:48,544 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2327 transitions. Word has length 2297 [2018-10-10 16:32:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:48,545 INFO L481 AbstractCegarLoop]: Abstraction has 2313 states and 2327 transitions. [2018-10-10 16:32:48,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 16:32:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2327 transitions. [2018-10-10 16:32:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2313 [2018-10-10 16:32:48,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:48,589 INFO L375 BasicCegarLoop]: trace histogram [129, 129, 129, 129, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 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:32:48,589 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:48,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:48,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1881283802, now seen corresponding path program 45 times [2018-10-10 16:32:48,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 126767 backedges. 0 proven. 26253 refuted. 0 times theorem prover too weak. 100514 trivial. 0 not checked. [2018-10-10 16:32:59,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:59,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:32:59,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:32:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:32:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:32:59,014 INFO L87 Difference]: Start difference. First operand 2313 states and 2327 transitions. Second operand 39 states. [2018-10-10 16:33:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:33:05,595 INFO L93 Difference]: Finished difference Result 5283 states and 5382 transitions. [2018-10-10 16:33:05,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 16:33:05,595 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 2312 [2018-10-10 16:33:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:33:05,601 INFO L225 Difference]: With dead ends: 5283 [2018-10-10 16:33:05,601 INFO L226 Difference]: Without dead ends: 5283 [2018-10-10 16:33:05,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2831, Invalid=7471, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 16:33:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5283 states. [2018-10-10 16:33:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5283 to 2328. [2018-10-10 16:33:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-10-10 16:33:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 2343 transitions. [2018-10-10 16:33:05,621 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 2343 transitions. Word has length 2312 [2018-10-10 16:33:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:33:05,622 INFO L481 AbstractCegarLoop]: Abstraction has 2328 states and 2343 transitions. [2018-10-10 16:33:05,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:33:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2343 transitions. [2018-10-10 16:33:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2328 [2018-10-10 16:33:05,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:33:05,651 INFO L375 BasicCegarLoop]: trace histogram [130, 130, 130, 130, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 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:33:05,651 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:33:05,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:33:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash 891834506, now seen corresponding path program 46 times [2018-10-10 16:33:05,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 128706 backedges. 0 proven. 119562 refuted. 0 times theorem prover too weak. 9144 trivial. 0 not checked. [2018-10-10 16:33:17,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:17,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 16:33:17,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 16:33:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 16:33:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1361, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:33:17,511 INFO L87 Difference]: Start difference. First operand 2328 states and 2343 transitions. Second operand 41 states. [2018-10-10 16:33:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:33:28,947 INFO L93 Difference]: Finished difference Result 2609 states and 2627 transitions. [2018-10-10 16:33:28,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-10 16:33:28,948 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 2327 [2018-10-10 16:33:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:33:28,952 INFO L225 Difference]: With dead ends: 2609 [2018-10-10 16:33:28,952 INFO L226 Difference]: Without dead ends: 2609 [2018-10-10 16:33:28,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9594 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=6765, Invalid=20957, Unknown=0, NotChecked=0, Total=27722 [2018-10-10 16:33:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2018-10-10 16:33:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2548. [2018-10-10 16:33:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2018-10-10 16:33:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 2564 transitions. [2018-10-10 16:33:28,968 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 2564 transitions. Word has length 2327 [2018-10-10 16:33:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:33:28,969 INFO L481 AbstractCegarLoop]: Abstraction has 2548 states and 2564 transitions. [2018-10-10 16:33:28,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 16:33:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 2564 transitions. [2018-10-10 16:33:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2548 [2018-10-10 16:33:29,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:33:29,005 INFO L375 BasicCegarLoop]: trace histogram [143, 143, 143, 143, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 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:33:29,005 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:33:29,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:33:29,005 INFO L82 PathProgramCache]: Analyzing trace with hash -769874190, now seen corresponding path program 47 times [2018-10-10 16:33:29,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 155780 backedges. 1261 proven. 145453 refuted. 0 times theorem prover too weak. 9066 trivial. 0 not checked. [2018-10-10 16:33:44,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:44,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 16:33:44,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 16:33:44,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 16:33:44,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2998, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:33:44,174 INFO L87 Difference]: Start difference. First operand 2548 states and 2564 transitions. Second operand 59 states. [2018-10-10 16:34:39,139 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-10 16:34:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:34:42,260 INFO L93 Difference]: Finished difference Result 3391 states and 3425 transitions. [2018-10-10 16:34:42,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 613 states. [2018-10-10 16:34:42,261 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 2547 [2018-10-10 16:34:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:34:42,265 INFO L225 Difference]: With dead ends: 3391 [2018-10-10 16:34:42,265 INFO L226 Difference]: Without dead ends: 3391 [2018-10-10 16:34:42,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223223 ImplicationChecksByTransitivity, 52.6s TimeCoverageRelationStatistics Valid=68859, Invalid=376697, Unknown=0, NotChecked=0, Total=445556 [2018-10-10 16:34:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2018-10-10 16:34:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2768. [2018-10-10 16:34:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2768 states. [2018-10-10 16:34:42,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 2785 transitions. [2018-10-10 16:34:42,296 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 2785 transitions. Word has length 2547 [2018-10-10 16:34:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:34:42,297 INFO L481 AbstractCegarLoop]: Abstraction has 2768 states and 2785 transitions. [2018-10-10 16:34:42,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 16:34:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 2785 transitions. [2018-10-10 16:34:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2768 [2018-10-10 16:34:42,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:34:42,337 INFO L375 BasicCegarLoop]: trace histogram [156, 156, 156, 156, 155, 155, 155, 155, 155, 155, 155, 155, 155, 155, 155, 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:34:42,337 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:34:42,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:34:42,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1152586074, now seen corresponding path program 48 times [2018-10-10 16:34:42,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:34:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:34:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 185440 backedges. 0 proven. 173930 refuted. 0 times theorem prover too weak. 11510 trivial. 0 not checked. [2018-10-10 16:34:59,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:34:59,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 16:34:59,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 16:34:59,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 16:34:59,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1633, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:34:59,209 INFO L87 Difference]: Start difference. First operand 2768 states and 2785 transitions. Second operand 45 states.