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/20051113-1.c_false-valid-memtrack.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 17:56:24,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 17:56:24,918 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 17:56:24,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 17:56:24,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 17:56:24,941 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 17:56:24,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 17:56:24,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 17:56:24,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 17:56:24,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 17:56:24,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 17:56:24,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 17:56:24,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 17:56:24,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 17:56:24,959 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 17:56:24,966 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 17:56:24,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 17:56:24,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 17:56:24,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 17:56:24,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 17:56:24,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 17:56:24,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 17:56:24,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 17:56:24,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 17:56:24,984 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 17:56:24,988 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 17:56:24,989 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 17:56:24,990 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 17:56:24,991 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 17:56:24,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 17:56:24,992 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 17:56:24,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 17:56:24,995 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 17:56:24,995 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 17:56:24,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 17:56:24,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 17:56:24,997 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 17:56:25,016 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 17:56:25,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 17:56:25,018 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 17:56:25,019 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 17:56:25,019 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 17:56:25,019 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 17:56:25,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 17:56:25,020 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 17:56:25,020 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 17:56:25,020 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 17:56:25,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 17:56:25,021 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 17:56:25,021 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 17:56:25,022 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 17:56:25,022 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 17:56:25,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 17:56:25,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 17:56:25,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 17:56:25,110 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 17:56:25,110 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 17:56:25,111 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_11.bpl [2018-10-14 17:56:25,111 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_11.bpl' [2018-10-14 17:56:25,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 17:56:25,181 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 17:56:25,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 17:56:25,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 17:56:25,183 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 17:56:25,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 17:56:25,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 17:56:25,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 17:56:25,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 17:56:25,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 17:56:25,319 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 17:56:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 17:56:25,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 17:56:25,885 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 17:56:25,886 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:25 BoogieIcfgContainer [2018-10-14 17:56:25,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 17:56:25,886 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 17:56:25,887 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 17:56:25,888 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 17:56:25,891 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,900 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 17:56:25,900 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 17:56:25,941 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 17:56:25,993 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 17:56:26,009 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 17:56:26,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 17:56:57,428 INFO L315 AbstractInterpreter]: Visited 62 different actions 129 times. Merged at 36 different actions 64 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-10-14 17:56:57,432 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 17:56:57,439 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 17:56:57,752 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_#memory_int_2_1_1| |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_6|) at (#memory_int := #memory_int[#Ultimate.C_memset_#ptr.base := #memory_int[#Ultimate.C_memset_#ptr.base][#Ultimate.C_memset_#t~loopctr16 + #Ultimate.C_memset_#ptr.offset := #Ultimate.C_memset_#value]];) [2018-10-14 17:56:57,915 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-14 17:56:57,917 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 17:56:57,918 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 17:56:57,918 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 17:56:57,918 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-10-14 17:56:57,919 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 17:56:57,919 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 17:56:57,919 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-14 17:56:57,919 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-14 17:56:57,920 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 17:56:57,920 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 17:56:57,920 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-10-14 17:56:57,920 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 17:56:57,920 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 17:56:57,921 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-14 17:56:57,921 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-14 17:56:57,922 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 17:56:57,947 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 05:56:57 BasicIcfg [2018-10-14 17:56:57,947 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 17:56:57,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 17:56:57,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 17:56:57,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 17:56:57,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/3) ... [2018-10-14 17:56:57,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451f4ae5 and model type 20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:56:57, skipping insertion in model container [2018-10-14 17:56:57,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:25" (2/3) ... [2018-10-14 17:56:57,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451f4ae5 and model type 20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:56:57, skipping insertion in model container [2018-10-14 17:56:57,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 05:56:57" (3/3) ... [2018-10-14 17:56:57,957 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 17:56:57,968 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 17:56:57,978 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 17:56:57,997 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 17:56:58,032 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 17:56:58,033 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 17:56:58,033 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 17:56:58,034 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 17:56:58,034 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 17:56:58,035 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 17:56:58,035 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 17:56:58,035 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 17:56:58,036 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 17:56:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-10-14 17:56:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-14 17:56:58,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:56:58,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:56:58,067 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:56:58,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:56:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2026755485, now seen corresponding path program 1 times [2018-10-14 17:56:58,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:56:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:56:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:56:58,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 17:56:58,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-14 17:56:58,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 17:56:58,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 17:56:58,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 17:56:58,476 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 4 states. [2018-10-14 17:56:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:56:58,556 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-14 17:56:58,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 17:56:58,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-10-14 17:56:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:56:58,637 INFO L225 Difference]: With dead ends: 63 [2018-10-14 17:56:58,637 INFO L226 Difference]: Without dead ends: 63 [2018-10-14 17:56:58,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 17:56:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-14 17:56:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-10-14 17:56:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-14 17:56:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-14 17:56:58,683 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-10-14 17:56:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:56:58,683 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-14 17:56:58,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 17:56:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-14 17:56:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-14 17:56:58,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:56:58,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:56:58,686 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:56:58,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:56:58,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1137298621, now seen corresponding path program 1 times [2018-10-14 17:56:58,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:56:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:56:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:56:59,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:56:59,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 17:56:59,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 17:56:59,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 17:56:59,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-14 17:56:59,021 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2018-10-14 17:56:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:56:59,358 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-14 17:56:59,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-14 17:56:59,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-10-14 17:56:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:56:59,360 INFO L225 Difference]: With dead ends: 66 [2018-10-14 17:56:59,360 INFO L226 Difference]: Without dead ends: 66 [2018-10-14 17:56:59,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-14 17:56:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-14 17:56:59,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-14 17:56:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-14 17:56:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-14 17:56:59,372 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-10-14 17:56:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:56:59,374 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-14 17:56:59,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 17:56:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-14 17:56:59,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-14 17:56:59,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:56:59,378 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:56:59,379 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:56:59,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:56:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1018887779, now seen corresponding path program 2 times [2018-10-14 17:56:59,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:56:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:56:59,656 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-14 17:56:59,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:56:59,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-14 17:56:59,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 17:56:59,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 17:56:59,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-14 17:56:59,658 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 6 states. [2018-10-14 17:56:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:56:59,951 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-14 17:56:59,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 17:56:59,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-10-14 17:56:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:56:59,954 INFO L225 Difference]: With dead ends: 69 [2018-10-14 17:56:59,954 INFO L226 Difference]: Without dead ends: 69 [2018-10-14 17:56:59,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-14 17:56:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-14 17:56:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-14 17:56:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-14 17:56:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-14 17:56:59,961 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2018-10-14 17:56:59,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:56:59,962 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-14 17:56:59,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 17:56:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-14 17:56:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-14 17:56:59,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:56:59,964 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:56:59,964 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:56:59,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:56:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash -437051203, now seen corresponding path program 3 times [2018-10-14 17:56:59,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:56:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:00,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:00,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 17:57:00,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 17:57:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 17:57:00,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 17:57:00,171 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 7 states. [2018-10-14 17:57:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:00,304 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-14 17:57:00,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-14 17:57:00,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-10-14 17:57:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:00,306 INFO L225 Difference]: With dead ends: 72 [2018-10-14 17:57:00,306 INFO L226 Difference]: Without dead ends: 72 [2018-10-14 17:57:00,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 17:57:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-14 17:57:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-10-14 17:57:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-14 17:57:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-14 17:57:00,313 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2018-10-14 17:57:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:00,313 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-14 17:57:00,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 17:57:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-14 17:57:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-14 17:57:00,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:00,315 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:00,315 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:00,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1431622243, now seen corresponding path program 4 times [2018-10-14 17:57:00,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:00,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:00,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 17:57:00,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 17:57:00,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 17:57:00,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-14 17:57:00,492 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 8 states. [2018-10-14 17:57:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:00,981 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-14 17:57:00,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 17:57:00,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-10-14 17:57:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:00,983 INFO L225 Difference]: With dead ends: 75 [2018-10-14 17:57:00,983 INFO L226 Difference]: Without dead ends: 75 [2018-10-14 17:57:00,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-14 17:57:00,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-14 17:57:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-10-14 17:57:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-14 17:57:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-14 17:57:00,989 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2018-10-14 17:57:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:00,990 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-14 17:57:00,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 17:57:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-14 17:57:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-14 17:57:00,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:00,991 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:00,992 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:00,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:00,992 INFO L82 PathProgramCache]: Analyzing trace with hash 281900221, now seen corresponding path program 5 times [2018-10-14 17:57:00,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:01,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:01,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 17:57:01,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 17:57:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 17:57:01,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-14 17:57:01,163 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 9 states. [2018-10-14 17:57:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:01,299 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-14 17:57:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 17:57:01,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-10-14 17:57:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:01,308 INFO L225 Difference]: With dead ends: 78 [2018-10-14 17:57:01,308 INFO L226 Difference]: Without dead ends: 78 [2018-10-14 17:57:01,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-14 17:57:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-14 17:57:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-10-14 17:57:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 17:57:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-14 17:57:01,324 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2018-10-14 17:57:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:01,324 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-14 17:57:01,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 17:57:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-14 17:57:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-14 17:57:01,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:01,326 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:01,326 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:01,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2143312285, now seen corresponding path program 6 times [2018-10-14 17:57:01,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:01,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:01,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 17:57:01,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 17:57:01,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 17:57:01,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 17:57:01,542 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 10 states. [2018-10-14 17:57:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:01,697 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-14 17:57:01,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 17:57:01,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-10-14 17:57:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:01,700 INFO L225 Difference]: With dead ends: 81 [2018-10-14 17:57:01,700 INFO L226 Difference]: Without dead ends: 81 [2018-10-14 17:57:01,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-14 17:57:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-14 17:57:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-10-14 17:57:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-14 17:57:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-14 17:57:01,706 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-10-14 17:57:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:01,706 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-14 17:57:01,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 17:57:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-14 17:57:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-14 17:57:01,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:01,708 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:01,708 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:01,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:01,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1147615043, now seen corresponding path program 7 times [2018-10-14 17:57:01,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:01,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:01,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 17:57:01,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 17:57:01,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 17:57:01,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-14 17:57:01,969 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 11 states. [2018-10-14 17:57:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:02,142 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-14 17:57:02,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 17:57:02,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-10-14 17:57:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:02,146 INFO L225 Difference]: With dead ends: 84 [2018-10-14 17:57:02,146 INFO L226 Difference]: Without dead ends: 84 [2018-10-14 17:57:02,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-14 17:57:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-14 17:57:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-10-14 17:57:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-14 17:57:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-14 17:57:02,152 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2018-10-14 17:57:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:02,153 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-14 17:57:02,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 17:57:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-14 17:57:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-14 17:57:02,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:02,154 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:02,155 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:02,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:02,155 INFO L82 PathProgramCache]: Analyzing trace with hash 54822301, now seen corresponding path program 8 times [2018-10-14 17:57:02,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:02,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:02,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 17:57:02,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 17:57:02,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 17:57:02,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-14 17:57:02,390 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 12 states. [2018-10-14 17:57:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:02,574 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-14 17:57:02,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 17:57:02,580 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2018-10-14 17:57:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:02,581 INFO L225 Difference]: With dead ends: 87 [2018-10-14 17:57:02,581 INFO L226 Difference]: Without dead ends: 87 [2018-10-14 17:57:02,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-14 17:57:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-14 17:57:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-14 17:57:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-14 17:57:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-14 17:57:02,594 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-10-14 17:57:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:02,594 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-14 17:57:02,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 17:57:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-14 17:57:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-14 17:57:02,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:02,596 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:02,596 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:02,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1838488765, now seen corresponding path program 9 times [2018-10-14 17:57:02,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:02,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:02,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 17:57:02,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 17:57:02,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 17:57:02,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-14 17:57:02,817 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 13 states. [2018-10-14 17:57:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:03,045 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-14 17:57:03,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 17:57:03,053 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2018-10-14 17:57:03,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:03,054 INFO L225 Difference]: With dead ends: 90 [2018-10-14 17:57:03,054 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 17:57:03,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-14 17:57:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 17:57:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-14 17:57:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-14 17:57:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-14 17:57:03,065 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-10-14 17:57:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:03,066 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-14 17:57:03,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 17:57:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-14 17:57:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-14 17:57:03,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:03,069 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:03,069 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:03,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:03,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1710731677, now seen corresponding path program 10 times [2018-10-14 17:57:03,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:03,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:03,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 17:57:03,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 17:57:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 17:57:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-14 17:57:03,396 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 14 states. [2018-10-14 17:57:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:03,669 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-14 17:57:03,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-14 17:57:03,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2018-10-14 17:57:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:03,671 INFO L225 Difference]: With dead ends: 93 [2018-10-14 17:57:03,671 INFO L226 Difference]: Without dead ends: 93 [2018-10-14 17:57:03,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-14 17:57:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-14 17:57:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-14 17:57:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-14 17:57:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-14 17:57:03,675 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-10-14 17:57:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:03,676 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-14 17:57:03,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 17:57:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-14 17:57:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-14 17:57:03,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:03,677 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:03,677 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:03,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:03,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1040347325, now seen corresponding path program 11 times [2018-10-14 17:57:03,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:05,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:05,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 17:57:05,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 17:57:05,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 17:57:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-14 17:57:05,004 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 15 states. [2018-10-14 17:57:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:05,257 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-14 17:57:05,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 17:57:05,264 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2018-10-14 17:57:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:05,265 INFO L225 Difference]: With dead ends: 96 [2018-10-14 17:57:05,265 INFO L226 Difference]: Without dead ends: 96 [2018-10-14 17:57:05,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-14 17:57:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-14 17:57:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-14 17:57:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-14 17:57:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-14 17:57:05,276 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-10-14 17:57:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:05,276 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-14 17:57:05,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 17:57:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-14 17:57:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-14 17:57:05,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:05,278 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:05,279 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:05,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:05,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1218043293, now seen corresponding path program 12 times [2018-10-14 17:57:05,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:05,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:05,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 17:57:05,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 17:57:05,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 17:57:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-14 17:57:05,648 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 16 states. [2018-10-14 17:57:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:05,886 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-14 17:57:05,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 17:57:05,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2018-10-14 17:57:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:05,887 INFO L225 Difference]: With dead ends: 99 [2018-10-14 17:57:05,887 INFO L226 Difference]: Without dead ends: 99 [2018-10-14 17:57:05,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-14 17:57:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-14 17:57:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-14 17:57:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-14 17:57:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-14 17:57:05,891 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-10-14 17:57:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:05,891 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-14 17:57:05,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 17:57:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-14 17:57:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-14 17:57:05,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:05,892 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:05,892 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:05,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash -736049987, now seen corresponding path program 13 times [2018-10-14 17:57:05,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:06,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:06,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 17:57:06,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 17:57:06,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 17:57:06,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-14 17:57:06,353 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 17 states. [2018-10-14 17:57:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:06,827 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-14 17:57:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 17:57:06,827 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-10-14 17:57:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:06,828 INFO L225 Difference]: With dead ends: 102 [2018-10-14 17:57:06,829 INFO L226 Difference]: Without dead ends: 102 [2018-10-14 17:57:06,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-14 17:57:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-14 17:57:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-14 17:57:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-14 17:57:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-14 17:57:06,833 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-10-14 17:57:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:06,833 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-14 17:57:06,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 17:57:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-14 17:57:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-14 17:57:06,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:06,834 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:06,835 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:06,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1142224483, now seen corresponding path program 14 times [2018-10-14 17:57:06,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:07,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:07,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 17:57:07,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 17:57:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 17:57:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-14 17:57:07,182 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 18 states. [2018-10-14 17:57:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:07,478 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-14 17:57:07,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 17:57:07,479 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-10-14 17:57:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:07,480 INFO L225 Difference]: With dead ends: 105 [2018-10-14 17:57:07,480 INFO L226 Difference]: Without dead ends: 105 [2018-10-14 17:57:07,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-14 17:57:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-14 17:57:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-14 17:57:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-14 17:57:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-14 17:57:07,485 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-10-14 17:57:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:07,485 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-14 17:57:07,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 17:57:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-14 17:57:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-14 17:57:07,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:07,486 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:07,486 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:07,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:07,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1731205309, now seen corresponding path program 15 times [2018-10-14 17:57:07,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:08,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:08,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 17:57:08,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 17:57:08,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 17:57:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-14 17:57:08,627 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 19 states. [2018-10-14 17:57:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:09,019 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-14 17:57:09,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-14 17:57:09,019 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2018-10-14 17:57:09,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:09,021 INFO L225 Difference]: With dead ends: 108 [2018-10-14 17:57:09,021 INFO L226 Difference]: Without dead ends: 108 [2018-10-14 17:57:09,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 17:57:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-14 17:57:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-14 17:57:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-14 17:57:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-14 17:57:09,025 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-14 17:57:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:09,025 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-14 17:57:09,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 17:57:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-14 17:57:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-14 17:57:09,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:09,026 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:09,027 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:09,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:09,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1084962205, now seen corresponding path program 16 times [2018-10-14 17:57:09,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:09,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 17:57:09,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 17:57:09,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 17:57:09,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-14 17:57:09,572 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 20 states. [2018-10-14 17:57:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:09,934 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-14 17:57:09,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-14 17:57:09,935 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2018-10-14 17:57:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:09,936 INFO L225 Difference]: With dead ends: 111 [2018-10-14 17:57:09,936 INFO L226 Difference]: Without dead ends: 111 [2018-10-14 17:57:09,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 17:57:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-14 17:57:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-14 17:57:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-14 17:57:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-14 17:57:09,941 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-14 17:57:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:09,941 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-14 17:57:09,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 17:57:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-14 17:57:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-14 17:57:09,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:09,943 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:09,943 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:09,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1099928387, now seen corresponding path program 17 times [2018-10-14 17:57:09,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:10,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:10,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 17:57:10,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 17:57:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 17:57:10,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-14 17:57:10,293 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 21 states. [2018-10-14 17:57:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:10,712 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-14 17:57:10,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 17:57:10,713 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2018-10-14 17:57:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:10,714 INFO L225 Difference]: With dead ends: 114 [2018-10-14 17:57:10,715 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 17:57:10,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 17:57:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 17:57:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-14 17:57:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-14 17:57:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-14 17:57:10,718 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-14 17:57:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:10,719 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-14 17:57:10,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 17:57:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-14 17:57:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-14 17:57:10,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:10,720 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:10,720 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:10,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash -946183779, now seen corresponding path program 18 times [2018-10-14 17:57:10,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:11,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:11,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 17:57:11,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 17:57:11,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 17:57:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-14 17:57:11,048 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 22 states. [2018-10-14 17:57:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:11,559 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-14 17:57:11,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 17:57:11,559 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-10-14 17:57:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:11,560 INFO L225 Difference]: With dead ends: 117 [2018-10-14 17:57:11,560 INFO L226 Difference]: Without dead ends: 117 [2018-10-14 17:57:11,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 17:57:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-14 17:57:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-14 17:57:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-14 17:57:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-14 17:57:11,564 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-14 17:57:11,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:11,564 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-14 17:57:11,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 17:57:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-14 17:57:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-14 17:57:11,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:11,565 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:11,565 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:11,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:11,566 INFO L82 PathProgramCache]: Analyzing trace with hash 824295613, now seen corresponding path program 19 times [2018-10-14 17:57:11,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:12,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:12,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 17:57:12,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 17:57:12,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 17:57:12,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-14 17:57:12,172 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 23 states. [2018-10-14 17:57:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:12,622 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-14 17:57:12,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-14 17:57:12,623 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 114 [2018-10-14 17:57:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:12,624 INFO L225 Difference]: With dead ends: 120 [2018-10-14 17:57:12,625 INFO L226 Difference]: Without dead ends: 120 [2018-10-14 17:57:12,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 17:57:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-14 17:57:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-14 17:57:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-14 17:57:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-14 17:57:12,628 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-14 17:57:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:12,629 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-14 17:57:12,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 17:57:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-14 17:57:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-14 17:57:12,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:12,630 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:12,630 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:12,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1317499491, now seen corresponding path program 20 times [2018-10-14 17:57:12,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:13,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:13,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 17:57:13,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 17:57:13,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 17:57:13,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-14 17:57:13,820 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 24 states. [2018-10-14 17:57:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:14,341 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-14 17:57:14,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 17:57:14,348 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 117 [2018-10-14 17:57:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:14,349 INFO L225 Difference]: With dead ends: 123 [2018-10-14 17:57:14,349 INFO L226 Difference]: Without dead ends: 123 [2018-10-14 17:57:14,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 17:57:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-14 17:57:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-10-14 17:57:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-14 17:57:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-14 17:57:14,354 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-10-14 17:57:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:14,354 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-14 17:57:14,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 17:57:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-14 17:57:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-14 17:57:14,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:14,355 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:14,355 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:14,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1501293379, now seen corresponding path program 21 times [2018-10-14 17:57:14,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:14,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:14,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 17:57:14,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 17:57:14,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 17:57:14,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-14 17:57:14,759 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 25 states. [2018-10-14 17:57:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:15,307 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-14 17:57:15,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 17:57:15,310 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 120 [2018-10-14 17:57:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:15,310 INFO L225 Difference]: With dead ends: 126 [2018-10-14 17:57:15,310 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 17:57:15,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 17:57:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 17:57:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-10-14 17:57:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-14 17:57:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-14 17:57:15,314 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2018-10-14 17:57:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:15,314 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-14 17:57:15,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 17:57:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-14 17:57:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-14 17:57:15,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:15,315 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:15,315 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:15,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash -821708387, now seen corresponding path program 22 times [2018-10-14 17:57:15,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:15,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:15,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 17:57:15,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 17:57:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 17:57:15,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-14 17:57:15,690 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 26 states. [2018-10-14 17:57:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:16,368 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-14 17:57:16,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-14 17:57:16,369 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 123 [2018-10-14 17:57:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:16,370 INFO L225 Difference]: With dead ends: 129 [2018-10-14 17:57:16,370 INFO L226 Difference]: Without dead ends: 129 [2018-10-14 17:57:16,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 17:57:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-14 17:57:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-14 17:57:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-14 17:57:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-14 17:57:16,377 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-10-14 17:57:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:16,377 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-14 17:57:16,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 17:57:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-14 17:57:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-14 17:57:16,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:16,378 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:16,378 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:16,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1781045059, now seen corresponding path program 23 times [2018-10-14 17:57:16,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:16,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:16,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 17:57:16,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 17:57:16,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 17:57:16,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-14 17:57:16,814 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 27 states. [2018-10-14 17:57:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:17,341 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-14 17:57:17,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 17:57:17,348 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 126 [2018-10-14 17:57:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:17,349 INFO L225 Difference]: With dead ends: 132 [2018-10-14 17:57:17,349 INFO L226 Difference]: Without dead ends: 132 [2018-10-14 17:57:17,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 17:57:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-14 17:57:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-14 17:57:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-14 17:57:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-14 17:57:17,352 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-10-14 17:57:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:17,352 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-14 17:57:17,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 17:57:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-14 17:57:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-14 17:57:17,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:17,354 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:17,354 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:17,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:17,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1627514269, now seen corresponding path program 24 times [2018-10-14 17:57:17,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:17,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:17,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 17:57:17,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 17:57:17,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 17:57:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-14 17:57:17,899 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 28 states. [2018-10-14 17:57:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:18,650 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-14 17:57:18,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 17:57:18,651 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 129 [2018-10-14 17:57:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:18,652 INFO L225 Difference]: With dead ends: 135 [2018-10-14 17:57:18,652 INFO L226 Difference]: Without dead ends: 135 [2018-10-14 17:57:18,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 17:57:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-14 17:57:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-10-14 17:57:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-14 17:57:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-14 17:57:18,658 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-10-14 17:57:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:18,658 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-14 17:57:18,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 17:57:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-14 17:57:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-14 17:57:18,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:18,660 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:18,660 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:18,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:18,660 INFO L82 PathProgramCache]: Analyzing trace with hash 106675389, now seen corresponding path program 25 times [2018-10-14 17:57:18,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:19,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:19,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 17:57:19,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 17:57:19,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 17:57:19,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-14 17:57:19,195 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 29 states. [2018-10-14 17:57:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:19,867 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-14 17:57:19,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 17:57:19,867 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-10-14 17:57:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:19,868 INFO L225 Difference]: With dead ends: 138 [2018-10-14 17:57:19,868 INFO L226 Difference]: Without dead ends: 138 [2018-10-14 17:57:19,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 17:57:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-14 17:57:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-10-14 17:57:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-14 17:57:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-14 17:57:19,872 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2018-10-14 17:57:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:19,872 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-14 17:57:19,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 17:57:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-14 17:57:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-14 17:57:19,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:19,873 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:19,874 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:19,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:19,874 INFO L82 PathProgramCache]: Analyzing trace with hash 405606813, now seen corresponding path program 26 times [2018-10-14 17:57:19,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:20,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:20,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 17:57:20,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 17:57:20,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 17:57:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-14 17:57:20,330 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 30 states. [2018-10-14 17:57:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:20,978 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-14 17:57:20,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 17:57:20,978 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 135 [2018-10-14 17:57:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:20,979 INFO L225 Difference]: With dead ends: 141 [2018-10-14 17:57:20,980 INFO L226 Difference]: Without dead ends: 141 [2018-10-14 17:57:20,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 17:57:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-14 17:57:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-14 17:57:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-14 17:57:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-14 17:57:20,987 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2018-10-14 17:57:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:20,987 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-14 17:57:20,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 17:57:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-14 17:57:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-14 17:57:20,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:20,988 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:20,989 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:20,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:20,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1890512707, now seen corresponding path program 27 times [2018-10-14 17:57:20,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:21,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:21,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 17:57:21,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 17:57:21,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 17:57:21,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-14 17:57:21,514 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 31 states. [2018-10-14 17:57:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:22,238 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-14 17:57:22,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 17:57:22,239 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 138 [2018-10-14 17:57:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:22,240 INFO L225 Difference]: With dead ends: 144 [2018-10-14 17:57:22,240 INFO L226 Difference]: Without dead ends: 144 [2018-10-14 17:57:22,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 17:57:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-14 17:57:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-10-14 17:57:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-14 17:57:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-14 17:57:22,244 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2018-10-14 17:57:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:22,244 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-14 17:57:22,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 17:57:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-14 17:57:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-14 17:57:22,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:22,245 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:22,246 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:22,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:22,246 INFO L82 PathProgramCache]: Analyzing trace with hash 356990365, now seen corresponding path program 28 times [2018-10-14 17:57:22,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:22,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:22,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 17:57:22,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 17:57:22,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 17:57:22,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-14 17:57:22,798 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 32 states. [2018-10-14 17:57:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:23,788 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-14 17:57:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 17:57:23,788 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 141 [2018-10-14 17:57:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:23,789 INFO L225 Difference]: With dead ends: 147 [2018-10-14 17:57:23,789 INFO L226 Difference]: Without dead ends: 147 [2018-10-14 17:57:23,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 17:57:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-14 17:57:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-10-14 17:57:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-14 17:57:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-14 17:57:23,794 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2018-10-14 17:57:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:23,794 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-14 17:57:23,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 17:57:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-14 17:57:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-14 17:57:23,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:23,795 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:23,795 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:23,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1475830973, now seen corresponding path program 29 times [2018-10-14 17:57:23,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:25,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:25,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 17:57:25,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 17:57:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 17:57:25,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 17:57:25,059 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 33 states. [2018-10-14 17:57:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:25,920 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-14 17:57:25,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 17:57:25,920 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 144 [2018-10-14 17:57:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:25,921 INFO L225 Difference]: With dead ends: 150 [2018-10-14 17:57:25,921 INFO L226 Difference]: Without dead ends: 150 [2018-10-14 17:57:25,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 17:57:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-14 17:57:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-14 17:57:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-14 17:57:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-14 17:57:25,926 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2018-10-14 17:57:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:25,926 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-14 17:57:25,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 17:57:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-14 17:57:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-14 17:57:25,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:25,927 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:25,927 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:25,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash -384800355, now seen corresponding path program 30 times [2018-10-14 17:57:25,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:26,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:26,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 17:57:26,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 17:57:26,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 17:57:26,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 17:57:26,669 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 34 states. [2018-10-14 17:57:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:28,303 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-14 17:57:28,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 17:57:28,303 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 147 [2018-10-14 17:57:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:28,304 INFO L225 Difference]: With dead ends: 153 [2018-10-14 17:57:28,304 INFO L226 Difference]: Without dead ends: 153 [2018-10-14 17:57:28,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 17:57:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-14 17:57:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-10-14 17:57:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-14 17:57:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-14 17:57:28,309 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2018-10-14 17:57:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:28,309 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-14 17:57:28,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 17:57:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-14 17:57:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-14 17:57:28,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:28,310 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:28,311 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:28,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:28,311 INFO L82 PathProgramCache]: Analyzing trace with hash 395229373, now seen corresponding path program 31 times [2018-10-14 17:57:28,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:29,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:29,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 17:57:29,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 17:57:29,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 17:57:29,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 17:57:29,046 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 35 states. [2018-10-14 17:57:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:30,177 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-14 17:57:30,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 17:57:30,177 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 150 [2018-10-14 17:57:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:30,178 INFO L225 Difference]: With dead ends: 156 [2018-10-14 17:57:30,178 INFO L226 Difference]: Without dead ends: 156 [2018-10-14 17:57:30,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 17:57:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-14 17:57:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-10-14 17:57:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-14 17:57:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-10-14 17:57:30,182 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2018-10-14 17:57:30,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:30,182 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-10-14 17:57:30,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 17:57:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-10-14 17:57:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-14 17:57:30,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:30,184 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:30,184 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:30,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:30,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1807182435, now seen corresponding path program 32 times [2018-10-14 17:57:30,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:30,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:30,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 17:57:30,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 17:57:30,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 17:57:30,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 17:57:30,972 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 36 states. [2018-10-14 17:57:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:31,878 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-14 17:57:31,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 17:57:31,878 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 153 [2018-10-14 17:57:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:31,880 INFO L225 Difference]: With dead ends: 159 [2018-10-14 17:57:31,880 INFO L226 Difference]: Without dead ends: 159 [2018-10-14 17:57:31,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 17:57:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-14 17:57:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-10-14 17:57:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-14 17:57:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-14 17:57:31,884 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2018-10-14 17:57:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:31,884 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-14 17:57:31,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 17:57:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-14 17:57:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-14 17:57:31,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:31,885 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:31,886 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:31,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash 358026429, now seen corresponding path program 33 times [2018-10-14 17:57:31,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:32,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:32,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 17:57:32,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 17:57:32,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 17:57:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 17:57:32,634 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 37 states. [2018-10-14 17:57:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:33,838 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-14 17:57:33,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 17:57:33,838 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 156 [2018-10-14 17:57:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:33,839 INFO L225 Difference]: With dead ends: 162 [2018-10-14 17:57:33,839 INFO L226 Difference]: Without dead ends: 162 [2018-10-14 17:57:33,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 17:57:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-14 17:57:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-10-14 17:57:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-14 17:57:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-14 17:57:33,843 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2018-10-14 17:57:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:33,843 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-14 17:57:33,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 17:57:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-14 17:57:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-14 17:57:33,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:33,845 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:33,845 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:33,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2018524771, now seen corresponding path program 34 times [2018-10-14 17:57:33,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:34,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:34,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 17:57:34,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 17:57:34,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 17:57:34,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 17:57:34,737 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 38 states. [2018-10-14 17:57:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:35,859 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-14 17:57:35,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 17:57:35,859 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 159 [2018-10-14 17:57:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:35,860 INFO L225 Difference]: With dead ends: 165 [2018-10-14 17:57:35,860 INFO L226 Difference]: Without dead ends: 165 [2018-10-14 17:57:35,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 17:57:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-14 17:57:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-10-14 17:57:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-14 17:57:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-14 17:57:35,864 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2018-10-14 17:57:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:35,864 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-14 17:57:35,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 17:57:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-14 17:57:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-14 17:57:35,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:35,865 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:35,866 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:35,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash 680550589, now seen corresponding path program 35 times [2018-10-14 17:57:35,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:36,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:36,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 17:57:36,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 17:57:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 17:57:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 17:57:36,947 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 39 states. [2018-10-14 17:57:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:38,015 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-10-14 17:57:38,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 17:57:38,015 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 162 [2018-10-14 17:57:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:38,016 INFO L225 Difference]: With dead ends: 168 [2018-10-14 17:57:38,016 INFO L226 Difference]: Without dead ends: 168 [2018-10-14 17:57:38,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 17:57:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-14 17:57:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-10-14 17:57:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-14 17:57:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-14 17:57:38,019 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2018-10-14 17:57:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:38,019 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-14 17:57:38,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 17:57:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-14 17:57:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-14 17:57:38,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:38,020 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:38,021 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:38,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:38,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1543115363, now seen corresponding path program 36 times [2018-10-14 17:57:38,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:39,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:39,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 17:57:39,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 17:57:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 17:57:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 17:57:39,278 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 40 states. [2018-10-14 17:57:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:40,326 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-14 17:57:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 17:57:40,326 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 165 [2018-10-14 17:57:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:40,327 INFO L225 Difference]: With dead ends: 171 [2018-10-14 17:57:40,327 INFO L226 Difference]: Without dead ends: 171 [2018-10-14 17:57:40,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 17:57:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-14 17:57:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2018-10-14 17:57:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-14 17:57:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-14 17:57:40,331 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2018-10-14 17:57:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:40,331 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-14 17:57:40,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 17:57:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-14 17:57:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-14 17:57:40,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:40,333 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:40,333 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:40,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1199917891, now seen corresponding path program 37 times [2018-10-14 17:57:40,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:41,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:41,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 17:57:41,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 17:57:41,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 17:57:41,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 17:57:41,265 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 41 states. [2018-10-14 17:57:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:42,403 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-14 17:57:42,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-14 17:57:42,403 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 168 [2018-10-14 17:57:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:42,404 INFO L225 Difference]: With dead ends: 174 [2018-10-14 17:57:42,404 INFO L226 Difference]: Without dead ends: 174 [2018-10-14 17:57:42,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 17:57:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-14 17:57:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-10-14 17:57:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-14 17:57:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-14 17:57:42,410 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2018-10-14 17:57:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:42,410 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-14 17:57:42,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 17:57:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-14 17:57:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-14 17:57:42,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:42,411 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:42,412 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:42,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:42,412 INFO L82 PathProgramCache]: Analyzing trace with hash 973805981, now seen corresponding path program 38 times [2018-10-14 17:57:42,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:43,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:43,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 17:57:43,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 17:57:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 17:57:43,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 17:57:43,260 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 42 states. [2018-10-14 17:57:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:45,567 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-14 17:57:45,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 17:57:45,567 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 171 [2018-10-14 17:57:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:45,568 INFO L225 Difference]: With dead ends: 177 [2018-10-14 17:57:45,568 INFO L226 Difference]: Without dead ends: 177 [2018-10-14 17:57:45,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 17:57:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-14 17:57:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-14 17:57:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-14 17:57:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-14 17:57:45,572 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2018-10-14 17:57:45,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:45,573 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-14 17:57:45,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 17:57:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-14 17:57:45,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-14 17:57:45,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:45,574 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:45,574 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:45,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1135212355, now seen corresponding path program 39 times [2018-10-14 17:57:45,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:46,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:46,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 17:57:46,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 17:57:46,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 17:57:46,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 17:57:46,499 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 43 states. [2018-10-14 17:57:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:47,877 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-14 17:57:47,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 17:57:47,877 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 174 [2018-10-14 17:57:47,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:47,878 INFO L225 Difference]: With dead ends: 180 [2018-10-14 17:57:47,878 INFO L226 Difference]: Without dead ends: 180 [2018-10-14 17:57:47,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 17:57:47,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-14 17:57:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2018-10-14 17:57:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-14 17:57:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-10-14 17:57:47,882 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2018-10-14 17:57:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:47,882 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-10-14 17:57:47,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 17:57:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-10-14 17:57:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-14 17:57:47,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:47,884 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:47,884 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:47,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:47,884 INFO L82 PathProgramCache]: Analyzing trace with hash 176113053, now seen corresponding path program 40 times [2018-10-14 17:57:47,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:48,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:48,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 17:57:48,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 17:57:48,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 17:57:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 17:57:48,885 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 44 states. [2018-10-14 17:57:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:50,375 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-14 17:57:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-14 17:57:50,377 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 177 [2018-10-14 17:57:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:50,378 INFO L225 Difference]: With dead ends: 183 [2018-10-14 17:57:50,378 INFO L226 Difference]: Without dead ends: 183 [2018-10-14 17:57:50,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 17:57:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-14 17:57:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2018-10-14 17:57:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-14 17:57:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-14 17:57:50,382 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2018-10-14 17:57:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:50,382 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-14 17:57:50,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 17:57:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-14 17:57:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-14 17:57:50,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:50,383 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:50,383 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:50,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:50,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1151181635, now seen corresponding path program 41 times [2018-10-14 17:57:50,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:51,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:51,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 17:57:51,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 17:57:51,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 17:57:51,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 17:57:51,917 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 45 states. [2018-10-14 17:57:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:53,163 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-14 17:57:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 17:57:53,164 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 180 [2018-10-14 17:57:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:53,165 INFO L225 Difference]: With dead ends: 186 [2018-10-14 17:57:53,165 INFO L226 Difference]: Without dead ends: 186 [2018-10-14 17:57:53,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 17:57:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-14 17:57:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-10-14 17:57:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-14 17:57:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-10-14 17:57:53,168 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2018-10-14 17:57:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:53,168 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-10-14 17:57:53,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 17:57:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-10-14 17:57:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-14 17:57:53,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:53,169 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:53,169 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:53,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1176662429, now seen corresponding path program 42 times [2018-10-14 17:57:53,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:54,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:54,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 17:57:54,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 17:57:54,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 17:57:54,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 17:57:54,883 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 46 states. [2018-10-14 17:57:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:56,520 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-14 17:57:56,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 17:57:56,520 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 183 [2018-10-14 17:57:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:56,521 INFO L225 Difference]: With dead ends: 189 [2018-10-14 17:57:56,521 INFO L226 Difference]: Without dead ends: 189 [2018-10-14 17:57:56,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 17:57:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-14 17:57:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-10-14 17:57:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-14 17:57:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-14 17:57:56,524 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2018-10-14 17:57:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:56,525 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-14 17:57:56,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 17:57:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-14 17:57:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-14 17:57:56,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:56,525 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:56,526 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:56,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:56,526 INFO L82 PathProgramCache]: Analyzing trace with hash -857755459, now seen corresponding path program 43 times [2018-10-14 17:57:56,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:57:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:57:57,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:57:57,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 17:57:57,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 17:57:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 17:57:57,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 17:57:57,894 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 47 states. [2018-10-14 17:57:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:57:59,453 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-14 17:57:59,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-14 17:57:59,453 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 186 [2018-10-14 17:57:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:57:59,454 INFO L225 Difference]: With dead ends: 192 [2018-10-14 17:57:59,454 INFO L226 Difference]: Without dead ends: 192 [2018-10-14 17:57:59,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 17:57:59,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-14 17:57:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-10-14 17:57:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-14 17:57:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-14 17:57:59,458 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2018-10-14 17:57:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:57:59,458 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-14 17:57:59,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 17:57:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-14 17:57:59,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-14 17:57:59,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:57:59,460 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:57:59,460 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:57:59,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:57:59,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1917543011, now seen corresponding path program 44 times [2018-10-14 17:57:59,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:57:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:00,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:00,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 17:58:00,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 17:58:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 17:58:00,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 17:58:00,543 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 48 states. [2018-10-14 17:58:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:02,142 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-14 17:58:02,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 17:58:02,143 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 189 [2018-10-14 17:58:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:02,144 INFO L225 Difference]: With dead ends: 195 [2018-10-14 17:58:02,144 INFO L226 Difference]: Without dead ends: 195 [2018-10-14 17:58:02,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 17:58:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-14 17:58:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-10-14 17:58:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-14 17:58:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-14 17:58:02,148 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2018-10-14 17:58:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:02,148 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-14 17:58:02,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 17:58:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-14 17:58:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-14 17:58:02,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:02,150 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:02,150 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:02,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1743911747, now seen corresponding path program 45 times [2018-10-14 17:58:02,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:03,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:03,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 17:58:03,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 17:58:03,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 17:58:03,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 17:58:03,287 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 49 states. [2018-10-14 17:58:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:05,102 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-14 17:58:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 17:58:05,102 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 192 [2018-10-14 17:58:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:05,103 INFO L225 Difference]: With dead ends: 198 [2018-10-14 17:58:05,103 INFO L226 Difference]: Without dead ends: 198 [2018-10-14 17:58:05,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 17:58:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-14 17:58:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-10-14 17:58:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-14 17:58:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-14 17:58:05,105 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2018-10-14 17:58:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:05,106 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-14 17:58:05,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 17:58:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-14 17:58:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-14 17:58:05,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:05,107 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:05,107 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:05,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash -235550307, now seen corresponding path program 46 times [2018-10-14 17:58:05,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:06,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:06,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 17:58:06,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 17:58:06,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 17:58:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 17:58:06,803 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 50 states. [2018-10-14 17:58:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:08,383 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-14 17:58:08,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 17:58:08,384 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 195 [2018-10-14 17:58:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:08,385 INFO L225 Difference]: With dead ends: 201 [2018-10-14 17:58:08,385 INFO L226 Difference]: Without dead ends: 201 [2018-10-14 17:58:08,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-14 17:58:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-14 17:58:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-10-14 17:58:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-14 17:58:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-14 17:58:08,388 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2018-10-14 17:58:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:08,388 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-14 17:58:08,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 17:58:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-14 17:58:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-14 17:58:08,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:08,389 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:08,389 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:08,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:08,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1412257981, now seen corresponding path program 47 times [2018-10-14 17:58:08,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:09,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:09,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 17:58:09,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 17:58:09,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 17:58:09,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 17:58:09,802 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 51 states. [2018-10-14 17:58:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:11,517 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-14 17:58:11,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 17:58:11,517 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-10-14 17:58:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:11,518 INFO L225 Difference]: With dead ends: 204 [2018-10-14 17:58:11,518 INFO L226 Difference]: Without dead ends: 204 [2018-10-14 17:58:11,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-14 17:58:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-14 17:58:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2018-10-14 17:58:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-14 17:58:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-10-14 17:58:11,522 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2018-10-14 17:58:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:11,522 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-10-14 17:58:11,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 17:58:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-10-14 17:58:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-14 17:58:11,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:11,523 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:11,523 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:11,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash -207227491, now seen corresponding path program 48 times [2018-10-14 17:58:11,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:12,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:12,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 17:58:12,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 17:58:12,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 17:58:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 17:58:12,793 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 52 states. [2018-10-14 17:58:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:14,723 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-14 17:58:14,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 17:58:14,724 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 201 [2018-10-14 17:58:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:14,725 INFO L225 Difference]: With dead ends: 207 [2018-10-14 17:58:14,725 INFO L226 Difference]: Without dead ends: 207 [2018-10-14 17:58:14,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-14 17:58:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-14 17:58:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-10-14 17:58:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-14 17:58:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-14 17:58:14,729 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2018-10-14 17:58:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:14,729 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-14 17:58:14,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 17:58:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-14 17:58:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-14 17:58:14,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:14,730 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:14,731 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:14,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:14,731 INFO L82 PathProgramCache]: Analyzing trace with hash -931287875, now seen corresponding path program 49 times [2018-10-14 17:58:14,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:15,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:15,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 17:58:15,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 17:58:15,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 17:58:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 17:58:15,941 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 53 states. [2018-10-14 17:58:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:17,801 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-10-14 17:58:17,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 17:58:17,802 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2018-10-14 17:58:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:17,802 INFO L225 Difference]: With dead ends: 210 [2018-10-14 17:58:17,803 INFO L226 Difference]: Without dead ends: 210 [2018-10-14 17:58:17,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-14 17:58:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-14 17:58:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-10-14 17:58:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-14 17:58:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-10-14 17:58:17,807 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2018-10-14 17:58:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:17,808 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-10-14 17:58:17,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 17:58:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-10-14 17:58:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-14 17:58:17,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:17,809 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:17,809 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:17,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2088427107, now seen corresponding path program 50 times [2018-10-14 17:58:17,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:19,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:19,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 17:58:19,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 17:58:19,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 17:58:19,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 17:58:19,161 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 54 states. [2018-10-14 17:58:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:21,023 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-10-14 17:58:21,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 17:58:21,024 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 207 [2018-10-14 17:58:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:21,025 INFO L225 Difference]: With dead ends: 213 [2018-10-14 17:58:21,025 INFO L226 Difference]: Without dead ends: 213 [2018-10-14 17:58:21,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-14 17:58:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-14 17:58:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2018-10-14 17:58:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-14 17:58:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-14 17:58:21,028 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2018-10-14 17:58:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:21,029 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-14 17:58:21,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 17:58:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-14 17:58:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-14 17:58:21,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:21,030 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:21,030 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:21,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1279197373, now seen corresponding path program 51 times [2018-10-14 17:58:21,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:22,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:22,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 17:58:22,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 17:58:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 17:58:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 17:58:22,401 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 55 states. [2018-10-14 17:58:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:24,391 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-14 17:58:24,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 17:58:24,391 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 210 [2018-10-14 17:58:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:24,392 INFO L225 Difference]: With dead ends: 216 [2018-10-14 17:58:24,392 INFO L226 Difference]: Without dead ends: 216 [2018-10-14 17:58:24,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-14 17:58:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-14 17:58:24,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2018-10-14 17:58:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-14 17:58:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-10-14 17:58:24,396 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2018-10-14 17:58:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:24,397 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-10-14 17:58:24,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 17:58:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-10-14 17:58:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-14 17:58:24,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:24,398 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:24,398 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:24,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 39013789, now seen corresponding path program 52 times [2018-10-14 17:58:24,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:26,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:26,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 17:58:26,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 17:58:26,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 17:58:26,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 17:58:26,161 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 56 states. [2018-10-14 17:58:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:28,082 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-14 17:58:28,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-14 17:58:28,082 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 213 [2018-10-14 17:58:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:28,084 INFO L225 Difference]: With dead ends: 219 [2018-10-14 17:58:28,084 INFO L226 Difference]: Without dead ends: 219 [2018-10-14 17:58:28,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-14 17:58:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-14 17:58:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-10-14 17:58:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-14 17:58:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-14 17:58:28,088 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2018-10-14 17:58:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:28,088 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-14 17:58:28,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 17:58:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-14 17:58:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-14 17:58:28,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:28,089 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:28,090 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:28,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:28,090 INFO L82 PathProgramCache]: Analyzing trace with hash -961456963, now seen corresponding path program 53 times [2018-10-14 17:58:28,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:29,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:29,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-14 17:58:29,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-14 17:58:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-14 17:58:29,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 17:58:29,480 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 57 states. [2018-10-14 17:58:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:31,653 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-10-14 17:58:31,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 17:58:31,653 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 216 [2018-10-14 17:58:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:31,654 INFO L225 Difference]: With dead ends: 222 [2018-10-14 17:58:31,655 INFO L226 Difference]: Without dead ends: 222 [2018-10-14 17:58:31,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-14 17:58:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-14 17:58:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-10-14 17:58:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-14 17:58:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-10-14 17:58:31,658 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2018-10-14 17:58:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:31,659 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-10-14 17:58:31,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-14 17:58:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-10-14 17:58:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-14 17:58:31,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:31,660 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:31,660 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:31,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1087404445, now seen corresponding path program 54 times [2018-10-14 17:58:31,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:33,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:33,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 17:58:33,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 17:58:33,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 17:58:33,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 17:58:33,146 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 58 states. [2018-10-14 17:58:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:35,420 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-14 17:58:35,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 17:58:35,420 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 219 [2018-10-14 17:58:35,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:35,421 INFO L225 Difference]: With dead ends: 225 [2018-10-14 17:58:35,421 INFO L226 Difference]: Without dead ends: 225 [2018-10-14 17:58:35,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-14 17:58:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-14 17:58:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2018-10-14 17:58:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-14 17:58:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-14 17:58:35,425 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2018-10-14 17:58:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:35,425 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-14 17:58:35,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 17:58:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-14 17:58:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-14 17:58:35,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:35,427 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:35,427 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:35,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:35,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1357600579, now seen corresponding path program 55 times [2018-10-14 17:58:35,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:36,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:36,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 17:58:36,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 17:58:36,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 17:58:36,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 17:58:36,907 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 59 states. [2018-10-14 17:58:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:39,134 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-10-14 17:58:39,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-14 17:58:39,135 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 222 [2018-10-14 17:58:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:39,135 INFO L225 Difference]: With dead ends: 228 [2018-10-14 17:58:39,136 INFO L226 Difference]: Without dead ends: 228 [2018-10-14 17:58:39,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-14 17:58:39,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-14 17:58:39,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2018-10-14 17:58:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-14 17:58:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-14 17:58:39,139 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2018-10-14 17:58:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:39,139 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-14 17:58:39,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 17:58:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-14 17:58:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-14 17:58:39,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:39,140 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:39,140 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:39,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2143069597, now seen corresponding path program 56 times [2018-10-14 17:58:39,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:40,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:40,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 17:58:40,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 17:58:40,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 17:58:40,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 17:58:40,814 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 60 states. [2018-10-14 17:58:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:43,131 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-14 17:58:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 17:58:43,131 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 225 [2018-10-14 17:58:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:43,132 INFO L225 Difference]: With dead ends: 231 [2018-10-14 17:58:43,132 INFO L226 Difference]: Without dead ends: 231 [2018-10-14 17:58:43,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-14 17:58:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-14 17:58:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2018-10-14 17:58:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-14 17:58:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-14 17:58:43,136 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2018-10-14 17:58:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:43,136 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-14 17:58:43,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 17:58:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-14 17:58:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-14 17:58:43,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:43,139 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:43,139 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:43,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:43,139 INFO L82 PathProgramCache]: Analyzing trace with hash 212401341, now seen corresponding path program 57 times [2018-10-14 17:58:43,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:45,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:45,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-14 17:58:45,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-14 17:58:45,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-14 17:58:45,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 17:58:45,199 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 61 states. [2018-10-14 17:58:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:47,604 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-14 17:58:47,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 17:58:47,604 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 228 [2018-10-14 17:58:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:47,605 INFO L225 Difference]: With dead ends: 234 [2018-10-14 17:58:47,605 INFO L226 Difference]: Without dead ends: 234 [2018-10-14 17:58:47,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-14 17:58:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-14 17:58:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-10-14 17:58:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-14 17:58:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-10-14 17:58:47,610 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2018-10-14 17:58:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:47,610 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-10-14 17:58:47,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-14 17:58:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-10-14 17:58:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-14 17:58:47,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:47,611 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:47,611 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:47,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:47,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1876414877, now seen corresponding path program 58 times [2018-10-14 17:58:47,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:49,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:49,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 17:58:49,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 17:58:49,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 17:58:49,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 17:58:49,232 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 62 states. [2018-10-14 17:58:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:51,693 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-10-14 17:58:51,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-14 17:58:51,693 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 231 [2018-10-14 17:58:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:51,694 INFO L225 Difference]: With dead ends: 237 [2018-10-14 17:58:51,694 INFO L226 Difference]: Without dead ends: 237 [2018-10-14 17:58:51,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-14 17:58:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-14 17:58:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-10-14 17:58:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-14 17:58:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-14 17:58:51,697 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2018-10-14 17:58:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:51,698 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-14 17:58:51,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 17:58:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-14 17:58:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-14 17:58:51,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:51,699 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:51,699 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:51,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1991135421, now seen corresponding path program 59 times [2018-10-14 17:58:51,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:53,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:53,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-14 17:58:53,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-14 17:58:53,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-14 17:58:53,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 17:58:53,395 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 63 states. [2018-10-14 17:58:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:56,036 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-10-14 17:58:56,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-14 17:58:56,036 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 234 [2018-10-14 17:58:56,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:56,037 INFO L225 Difference]: With dead ends: 240 [2018-10-14 17:58:56,037 INFO L226 Difference]: Without dead ends: 240 [2018-10-14 17:58:56,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-14 17:58:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-14 17:58:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2018-10-14 17:58:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-14 17:58:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-10-14 17:58:56,040 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2018-10-14 17:58:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:56,041 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-10-14 17:58:56,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-14 17:58:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-10-14 17:58:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-14 17:58:56,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:56,042 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:56,043 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:56,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash 836894109, now seen corresponding path program 60 times [2018-10-14 17:58:56,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:57,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:57,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 17:58:57,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 17:58:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 17:58:57,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 17:58:57,790 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 64 states. [2018-10-14 17:59:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:00,386 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-14 17:59:00,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 17:59:00,386 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 237 [2018-10-14 17:59:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:00,387 INFO L225 Difference]: With dead ends: 243 [2018-10-14 17:59:00,387 INFO L226 Difference]: Without dead ends: 243 [2018-10-14 17:59:00,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-14 17:59:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-14 17:59:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-10-14 17:59:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-14 17:59:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-14 17:59:00,391 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2018-10-14 17:59:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:00,392 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-14 17:59:00,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 17:59:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-14 17:59:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-14 17:59:00,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:00,393 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:00,393 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:00,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:00,394 INFO L82 PathProgramCache]: Analyzing trace with hash 342140093, now seen corresponding path program 61 times [2018-10-14 17:59:00,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:02,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:02,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-14 17:59:02,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-14 17:59:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-14 17:59:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 17:59:02,275 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 65 states. [2018-10-14 17:59:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:04,975 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-14 17:59:04,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-14 17:59:04,975 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 240 [2018-10-14 17:59:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:04,976 INFO L225 Difference]: With dead ends: 246 [2018-10-14 17:59:04,976 INFO L226 Difference]: Without dead ends: 246 [2018-10-14 17:59:04,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-14 17:59:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-14 17:59:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2018-10-14 17:59:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-14 17:59:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-10-14 17:59:04,980 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2018-10-14 17:59:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:04,980 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-10-14 17:59:04,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-14 17:59:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-10-14 17:59:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-14 17:59:04,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:04,982 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:04,982 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:04,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1453009309, now seen corresponding path program 62 times [2018-10-14 17:59:04,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:06,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:06,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 17:59:06,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 17:59:06,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 17:59:06,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 17:59:06,906 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 66 states. [2018-10-14 17:59:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:09,655 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-14 17:59:09,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 17:59:09,656 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 243 [2018-10-14 17:59:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:09,657 INFO L225 Difference]: With dead ends: 249 [2018-10-14 17:59:09,657 INFO L226 Difference]: Without dead ends: 249 [2018-10-14 17:59:09,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-14 17:59:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-14 17:59:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2018-10-14 17:59:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-14 17:59:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-14 17:59:09,661 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2018-10-14 17:59:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:09,661 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-14 17:59:09,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-14 17:59:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-14 17:59:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-14 17:59:09,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:09,663 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:09,663 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:09,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1660159811, now seen corresponding path program 63 times [2018-10-14 17:59:09,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:11,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:11,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 17:59:11,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 17:59:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 17:59:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 17:59:11,629 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 67 states. [2018-10-14 17:59:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:14,416 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-10-14 17:59:14,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-14 17:59:14,416 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 246 [2018-10-14 17:59:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:14,417 INFO L225 Difference]: With dead ends: 252 [2018-10-14 17:59:14,418 INFO L226 Difference]: Without dead ends: 252 [2018-10-14 17:59:14,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-14 17:59:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-14 17:59:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2018-10-14 17:59:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-14 17:59:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-10-14 17:59:14,421 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2018-10-14 17:59:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:14,422 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-10-14 17:59:14,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 17:59:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-10-14 17:59:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-14 17:59:14,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:14,423 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:14,423 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:14,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash -557623907, now seen corresponding path program 64 times [2018-10-14 17:59:14,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:16,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:16,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-14 17:59:16,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-14 17:59:16,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-14 17:59:16,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 17:59:16,751 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 68 states. [2018-10-14 17:59:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:19,665 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-14 17:59:19,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-14 17:59:19,666 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 249 [2018-10-14 17:59:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:19,667 INFO L225 Difference]: With dead ends: 255 [2018-10-14 17:59:19,667 INFO L226 Difference]: Without dead ends: 255 [2018-10-14 17:59:19,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-14 17:59:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-14 17:59:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2018-10-14 17:59:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-14 17:59:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-14 17:59:19,669 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2018-10-14 17:59:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:19,670 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-14 17:59:19,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-14 17:59:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-14 17:59:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-14 17:59:19,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:19,671 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:19,671 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:19,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1474579645, now seen corresponding path program 65 times [2018-10-14 17:59:19,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:21,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:21,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-14 17:59:21,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-14 17:59:21,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-14 17:59:21,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 17:59:21,795 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 69 states. [2018-10-14 17:59:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:24,672 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-10-14 17:59:24,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-14 17:59:24,673 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 252 [2018-10-14 17:59:24,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:24,674 INFO L225 Difference]: With dead ends: 258 [2018-10-14 17:59:24,674 INFO L226 Difference]: Without dead ends: 258 [2018-10-14 17:59:24,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-14 17:59:24,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-14 17:59:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-10-14 17:59:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-14 17:59:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-10-14 17:59:24,677 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2018-10-14 17:59:24,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:24,677 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-10-14 17:59:24,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-14 17:59:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-10-14 17:59:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-14 17:59:24,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:24,678 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:24,679 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:24,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:24,679 INFO L82 PathProgramCache]: Analyzing trace with hash 991592861, now seen corresponding path program 66 times [2018-10-14 17:59:24,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:26,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:26,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-14 17:59:26,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-14 17:59:26,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-14 17:59:26,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 17:59:26,897 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 70 states. [2018-10-14 17:59:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:29,974 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-14 17:59:29,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 17:59:29,975 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 255 [2018-10-14 17:59:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:29,976 INFO L225 Difference]: With dead ends: 261 [2018-10-14 17:59:29,976 INFO L226 Difference]: Without dead ends: 261 [2018-10-14 17:59:29,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-14 17:59:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-14 17:59:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2018-10-14 17:59:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-14 17:59:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-14 17:59:29,979 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2018-10-14 17:59:29,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:29,979 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-14 17:59:29,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-14 17:59:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-14 17:59:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-14 17:59:29,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:29,980 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:29,981 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:29,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:29,981 INFO L82 PathProgramCache]: Analyzing trace with hash 472752317, now seen corresponding path program 67 times [2018-10-14 17:59:29,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:32,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:32,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-14 17:59:32,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-14 17:59:32,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-14 17:59:32,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 17:59:32,191 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 71 states. [2018-10-14 17:59:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:35,362 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-10-14 17:59:35,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-14 17:59:35,362 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 258 [2018-10-14 17:59:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:35,363 INFO L225 Difference]: With dead ends: 264 [2018-10-14 17:59:35,363 INFO L226 Difference]: Without dead ends: 264 [2018-10-14 17:59:35,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 17:59:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-14 17:59:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-10-14 17:59:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-14 17:59:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-14 17:59:35,366 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2018-10-14 17:59:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:35,367 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-14 17:59:35,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-14 17:59:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-14 17:59:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-14 17:59:35,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:35,368 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:35,368 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:35,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1281404317, now seen corresponding path program 68 times [2018-10-14 17:59:35,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:37,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:37,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-14 17:59:37,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-14 17:59:37,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-14 17:59:37,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 17:59:37,686 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 72 states. [2018-10-14 17:59:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:40,887 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-14 17:59:40,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 17:59:40,887 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 261 [2018-10-14 17:59:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:40,888 INFO L225 Difference]: With dead ends: 267 [2018-10-14 17:59:40,888 INFO L226 Difference]: Without dead ends: 267 [2018-10-14 17:59:40,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-14 17:59:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-14 17:59:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-10-14 17:59:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-14 17:59:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-14 17:59:40,891 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2018-10-14 17:59:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:40,892 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-14 17:59:40,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-14 17:59:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-14 17:59:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-14 17:59:40,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:40,893 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:40,893 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:40,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1361573053, now seen corresponding path program 69 times [2018-10-14 17:59:40,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:43,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:43,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-14 17:59:43,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-14 17:59:43,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-14 17:59:43,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 17:59:43,253 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 73 states. [2018-10-14 17:59:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:46,407 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-10-14 17:59:46,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-14 17:59:46,408 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 264 [2018-10-14 17:59:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:46,409 INFO L225 Difference]: With dead ends: 270 [2018-10-14 17:59:46,409 INFO L226 Difference]: Without dead ends: 270 [2018-10-14 17:59:46,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-14 17:59:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-14 17:59:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2018-10-14 17:59:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-14 17:59:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-10-14 17:59:46,413 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2018-10-14 17:59:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:46,413 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-10-14 17:59:46,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-14 17:59:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-10-14 17:59:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-14 17:59:46,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:46,414 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:46,415 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:46,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:46,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1666570653, now seen corresponding path program 70 times [2018-10-14 17:59:46,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:48,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:48,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-14 17:59:48,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-14 17:59:48,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-14 17:59:48,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 17:59:48,873 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 74 states. [2018-10-14 17:59:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:52,432 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-10-14 17:59:52,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-14 17:59:52,432 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 267 [2018-10-14 17:59:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:52,434 INFO L225 Difference]: With dead ends: 273 [2018-10-14 17:59:52,434 INFO L226 Difference]: Without dead ends: 273 [2018-10-14 17:59:52,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-14 17:59:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-14 17:59:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-10-14 17:59:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-14 17:59:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-14 17:59:52,437 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2018-10-14 17:59:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:52,437 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-14 17:59:52,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-14 17:59:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-14 17:59:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-14 17:59:52,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:52,438 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:52,438 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:52,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash -300726083, now seen corresponding path program 71 times [2018-10-14 17:59:52,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:54,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:54,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-14 17:59:54,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-14 17:59:54,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-14 17:59:54,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 17:59:54,864 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 75 states. [2018-10-14 17:59:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:58,522 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-14 17:59:58,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-14 17:59:58,522 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 270 [2018-10-14 17:59:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:58,523 INFO L225 Difference]: With dead ends: 276 [2018-10-14 17:59:58,523 INFO L226 Difference]: Without dead ends: 276 [2018-10-14 17:59:58,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-14 17:59:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-14 17:59:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2018-10-14 17:59:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-14 17:59:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2018-10-14 17:59:58,527 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2018-10-14 17:59:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:58,527 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2018-10-14 17:59:58,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-14 17:59:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2018-10-14 17:59:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-14 17:59:58,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:58,528 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:58,528 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:58,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1085932957, now seen corresponding path program 72 times [2018-10-14 17:59:58,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:01,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:01,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-14 18:00:01,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-14 18:00:01,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-14 18:00:01,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 18:00:01,150 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 76 states. [2018-10-14 18:00:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:04,974 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-14 18:00:04,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-14 18:00:04,974 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 273 [2018-10-14 18:00:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:04,975 INFO L225 Difference]: With dead ends: 279 [2018-10-14 18:00:04,975 INFO L226 Difference]: Without dead ends: 279 [2018-10-14 18:00:04,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-14 18:00:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-14 18:00:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-10-14 18:00:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-14 18:00:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-14 18:00:04,980 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2018-10-14 18:00:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:04,980 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-14 18:00:04,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-14 18:00:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-14 18:00:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-14 18:00:04,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:04,981 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:04,981 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:04,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2049940669, now seen corresponding path program 73 times [2018-10-14 18:00:04,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:07,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:07,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-14 18:00:07,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-14 18:00:07,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-14 18:00:07,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 18:00:07,649 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 77 states. [2018-10-14 18:00:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:11,342 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-10-14 18:00:11,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-14 18:00:11,343 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 276 [2018-10-14 18:00:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:11,344 INFO L225 Difference]: With dead ends: 282 [2018-10-14 18:00:11,344 INFO L226 Difference]: Without dead ends: 282 [2018-10-14 18:00:11,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-14 18:00:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-14 18:00:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-10-14 18:00:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-14 18:00:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-10-14 18:00:11,347 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2018-10-14 18:00:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:11,347 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-10-14 18:00:11,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-14 18:00:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-10-14 18:00:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-14 18:00:11,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:11,349 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:11,349 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:11,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:11,349 INFO L82 PathProgramCache]: Analyzing trace with hash 357380509, now seen corresponding path program 74 times [2018-10-14 18:00:11,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:14,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:14,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-14 18:00:14,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-14 18:00:14,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-14 18:00:14,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 18:00:14,098 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 78 states. [2018-10-14 18:00:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:17,715 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-10-14 18:00:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 18:00:17,716 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 279 [2018-10-14 18:00:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:17,717 INFO L225 Difference]: With dead ends: 285 [2018-10-14 18:00:17,717 INFO L226 Difference]: Without dead ends: 285 [2018-10-14 18:00:17,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-14 18:00:17,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-14 18:00:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2018-10-14 18:00:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-14 18:00:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-14 18:00:17,721 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2018-10-14 18:00:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:17,721 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-14 18:00:17,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-14 18:00:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-14 18:00:17,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-14 18:00:17,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:17,723 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:17,723 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:17,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash 213708989, now seen corresponding path program 75 times [2018-10-14 18:00:17,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:20,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:20,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-14 18:00:20,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-14 18:00:20,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-14 18:00:20,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 18:00:20,440 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 79 states. [2018-10-14 18:00:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:24,260 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-10-14 18:00:24,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-14 18:00:24,260 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 282 [2018-10-14 18:00:24,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:24,261 INFO L225 Difference]: With dead ends: 288 [2018-10-14 18:00:24,261 INFO L226 Difference]: Without dead ends: 288 [2018-10-14 18:00:24,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-14 18:00:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-14 18:00:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2018-10-14 18:00:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-14 18:00:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-10-14 18:00:24,265 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2018-10-14 18:00:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:24,265 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-10-14 18:00:24,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-14 18:00:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-10-14 18:00:24,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-14 18:00:24,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:24,266 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:24,266 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:24,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:24,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2117116515, now seen corresponding path program 76 times [2018-10-14 18:00:24,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:26,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:26,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-14 18:00:26,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-14 18:00:26,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-14 18:00:26,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 18:00:26,963 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 80 states. [2018-10-14 18:00:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:31,022 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-14 18:00:31,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-14 18:00:31,023 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 285 [2018-10-14 18:00:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:31,024 INFO L225 Difference]: With dead ends: 291 [2018-10-14 18:00:31,024 INFO L226 Difference]: Without dead ends: 291 [2018-10-14 18:00:31,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-14 18:00:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-14 18:00:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-10-14 18:00:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-14 18:00:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-14 18:00:31,029 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2018-10-14 18:00:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:31,030 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-14 18:00:31,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-14 18:00:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-14 18:00:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-14 18:00:31,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:31,031 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:31,031 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:31,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:31,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1291535549, now seen corresponding path program 77 times [2018-10-14 18:00:31,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:33,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:33,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-14 18:00:33,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-14 18:00:33,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-14 18:00:33,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 18:00:33,893 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 81 states. [2018-10-14 18:00:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:38,038 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-10-14 18:00:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 18:00:38,039 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 288 [2018-10-14 18:00:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:38,040 INFO L225 Difference]: With dead ends: 294 [2018-10-14 18:00:38,040 INFO L226 Difference]: Without dead ends: 294 [2018-10-14 18:00:38,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-14 18:00:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-14 18:00:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2018-10-14 18:00:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-14 18:00:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-14 18:00:38,044 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2018-10-14 18:00:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:38,044 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-14 18:00:38,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-14 18:00:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-14 18:00:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-14 18:00:38,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:38,045 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:38,045 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:38,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:38,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1761572451, now seen corresponding path program 78 times [2018-10-14 18:00:38,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:41,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:41,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-14 18:00:41,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-14 18:00:41,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-14 18:00:41,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 18:00:41,155 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 82 states. [2018-10-14 18:00:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:45,256 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-10-14 18:00:45,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 18:00:45,257 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 291 [2018-10-14 18:00:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:45,258 INFO L225 Difference]: With dead ends: 297 [2018-10-14 18:00:45,258 INFO L226 Difference]: Without dead ends: 297 [2018-10-14 18:00:45,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-14 18:00:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-14 18:00:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2018-10-14 18:00:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-14 18:00:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-10-14 18:00:45,262 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2018-10-14 18:00:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:45,262 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-10-14 18:00:45,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-14 18:00:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-10-14 18:00:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-14 18:00:45,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:45,264 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:45,264 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:45,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1915394237, now seen corresponding path program 79 times [2018-10-14 18:00:45,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:48,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:48,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-14 18:00:48,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-14 18:00:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-14 18:00:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 18:00:48,183 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 83 states. [2018-10-14 18:00:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:52,458 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-10-14 18:00:52,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-14 18:00:52,459 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 294 [2018-10-14 18:00:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:52,460 INFO L225 Difference]: With dead ends: 300 [2018-10-14 18:00:52,460 INFO L226 Difference]: Without dead ends: 300 [2018-10-14 18:00:52,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-14 18:00:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-14 18:00:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2018-10-14 18:00:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-14 18:00:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-10-14 18:00:52,464 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2018-10-14 18:00:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:52,464 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-10-14 18:00:52,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-14 18:00:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-10-14 18:00:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-14 18:00:52,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:52,465 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:52,465 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:52,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:52,465 INFO L82 PathProgramCache]: Analyzing trace with hash -710888035, now seen corresponding path program 80 times [2018-10-14 18:00:52,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:55,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:55,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-14 18:00:55,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-14 18:00:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-14 18:00:55,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 18:00:55,673 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 84 states. [2018-10-14 18:01:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:00,018 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-14 18:01:00,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 18:01:00,018 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 297 [2018-10-14 18:01:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:00,019 INFO L225 Difference]: With dead ends: 303 [2018-10-14 18:01:00,019 INFO L226 Difference]: Without dead ends: 303 [2018-10-14 18:01:00,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-14 18:01:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-14 18:01:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2018-10-14 18:01:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-14 18:01:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-14 18:01:00,023 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2018-10-14 18:01:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:00,023 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-14 18:01:00,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-14 18:01:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-14 18:01:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-14 18:01:00,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:00,025 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:00,025 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:00,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:00,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1133178045, now seen corresponding path program 81 times [2018-10-14 18:01:00,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:03,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:03,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-14 18:01:03,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-14 18:01:03,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-14 18:01:03,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 18:01:03,050 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 85 states. [2018-10-14 18:01:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:07,548 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-10-14 18:01:07,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-14 18:01:07,548 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 300 [2018-10-14 18:01:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:07,550 INFO L225 Difference]: With dead ends: 306 [2018-10-14 18:01:07,550 INFO L226 Difference]: Without dead ends: 306 [2018-10-14 18:01:07,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-14 18:01:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-14 18:01:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-10-14 18:01:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-14 18:01:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-10-14 18:01:07,553 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2018-10-14 18:01:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:07,554 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-10-14 18:01:07,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-14 18:01:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-10-14 18:01:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-14 18:01:07,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:07,555 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:07,555 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:07,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash 779084189, now seen corresponding path program 82 times [2018-10-14 18:01:07,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:10,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:10,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-14 18:01:10,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-14 18:01:10,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-14 18:01:10,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 18:01:10,878 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 86 states. [2018-10-14 18:01:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:15,502 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-14 18:01:15,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-14 18:01:15,502 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 303 [2018-10-14 18:01:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:15,503 INFO L225 Difference]: With dead ends: 309 [2018-10-14 18:01:15,504 INFO L226 Difference]: Without dead ends: 309 [2018-10-14 18:01:15,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-14 18:01:15,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-14 18:01:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2018-10-14 18:01:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-14 18:01:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-14 18:01:15,508 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 303 [2018-10-14 18:01:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:15,508 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-14 18:01:15,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-14 18:01:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-14 18:01:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-14 18:01:15,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:15,509 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:15,509 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:15,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash 408699069, now seen corresponding path program 83 times [2018-10-14 18:01:15,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:18,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:18,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-14 18:01:18,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-14 18:01:18,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-14 18:01:18,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:01:18,661 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 87 states. [2018-10-14 18:01:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:23,273 INFO L93 Difference]: Finished difference Result 312 states and 312 transitions. [2018-10-14 18:01:23,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 18:01:23,273 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 306 [2018-10-14 18:01:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:23,274 INFO L225 Difference]: With dead ends: 312 [2018-10-14 18:01:23,274 INFO L226 Difference]: Without dead ends: 312 [2018-10-14 18:01:23,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-14 18:01:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-14 18:01:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2018-10-14 18:01:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-14 18:01:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-10-14 18:01:23,278 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 306 [2018-10-14 18:01:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:23,278 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-10-14 18:01:23,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-14 18:01:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-10-14 18:01:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-14 18:01:23,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:23,279 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:23,279 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:23,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash 36572573, now seen corresponding path program 84 times [2018-10-14 18:01:23,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:26,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:26,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-14 18:01:26,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-14 18:01:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-14 18:01:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 18:01:26,663 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 88 states. [2018-10-14 18:01:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:31,327 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-10-14 18:01:31,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-14 18:01:31,327 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 309 [2018-10-14 18:01:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:31,328 INFO L225 Difference]: With dead ends: 315 [2018-10-14 18:01:31,328 INFO L226 Difference]: Without dead ends: 315 [2018-10-14 18:01:31,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-14 18:01:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-14 18:01:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-10-14 18:01:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-14 18:01:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-10-14 18:01:31,333 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 309 [2018-10-14 18:01:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:31,333 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-10-14 18:01:31,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-14 18:01:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-10-14 18:01:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-14 18:01:31,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:31,335 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:31,335 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:31,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash -673278787, now seen corresponding path program 85 times [2018-10-14 18:01:31,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:34,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:34,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-14 18:01:34,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-14 18:01:34,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-14 18:01:34,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 18:01:34,732 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 89 states. [2018-10-14 18:01:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:39,457 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-10-14 18:01:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-14 18:01:39,457 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 312 [2018-10-14 18:01:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:39,458 INFO L225 Difference]: With dead ends: 318 [2018-10-14 18:01:39,458 INFO L226 Difference]: Without dead ends: 318 [2018-10-14 18:01:39,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-14 18:01:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-14 18:01:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2018-10-14 18:01:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-14 18:01:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-10-14 18:01:39,463 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 312 [2018-10-14 18:01:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:39,464 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-10-14 18:01:39,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-14 18:01:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-10-14 18:01:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-14 18:01:39,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:39,465 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:39,466 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:39,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:39,466 INFO L82 PathProgramCache]: Analyzing trace with hash 563820957, now seen corresponding path program 86 times [2018-10-14 18:01:39,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:42,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:42,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-14 18:01:42,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-14 18:01:42,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-14 18:01:42,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 18:01:42,823 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 90 states. [2018-10-14 18:01:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:47,616 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-10-14 18:01:47,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 18:01:47,621 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 315 [2018-10-14 18:01:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:47,622 INFO L225 Difference]: With dead ends: 321 [2018-10-14 18:01:47,622 INFO L226 Difference]: Without dead ends: 321 [2018-10-14 18:01:47,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-14 18:01:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-14 18:01:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2018-10-14 18:01:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-14 18:01:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-14 18:01:47,626 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 315 [2018-10-14 18:01:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:47,626 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-14 18:01:47,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-14 18:01:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-14 18:01:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-14 18:01:47,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:47,628 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:47,628 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:47,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:47,628 INFO L82 PathProgramCache]: Analyzing trace with hash -112072515, now seen corresponding path program 87 times [2018-10-14 18:01:47,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:51,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:51,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-14 18:01:51,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-14 18:01:51,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-14 18:01:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 18:01:51,270 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 91 states. [2018-10-14 18:01:56,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:56,267 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-10-14 18:01:56,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-14 18:01:56,268 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 318 [2018-10-14 18:01:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:56,269 INFO L225 Difference]: With dead ends: 324 [2018-10-14 18:01:56,269 INFO L226 Difference]: Without dead ends: 324 [2018-10-14 18:01:56,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-14 18:01:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-14 18:01:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2018-10-14 18:01:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-14 18:01:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2018-10-14 18:01:56,274 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 318 [2018-10-14 18:01:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:56,274 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2018-10-14 18:01:56,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-14 18:01:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2018-10-14 18:01:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-14 18:01:56,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:56,275 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:56,276 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:56,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash -847813219, now seen corresponding path program 88 times [2018-10-14 18:01:56,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:59,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:59,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-14 18:01:59,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-14 18:01:59,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-14 18:01:59,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 18:01:59,900 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 92 states. [2018-10-14 18:02:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:04,975 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-10-14 18:02:04,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-14 18:02:04,975 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 321 [2018-10-14 18:02:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:04,976 INFO L225 Difference]: With dead ends: 327 [2018-10-14 18:02:04,976 INFO L226 Difference]: Without dead ends: 327 [2018-10-14 18:02:04,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-14 18:02:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-14 18:02:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-14 18:02:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-14 18:02:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-10-14 18:02:04,980 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 321 [2018-10-14 18:02:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:04,980 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-10-14 18:02:04,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-14 18:02:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-10-14 18:02:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-14 18:02:04,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:04,982 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:04,982 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:04,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2081014595, now seen corresponding path program 89 times [2018-10-14 18:02:04,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:08,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:08,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-14 18:02:08,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-14 18:02:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-14 18:02:08,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 18:02:08,689 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 93 states. [2018-10-14 18:02:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:13,934 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-10-14 18:02:13,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-14 18:02:13,938 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 324 [2018-10-14 18:02:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:13,940 INFO L225 Difference]: With dead ends: 330 [2018-10-14 18:02:13,940 INFO L226 Difference]: Without dead ends: 330 [2018-10-14 18:02:13,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-14 18:02:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-14 18:02:13,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-10-14 18:02:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-14 18:02:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-10-14 18:02:13,944 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 324 [2018-10-14 18:02:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:13,945 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-10-14 18:02:13,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-14 18:02:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-10-14 18:02:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-14 18:02:13,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:13,946 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:13,947 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:13,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:13,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1232957027, now seen corresponding path program 90 times [2018-10-14 18:02:13,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:17,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:17,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-14 18:02:17,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-14 18:02:17,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-14 18:02:17,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 18:02:17,690 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 94 states. [2018-10-14 18:02:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:23,151 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-10-14 18:02:23,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-14 18:02:23,151 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 327 [2018-10-14 18:02:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:23,152 INFO L225 Difference]: With dead ends: 333 [2018-10-14 18:02:23,152 INFO L226 Difference]: Without dead ends: 333 [2018-10-14 18:02:23,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-14 18:02:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-14 18:02:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2018-10-14 18:02:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-14 18:02:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-14 18:02:23,157 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 327 [2018-10-14 18:02:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:23,157 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-14 18:02:23,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-14 18:02:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-14 18:02:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-14 18:02:23,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:23,158 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:23,159 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:23,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:23,159 INFO L82 PathProgramCache]: Analyzing trace with hash 252416189, now seen corresponding path program 91 times [2018-10-14 18:02:23,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:27,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:27,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-14 18:02:27,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-14 18:02:27,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-14 18:02:27,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 18:02:27,161 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 95 states. [2018-10-14 18:02:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:32,498 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2018-10-14 18:02:32,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-14 18:02:32,498 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 330 [2018-10-14 18:02:32,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:32,499 INFO L225 Difference]: With dead ends: 336 [2018-10-14 18:02:32,499 INFO L226 Difference]: Without dead ends: 336 [2018-10-14 18:02:32,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-14 18:02:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-14 18:02:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2018-10-14 18:02:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-14 18:02:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2018-10-14 18:02:32,504 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 330 [2018-10-14 18:02:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:32,504 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2018-10-14 18:02:32,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-14 18:02:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2018-10-14 18:02:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-14 18:02:32,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:32,505 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:32,506 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:32,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:32,506 INFO L82 PathProgramCache]: Analyzing trace with hash -42156643, now seen corresponding path program 92 times [2018-10-14 18:02:32,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:36,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:36,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-14 18:02:36,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-14 18:02:36,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-14 18:02:36,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-14 18:02:36,398 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand 96 states. [2018-10-14 18:02:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:42,041 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-10-14 18:02:42,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 18:02:42,041 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 333 [2018-10-14 18:02:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:42,043 INFO L225 Difference]: With dead ends: 339 [2018-10-14 18:02:42,043 INFO L226 Difference]: Without dead ends: 339 [2018-10-14 18:02:42,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-14 18:02:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-14 18:02:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-10-14 18:02:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-14 18:02:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-10-14 18:02:42,048 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 333 [2018-10-14 18:02:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:42,049 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-10-14 18:02:42,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-14 18:02:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-10-14 18:02:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-14 18:02:42,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:42,051 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:42,051 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:42,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:42,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1043209027, now seen corresponding path program 93 times [2018-10-14 18:02:42,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:45,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:45,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-14 18:02:45,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-14 18:02:45,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-14 18:02:45,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 18:02:45,966 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 97 states. [2018-10-14 18:02:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:51,482 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2018-10-14 18:02:51,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-14 18:02:51,482 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 336 [2018-10-14 18:02:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:51,483 INFO L225 Difference]: With dead ends: 340 [2018-10-14 18:02:51,483 INFO L226 Difference]: Without dead ends: 340 [2018-10-14 18:02:51,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-14 18:02:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-14 18:02:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-14 18:02:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-14 18:02:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-10-14 18:02:51,487 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 336 [2018-10-14 18:02:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:51,488 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-10-14 18:02:51,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-14 18:02:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-10-14 18:02:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-14 18:02:51,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:51,489 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:51,489 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:51,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash 858122653, now seen corresponding path program 94 times [2018-10-14 18:02:51,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-14 18:02:52,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:02:52,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-14 18:02:52,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 18:02:52,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 18:02:52,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 18:02:52,029 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 8 states. [2018-10-14 18:02:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:52,322 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-10-14 18:02:52,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 18:02:52,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 339 [2018-10-14 18:02:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:52,323 INFO L225 Difference]: With dead ends: 338 [2018-10-14 18:02:52,323 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 18:02:52,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:02:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 18:02:52,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 18:02:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 18:02:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 18:02:52,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 339 [2018-10-14 18:02:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:52,324 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 18:02:52,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 18:02:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 18:02:52,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 18:02:52,327 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:02:52 BasicIcfg [2018-10-14 18:02:52,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 18:02:52,329 INFO L168 Benchmark]: Toolchain (without parser) took 387148.43 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-14 18:02:52,329 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 18:02:52,330 INFO L168 Benchmark]: Boogie Preprocessor took 59.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 18:02:52,330 INFO L168 Benchmark]: RCFGBuilder took 643.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-14 18:02:52,331 INFO L168 Benchmark]: IcfgTransformer took 32060.91 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 673.3 MB. Max. memory is 7.1 GB. [2018-10-14 18:02:52,331 INFO L168 Benchmark]: TraceAbstraction took 354378.93 ms. Allocated memory was 3.2 GB in the beginning and 4.2 GB in the end (delta: 955.8 MB). Free memory was 2.5 GB in the beginning and 3.0 GB in the end (delta: -591.6 MB). Peak memory consumption was 364.1 MB. Max. memory is 7.1 GB. [2018-10-14 18:02:52,334 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 643.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 32060.91 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 673.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 354378.93 ms. Allocated memory was 3.2 GB in the beginning and 4.2 GB in the end (delta: 955.8 MB). Free memory was 2.5 GB in the beginning and 3.0 GB in the end (delta: -591.6 MB). Peak memory consumption was 364.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 1623 LocStat_NO_SUPPORTING_DISEQUALITIES : 302 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 62 TransStat_MAX_WEQGRAPH_SIZE : 3 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 79 TransStat_NO_SUPPORTING_DISEQUALITIES : 1 TransStat_NO_DISJUNCTIONS : 62 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 21596.39 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 131 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 62 different actions 129 times. Merged at 36 different actions 64 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int, ULTIMATE.start_write~int_old_#memory_int] : 0 COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 4 COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int, ULTIMATE.start_write~int_old_#memory_int] : null * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 1 error locations. SAFE Result, 354.3s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 202.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5211 SDtfs, 21517 SDslu, 166065 SDs, 0 SdLazy, 25212 SolverSat, 4608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9130 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138419 ImplicationChecksByTransitivity, 311.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 95 MinimizatonAttempts, 186 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 145.2s InterpolantComputationTime, 18810 NumberOfCodeBlocks, 18810 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 18715 ConstructedInterpolants, 0 QuantifiedInterpolants, 18402035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 2 PerfectInterpolantSequences, 13207/419710 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-14_18-02-52-346.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-14_18-02-52-346.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-14_18-02-52-346.csv The toolchain threw an exception: class java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" RESULT: An exception occured during the execution of Ultimate: The toolchain threw an exception java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark.createCsvProvider(AbsIntBenchmark.java:42) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.writeCsvLogs(CommandLineController.java:342) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.displayToolchainResults(CommandLineController.java:325) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:343) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at sun.reflect.Reflection.ensureMemberAccess(Reflection.java:102) at java.lang.reflect.AccessibleObject.slowCheckMemberAccess(AccessibleObject.java:296) at java.lang.reflect.AccessibleObject.checkAccess(AccessibleObject.java:288) at java.lang.reflect.Field.get(Field.java:390) at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:275) ... 6 more Received shutdown request...