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/20181015-LoopsPathprograms/array_false-unreach-call3_true-termination.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:20,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:21,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:21,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:21,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:21,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:21,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:21,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:21,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:21,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:21,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:21,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:21,034 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:21,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:21,046 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:21,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:21,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:21,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:21,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:21,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:21,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:21,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:21,069 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:21,069 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:21,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:21,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:21,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:21,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:21,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:21,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:21,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:21,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:21,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:21,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:21,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:21,079 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:21,080 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-15 12:55:21,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:21,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:21,093 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:21,094 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:21,094 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:21,094 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:21,095 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:21,095 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:21,095 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:21,095 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:21,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:21,096 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:21,096 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:21,097 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:21,097 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:21,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:21,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:21,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:21,194 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:21,194 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:21,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_false-unreach-call3_true-termination.i_5.bpl [2018-10-15 12:55:21,196 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_false-unreach-call3_true-termination.i_5.bpl' [2018-10-15 12:55:21,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:21,281 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:21,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:21,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:21,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:21,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:21,344 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:21,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (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-15 12:55:21,434 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:21,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:21,914 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:21,915 INFO L202 PluginConnector]: Adding new model array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:21 BoogieIcfgContainer [2018-10-15 12:55:21,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:21,915 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:21,916 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:21,917 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:21,920 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,928 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-15 12:55:21,928 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-15 12:55:21,966 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-15 12:55:22,009 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-15 12:55:22,024 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-15 12:55:22,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-15 12:55:26,692 INFO L315 AbstractInterpreter]: Visited 46 different actions 139 times. Merged at 28 different actions 87 times. Widened at 1 different actions 2 times. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-10-15 12:55:26,696 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-15 12:55:26,700 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-15 12:55:26,712 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_2|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-15 12:55:26,714 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_2|) |v_ULTIMATE.start_read~int_#ptr.offset_2|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-15 12:55:26,746 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_2|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-15 12:55:26,748 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-15 12:55:26,749 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 12:55:26,749 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:26,750 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:26,750 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:26,750 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:26,750 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:26,751 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:26,751 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 12:55:26,751 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:26,751 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:26,751 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:26,752 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:26,752 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:26,754 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:26,755 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-15 12:55:26,776 INFO L202 PluginConnector]: Adding new model array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:26 BasicIcfg [2018-10-15 12:55:26,776 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:26,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:26,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:26,781 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:26,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/3) ... [2018-10-15 12:55:26,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598fe208 and model type array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:55:26, skipping insertion in model container [2018-10-15 12:55:26,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:21" (2/3) ... [2018-10-15 12:55:26,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598fe208 and model type array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:55:26, skipping insertion in model container [2018-10-15 12:55:26,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:26" (3/3) ... [2018-10-15 12:55:26,787 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-15 12:55:26,798 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:26,808 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:26,828 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:26,860 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:26,861 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:26,861 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:26,861 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:26,862 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:26,862 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:26,862 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:26,862 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:26,863 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-15 12:55:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 12:55:26,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,892 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] [2018-10-15 12:55:26,893 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1047407478, now seen corresponding path program 1 times [2018-10-15 12:55:26,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:27,152 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-15 12:55:27,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:27,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:27,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:27,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:27,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:27,176 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-10-15 12:55:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,405 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-10-15 12:55:27,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:27,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-15 12:55:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,423 INFO L225 Difference]: With dead ends: 67 [2018-10-15 12:55:27,423 INFO L226 Difference]: Without dead ends: 67 [2018-10-15 12:55:27,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-15 12:55:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2018-10-15 12:55:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-15 12:55:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-10-15 12:55:27,538 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 29 [2018-10-15 12:55:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,539 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-10-15 12:55:27,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-10-15 12:55:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 12:55:27,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,543 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:27,543 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2136127134, now seen corresponding path program 1 times [2018-10-15 12:55:27,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:27,756 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-15 12:55:27,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:27,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:27,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:27,760 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 5 states. [2018-10-15 12:55:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:28,154 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-10-15 12:55:28,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:55:28,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-15 12:55:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:28,162 INFO L225 Difference]: With dead ends: 77 [2018-10-15 12:55:28,162 INFO L226 Difference]: Without dead ends: 77 [2018-10-15 12:55:28,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-15 12:55:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2018-10-15 12:55:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-15 12:55:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-10-15 12:55:28,174 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 39 [2018-10-15 12:55:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:28,175 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-10-15 12:55:28,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-10-15 12:55:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 12:55:28,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:28,179 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:28,179 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:28,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1799417934, now seen corresponding path program 2 times [2018-10-15 12:55:28,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,464 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-15 12:55:28,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:55:28,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:55:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:55:28,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:28,465 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 7 states. [2018-10-15 12:55:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:28,736 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-10-15 12:55:28,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:55:28,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-10-15 12:55:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:28,739 INFO L225 Difference]: With dead ends: 87 [2018-10-15 12:55:28,739 INFO L226 Difference]: Without dead ends: 87 [2018-10-15 12:55:28,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-15 12:55:28,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2018-10-15 12:55:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-15 12:55:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-10-15 12:55:28,754 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 49 [2018-10-15 12:55:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:28,754 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-10-15 12:55:28,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:55:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-10-15 12:55:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 12:55:28,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:28,758 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:28,759 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:28,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:28,759 INFO L82 PathProgramCache]: Analyzing trace with hash -147972154, now seen corresponding path program 3 times [2018-10-15 12:55:28,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:28,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:28,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:28,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:28,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:28,970 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 9 states. [2018-10-15 12:55:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,587 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-10-15 12:55:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:55:29,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-10-15 12:55:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,589 INFO L225 Difference]: With dead ends: 97 [2018-10-15 12:55:29,589 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 12:55:29,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 12:55:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2018-10-15 12:55:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 12:55:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-10-15 12:55:29,598 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 59 [2018-10-15 12:55:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,598 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-10-15 12:55:29,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-10-15 12:55:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 12:55:29,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,600 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:29,600 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1206331098, now seen corresponding path program 4 times [2018-10-15 12:55:29,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:29,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:29,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:29,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:29,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:29,766 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 11 states. [2018-10-15 12:55:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:30,222 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-10-15 12:55:30,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:55:30,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-10-15 12:55:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:30,227 INFO L225 Difference]: With dead ends: 107 [2018-10-15 12:55:30,228 INFO L226 Difference]: Without dead ends: 107 [2018-10-15 12:55:30,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-15 12:55:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2018-10-15 12:55:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-15 12:55:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-10-15 12:55:30,235 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 69 [2018-10-15 12:55:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:30,236 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-10-15 12:55:30,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-10-15 12:55:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:55:30,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:30,237 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:30,238 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:30,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:30,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1474206482, now seen corresponding path program 5 times [2018-10-15 12:55:30,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:30,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:30,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:30,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:30,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:30,536 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 13 states. [2018-10-15 12:55:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:30,832 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-10-15 12:55:30,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:55:30,832 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-10-15 12:55:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:30,834 INFO L225 Difference]: With dead ends: 117 [2018-10-15 12:55:30,834 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 12:55:30,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:30,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 12:55:30,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-10-15 12:55:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-15 12:55:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-10-15 12:55:30,841 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 79 [2018-10-15 12:55:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:30,842 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-10-15 12:55:30,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-10-15 12:55:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 12:55:30,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:30,844 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:30,844 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:30,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1929111038, now seen corresponding path program 6 times [2018-10-15 12:55:30,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:31,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:31,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:31,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:31,051 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 15 states. [2018-10-15 12:55:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:31,426 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-10-15 12:55:31,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:55:31,427 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-15 12:55:31,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:31,428 INFO L225 Difference]: With dead ends: 127 [2018-10-15 12:55:31,428 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 12:55:31,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 12:55:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 104. [2018-10-15 12:55:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-15 12:55:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-10-15 12:55:31,436 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 89 [2018-10-15 12:55:31,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:31,437 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-10-15 12:55:31,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-10-15 12:55:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 12:55:31,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:31,439 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:31,439 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:31,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:31,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1817803242, now seen corresponding path program 7 times [2018-10-15 12:55:31,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:31,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:31,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:31,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:31,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:31,886 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 17 states. [2018-10-15 12:55:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:32,370 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-10-15 12:55:32,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:55:32,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2018-10-15 12:55:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:32,373 INFO L225 Difference]: With dead ends: 137 [2018-10-15 12:55:32,373 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 12:55:32,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 12:55:32,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2018-10-15 12:55:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-15 12:55:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-10-15 12:55:32,380 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 99 [2018-10-15 12:55:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:32,380 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-10-15 12:55:32,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-10-15 12:55:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:55:32,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:32,384 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:32,384 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:32,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:32,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1427106090, now seen corresponding path program 8 times [2018-10-15 12:55:32,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:32,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:32,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:32,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:32,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:32,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:32,897 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 19 states. [2018-10-15 12:55:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:33,438 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-10-15 12:55:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:55:33,438 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-10-15 12:55:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:33,440 INFO L225 Difference]: With dead ends: 147 [2018-10-15 12:55:33,440 INFO L226 Difference]: Without dead ends: 147 [2018-10-15 12:55:33,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-15 12:55:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2018-10-15 12:55:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-15 12:55:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-10-15 12:55:33,447 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 109 [2018-10-15 12:55:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:33,448 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-10-15 12:55:33,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-10-15 12:55:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 12:55:33,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:33,450 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:33,450 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:33,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash 976716606, now seen corresponding path program 9 times [2018-10-15 12:55:33,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:33,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:33,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:33,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:33,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:33,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:33,821 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 21 states. [2018-10-15 12:55:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:34,353 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-10-15 12:55:34,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:55:34,354 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-10-15 12:55:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:34,355 INFO L225 Difference]: With dead ends: 157 [2018-10-15 12:55:34,356 INFO L226 Difference]: Without dead ends: 157 [2018-10-15 12:55:34,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-15 12:55:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 134. [2018-10-15 12:55:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-15 12:55:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-10-15 12:55:34,372 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 119 [2018-10-15 12:55:34,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:34,372 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-10-15 12:55:34,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-10-15 12:55:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 12:55:34,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:34,374 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:34,374 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:34,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:34,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1342477394, now seen corresponding path program 10 times [2018-10-15 12:55:34,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:34,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:34,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:34,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:34,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:34,797 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 23 states. [2018-10-15 12:55:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:35,416 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-10-15 12:55:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:55:35,416 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-10-15 12:55:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:35,418 INFO L225 Difference]: With dead ends: 167 [2018-10-15 12:55:35,418 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 12:55:35,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 12:55:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2018-10-15 12:55:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-15 12:55:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-10-15 12:55:35,425 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 129 [2018-10-15 12:55:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:35,425 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-10-15 12:55:35,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-10-15 12:55:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:55:35,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:35,427 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:35,428 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:35,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:35,428 INFO L82 PathProgramCache]: Analyzing trace with hash 458120294, now seen corresponding path program 11 times [2018-10-15 12:55:35,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:35,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:35,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:35,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:35,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:35,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:35,843 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 25 states. [2018-10-15 12:55:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:36,478 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-10-15 12:55:36,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:55:36,479 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 139 [2018-10-15 12:55:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:36,480 INFO L225 Difference]: With dead ends: 177 [2018-10-15 12:55:36,480 INFO L226 Difference]: Without dead ends: 177 [2018-10-15 12:55:36,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-15 12:55:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2018-10-15 12:55:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-15 12:55:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-10-15 12:55:36,487 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 139 [2018-10-15 12:55:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:36,488 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-10-15 12:55:36,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-10-15 12:55:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:55:36,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:36,490 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:36,490 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:36,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1826364282, now seen corresponding path program 12 times [2018-10-15 12:55:36,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:37,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:37,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:37,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:37,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:37,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:37,163 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 27 states. [2018-10-15 12:55:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,940 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-10-15 12:55:37,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:55:37,941 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 149 [2018-10-15 12:55:37,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,943 INFO L225 Difference]: With dead ends: 187 [2018-10-15 12:55:37,943 INFO L226 Difference]: Without dead ends: 187 [2018-10-15 12:55:37,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-15 12:55:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2018-10-15 12:55:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:55:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2018-10-15 12:55:37,947 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 149 [2018-10-15 12:55:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,948 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2018-10-15 12:55:37,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2018-10-15 12:55:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 12:55:37,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,949 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:37,949 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash 895816078, now seen corresponding path program 13 times [2018-10-15 12:55:37,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:39,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:39,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:39,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:39,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:39,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:39,383 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 29 states. [2018-10-15 12:55:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:40,212 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-10-15 12:55:40,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:55:40,212 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 159 [2018-10-15 12:55:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:40,214 INFO L225 Difference]: With dead ends: 197 [2018-10-15 12:55:40,214 INFO L226 Difference]: Without dead ends: 197 [2018-10-15 12:55:40,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:55:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-15 12:55:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 174. [2018-10-15 12:55:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-15 12:55:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-10-15 12:55:40,220 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 159 [2018-10-15 12:55:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:40,220 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-10-15 12:55:40,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-10-15 12:55:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:55:40,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:40,221 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:40,222 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:40,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1502641826, now seen corresponding path program 14 times [2018-10-15 12:55:40,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:41,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:41,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:41,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:41,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:41,469 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 31 states. [2018-10-15 12:55:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:42,393 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-10-15 12:55:42,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:55:42,394 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 169 [2018-10-15 12:55:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:42,396 INFO L225 Difference]: With dead ends: 207 [2018-10-15 12:55:42,396 INFO L226 Difference]: Without dead ends: 207 [2018-10-15 12:55:42,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:55:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-15 12:55:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 184. [2018-10-15 12:55:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-15 12:55:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-10-15 12:55:42,403 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 169 [2018-10-15 12:55:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:42,403 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-10-15 12:55:42,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-10-15 12:55:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 12:55:42,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:42,404 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:42,406 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:42,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:42,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2047499594, now seen corresponding path program 15 times [2018-10-15 12:55:42,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:42,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:42,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:42,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:42,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:42,908 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 33 states. [2018-10-15 12:55:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:43,727 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-10-15 12:55:43,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:55:43,729 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 179 [2018-10-15 12:55:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:43,730 INFO L225 Difference]: With dead ends: 217 [2018-10-15 12:55:43,731 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 12:55:43,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:55:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 12:55:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 194. [2018-10-15 12:55:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-15 12:55:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-10-15 12:55:43,736 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 179 [2018-10-15 12:55:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:43,736 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-10-15 12:55:43,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-10-15 12:55:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-15 12:55:43,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:43,738 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:43,738 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:43,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:43,738 INFO L82 PathProgramCache]: Analyzing trace with hash 52149706, now seen corresponding path program 16 times [2018-10-15 12:55:43,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:44,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:44,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:44,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:44,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:44,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:44,262 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 35 states. [2018-10-15 12:55:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:45,220 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-10-15 12:55:45,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:55:45,220 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2018-10-15 12:55:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:45,222 INFO L225 Difference]: With dead ends: 227 [2018-10-15 12:55:45,222 INFO L226 Difference]: Without dead ends: 227 [2018-10-15 12:55:45,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:55:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-15 12:55:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 204. [2018-10-15 12:55:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-15 12:55:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-10-15 12:55:45,228 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 189 [2018-10-15 12:55:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:45,228 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-10-15 12:55:45,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:55:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-10-15 12:55:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:55:45,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:45,229 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:45,229 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:45,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1988489250, now seen corresponding path program 17 times [2018-10-15 12:55:45,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 1377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:46,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:46,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:55:46,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:55:46,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:55:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:46,083 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 37 states. [2018-10-15 12:55:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:47,366 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-10-15 12:55:47,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:55:47,366 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 199 [2018-10-15 12:55:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:47,367 INFO L225 Difference]: With dead ends: 237 [2018-10-15 12:55:47,367 INFO L226 Difference]: Without dead ends: 237 [2018-10-15 12:55:47,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:55:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-15 12:55:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 214. [2018-10-15 12:55:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-15 12:55:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2018-10-15 12:55:47,373 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 199 [2018-10-15 12:55:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:47,373 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2018-10-15 12:55:47,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:55:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2018-10-15 12:55:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 12:55:47,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:47,374 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:47,374 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:47,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash 360175858, now seen corresponding path program 18 times [2018-10-15 12:55:47,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 1548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:47,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:47,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:55:47,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:55:47,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:55:47,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:47,976 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand 39 states. [2018-10-15 12:55:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:49,032 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2018-10-15 12:55:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:55:49,033 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 209 [2018-10-15 12:55:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:49,034 INFO L225 Difference]: With dead ends: 247 [2018-10-15 12:55:49,035 INFO L226 Difference]: Without dead ends: 247 [2018-10-15 12:55:49,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:55:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-15 12:55:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2018-10-15 12:55:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:55:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2018-10-15 12:55:49,041 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 209 [2018-10-15 12:55:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:49,042 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2018-10-15 12:55:49,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:55:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2018-10-15 12:55:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 12:55:49,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:49,043 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:49,043 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:49,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:49,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1150527226, now seen corresponding path program 19 times [2018-10-15 12:55:49,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:49,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:49,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:55:49,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:55:49,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:55:49,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:55:49,996 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 41 states. [2018-10-15 12:55:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:51,272 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-10-15 12:55:51,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:55:51,273 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 219 [2018-10-15 12:55:51,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:51,276 INFO L225 Difference]: With dead ends: 257 [2018-10-15 12:55:51,276 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 12:55:51,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:55:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 12:55:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2018-10-15 12:55:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-15 12:55:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2018-10-15 12:55:51,282 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 219 [2018-10-15 12:55:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:51,282 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2018-10-15 12:55:51,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:55:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2018-10-15 12:55:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 12:55:51,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:51,284 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:51,284 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:51,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2074005530, now seen corresponding path program 20 times [2018-10-15 12:55:51,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 0 proven. 1920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:53,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:53,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:55:53,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:55:53,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:55:53,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:53,115 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 43 states. [2018-10-15 12:55:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:54,417 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-10-15 12:55:54,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:55:54,418 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 229 [2018-10-15 12:55:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:54,420 INFO L225 Difference]: With dead ends: 267 [2018-10-15 12:55:54,420 INFO L226 Difference]: Without dead ends: 267 [2018-10-15 12:55:54,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:55:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-15 12:55:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 244. [2018-10-15 12:55:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-15 12:55:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 245 transitions. [2018-10-15 12:55:54,427 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 245 transitions. Word has length 229 [2018-10-15 12:55:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:54,428 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 245 transitions. [2018-10-15 12:55:54,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:55:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2018-10-15 12:55:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 12:55:54,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:54,429 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:54,430 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:54,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:54,430 INFO L82 PathProgramCache]: Analyzing trace with hash 373718574, now seen corresponding path program 21 times [2018-10-15 12:55:54,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 0 proven. 2121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:55,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:55,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:55:55,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:55:55,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:55:55,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:55:55,908 INFO L87 Difference]: Start difference. First operand 244 states and 245 transitions. Second operand 45 states. [2018-10-15 12:55:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:57,167 INFO L93 Difference]: Finished difference Result 277 states and 278 transitions. [2018-10-15 12:55:57,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:55:57,170 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 239 [2018-10-15 12:55:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:57,172 INFO L225 Difference]: With dead ends: 277 [2018-10-15 12:55:57,172 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 12:55:57,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:55:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 12:55:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2018-10-15 12:55:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 12:55:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 255 transitions. [2018-10-15 12:55:57,178 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 255 transitions. Word has length 239 [2018-10-15 12:55:57,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:57,178 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 255 transitions. [2018-10-15 12:55:57,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:55:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 255 transitions. [2018-10-15 12:55:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 12:55:57,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:57,180 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:57,180 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:57,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash -544562366, now seen corresponding path program 22 times [2018-10-15 12:55:57,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 2332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:58,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:58,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:55:58,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:55:58,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:55:58,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:58,344 INFO L87 Difference]: Start difference. First operand 254 states and 255 transitions. Second operand 47 states. [2018-10-15 12:56:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:01,547 INFO L93 Difference]: Finished difference Result 287 states and 288 transitions. [2018-10-15 12:56:01,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:56:01,547 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 249 [2018-10-15 12:56:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:01,549 INFO L225 Difference]: With dead ends: 287 [2018-10-15 12:56:01,549 INFO L226 Difference]: Without dead ends: 287 [2018-10-15 12:56:01,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:56:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-15 12:56:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 264. [2018-10-15 12:56:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-15 12:56:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2018-10-15 12:56:01,554 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 249 [2018-10-15 12:56:01,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:01,555 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2018-10-15 12:56:01,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:56:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2018-10-15 12:56:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 12:56:01,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:01,557 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:01,557 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:01,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:01,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1820164266, now seen corresponding path program 23 times [2018-10-15 12:56:01,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2553 backedges. 0 proven. 2553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:03,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:03,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:56:03,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:56:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:56:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:56:03,015 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 49 states. [2018-10-15 12:56:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:04,522 INFO L93 Difference]: Finished difference Result 297 states and 298 transitions. [2018-10-15 12:56:04,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:56:04,523 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 259 [2018-10-15 12:56:04,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:04,525 INFO L225 Difference]: With dead ends: 297 [2018-10-15 12:56:04,525 INFO L226 Difference]: Without dead ends: 297 [2018-10-15 12:56:04,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:56:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-15 12:56:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 274. [2018-10-15 12:56:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-15 12:56:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2018-10-15 12:56:04,531 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 259 [2018-10-15 12:56:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:04,531 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2018-10-15 12:56:04,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:56:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2018-10-15 12:56:04,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 12:56:04,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:04,533 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:04,533 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:04,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:04,534 INFO L82 PathProgramCache]: Analyzing trace with hash 708137578, now seen corresponding path program 24 times [2018-10-15 12:56:04,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 0 proven. 2784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:05,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:05,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:56:05,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:56:05,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:56:05,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:56:05,845 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 51 states. [2018-10-15 12:56:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:07,627 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2018-10-15 12:56:07,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:56:07,627 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 269 [2018-10-15 12:56:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:07,629 INFO L225 Difference]: With dead ends: 307 [2018-10-15 12:56:07,629 INFO L226 Difference]: Without dead ends: 307 [2018-10-15 12:56:07,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:56:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-15 12:56:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 284. [2018-10-15 12:56:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:56:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 285 transitions. [2018-10-15 12:56:07,634 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 285 transitions. Word has length 269 [2018-10-15 12:56:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:07,634 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 285 transitions. [2018-10-15 12:56:07,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:56:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 285 transitions. [2018-10-15 12:56:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 12:56:07,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:07,636 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:07,636 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:07,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:07,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1415947138, now seen corresponding path program 25 times [2018-10-15 12:56:07,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:08,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:08,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:08,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:08,696 INFO L87 Difference]: Start difference. First operand 284 states and 285 transitions. Second operand 53 states. [2018-10-15 12:56:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:10,693 INFO L93 Difference]: Finished difference Result 317 states and 318 transitions. [2018-10-15 12:56:10,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:56:10,694 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 279 [2018-10-15 12:56:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:10,695 INFO L225 Difference]: With dead ends: 317 [2018-10-15 12:56:10,695 INFO L226 Difference]: Without dead ends: 317 [2018-10-15 12:56:10,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:56:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-15 12:56:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 294. [2018-10-15 12:56:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-15 12:56:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2018-10-15 12:56:10,700 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 279 [2018-10-15 12:56:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:10,700 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2018-10-15 12:56:10,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2018-10-15 12:56:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:56:10,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:10,702 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:10,702 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:10,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash 60349842, now seen corresponding path program 26 times [2018-10-15 12:56:10,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3276 backedges. 0 proven. 3276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:11,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:11,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:11,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:11,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:11,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:11,815 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand 55 states. [2018-10-15 12:56:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:14,086 INFO L93 Difference]: Finished difference Result 327 states and 328 transitions. [2018-10-15 12:56:14,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:56:14,087 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 289 [2018-10-15 12:56:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:14,088 INFO L225 Difference]: With dead ends: 327 [2018-10-15 12:56:14,089 INFO L226 Difference]: Without dead ends: 327 [2018-10-15 12:56:14,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:56:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-15 12:56:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 304. [2018-10-15 12:56:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-15 12:56:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 305 transitions. [2018-10-15 12:56:14,093 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 305 transitions. Word has length 289 [2018-10-15 12:56:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:14,094 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 305 transitions. [2018-10-15 12:56:14,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 305 transitions. [2018-10-15 12:56:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 12:56:14,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:14,096 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 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] [2018-10-15 12:56:14,096 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:14,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash -704113242, now seen corresponding path program 27 times [2018-10-15 12:56:14,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:15,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:15,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:15,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:15,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:15,303 INFO L87 Difference]: Start difference. First operand 304 states and 305 transitions. Second operand 57 states. [2018-10-15 12:56:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:17,114 INFO L93 Difference]: Finished difference Result 337 states and 338 transitions. [2018-10-15 12:56:17,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:56:17,115 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 299 [2018-10-15 12:56:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:17,117 INFO L225 Difference]: With dead ends: 337 [2018-10-15 12:56:17,117 INFO L226 Difference]: Without dead ends: 337 [2018-10-15 12:56:17,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:56:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-15 12:56:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 314. [2018-10-15 12:56:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-15 12:56:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 315 transitions. [2018-10-15 12:56:17,123 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 315 transitions. Word has length 299 [2018-10-15 12:56:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:17,124 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 315 transitions. [2018-10-15 12:56:17,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:56:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 315 transitions. [2018-10-15 12:56:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 12:56:17,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:17,126 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 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] [2018-10-15 12:56:17,126 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:17,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1387218106, now seen corresponding path program 28 times [2018-10-15 12:56:17,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 0 proven. 3808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:19,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:19,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:56:19,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:56:19,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:56:19,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:19,013 INFO L87 Difference]: Start difference. First operand 314 states and 315 transitions. Second operand 59 states. [2018-10-15 12:56:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:21,111 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-10-15 12:56:21,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:56:21,111 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 309 [2018-10-15 12:56:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:21,113 INFO L225 Difference]: With dead ends: 347 [2018-10-15 12:56:21,113 INFO L226 Difference]: Without dead ends: 347 [2018-10-15 12:56:21,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:56:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-15 12:56:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 324. [2018-10-15 12:56:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-15 12:56:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 325 transitions. [2018-10-15 12:56:21,118 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 325 transitions. Word has length 309 [2018-10-15 12:56:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:21,118 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 325 transitions. [2018-10-15 12:56:21,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:56:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 325 transitions. [2018-10-15 12:56:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 12:56:21,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:21,121 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 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] [2018-10-15 12:56:21,121 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:21,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:21,122 INFO L82 PathProgramCache]: Analyzing trace with hash 155560654, now seen corresponding path program 29 times [2018-10-15 12:56:21,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4089 backedges. 0 proven. 4089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:22,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:22,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:56:22,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:56:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:56:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:22,446 INFO L87 Difference]: Start difference. First operand 324 states and 325 transitions. Second operand 61 states. [2018-10-15 12:56:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:24,688 INFO L93 Difference]: Finished difference Result 357 states and 358 transitions. [2018-10-15 12:56:24,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:56:24,689 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 319 [2018-10-15 12:56:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:24,691 INFO L225 Difference]: With dead ends: 357 [2018-10-15 12:56:24,691 INFO L226 Difference]: Without dead ends: 357 [2018-10-15 12:56:24,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:56:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-15 12:56:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 334. [2018-10-15 12:56:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-15 12:56:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2018-10-15 12:56:24,697 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 319 [2018-10-15 12:56:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:24,697 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 335 transitions. [2018-10-15 12:56:24,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:56:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 335 transitions. [2018-10-15 12:56:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-15 12:56:24,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:24,699 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 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] [2018-10-15 12:56:24,700 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:24,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:24,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1116567582, now seen corresponding path program 30 times [2018-10-15 12:56:24,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4380 backedges. 0 proven. 4380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:26,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:26,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:56:26,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:56:26,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:56:26,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:26,248 INFO L87 Difference]: Start difference. First operand 334 states and 335 transitions. Second operand 63 states. [2018-10-15 12:56:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:28,829 INFO L93 Difference]: Finished difference Result 367 states and 368 transitions. [2018-10-15 12:56:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:56:28,829 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 329 [2018-10-15 12:56:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:28,831 INFO L225 Difference]: With dead ends: 367 [2018-10-15 12:56:28,832 INFO L226 Difference]: Without dead ends: 367 [2018-10-15 12:56:28,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:56:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-15 12:56:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 344. [2018-10-15 12:56:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:56:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 345 transitions. [2018-10-15 12:56:28,837 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 345 transitions. Word has length 329 [2018-10-15 12:56:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:28,838 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 345 transitions. [2018-10-15 12:56:28,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:56:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 345 transitions. [2018-10-15 12:56:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 12:56:28,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:28,840 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 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] [2018-10-15 12:56:28,840 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:28,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:28,841 INFO L82 PathProgramCache]: Analyzing trace with hash 986520566, now seen corresponding path program 31 times [2018-10-15 12:56:28,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4681 backedges. 0 proven. 4681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:30,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:30,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:56:30,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:56:30,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:56:30,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:30,341 INFO L87 Difference]: Start difference. First operand 344 states and 345 transitions. Second operand 65 states. [2018-10-15 12:56:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:32,870 INFO L93 Difference]: Finished difference Result 377 states and 378 transitions. [2018-10-15 12:56:32,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:56:32,870 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 339 [2018-10-15 12:56:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:32,872 INFO L225 Difference]: With dead ends: 377 [2018-10-15 12:56:32,872 INFO L226 Difference]: Without dead ends: 377 [2018-10-15 12:56:32,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:56:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-15 12:56:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 354. [2018-10-15 12:56:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-15 12:56:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 355 transitions. [2018-10-15 12:56:32,878 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 355 transitions. Word has length 339 [2018-10-15 12:56:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:32,879 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 355 transitions. [2018-10-15 12:56:32,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:56:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 355 transitions. [2018-10-15 12:56:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 12:56:32,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:32,881 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 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] [2018-10-15 12:56:32,881 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:32,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash 685549322, now seen corresponding path program 32 times [2018-10-15 12:56:32,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 0 proven. 4992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:34,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:34,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:56:34,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:56:34,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:56:34,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:34,706 INFO L87 Difference]: Start difference. First operand 354 states and 355 transitions. Second operand 67 states. [2018-10-15 12:56:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:37,228 INFO L93 Difference]: Finished difference Result 387 states and 388 transitions. [2018-10-15 12:56:37,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:56:37,229 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 349 [2018-10-15 12:56:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:37,231 INFO L225 Difference]: With dead ends: 387 [2018-10-15 12:56:37,231 INFO L226 Difference]: Without dead ends: 387 [2018-10-15 12:56:37,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:56:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-15 12:56:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 364. [2018-10-15 12:56:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-15 12:56:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 365 transitions. [2018-10-15 12:56:37,237 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 365 transitions. Word has length 349 [2018-10-15 12:56:37,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:37,238 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 365 transitions. [2018-10-15 12:56:37,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:56:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 365 transitions. [2018-10-15 12:56:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 12:56:37,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:37,240 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 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] [2018-10-15 12:56:37,240 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:37,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:37,241 INFO L82 PathProgramCache]: Analyzing trace with hash -552048354, now seen corresponding path program 33 times [2018-10-15 12:56:37,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:39,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:39,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:56:39,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:56:39,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:56:39,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:39,089 INFO L87 Difference]: Start difference. First operand 364 states and 365 transitions. Second operand 69 states. [2018-10-15 12:56:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:41,842 INFO L93 Difference]: Finished difference Result 397 states and 398 transitions. [2018-10-15 12:56:41,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:56:41,843 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 359 [2018-10-15 12:56:41,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:41,844 INFO L225 Difference]: With dead ends: 397 [2018-10-15 12:56:41,845 INFO L226 Difference]: Without dead ends: 397 [2018-10-15 12:56:41,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:56:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-15 12:56:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 374. [2018-10-15 12:56:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:56:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 375 transitions. [2018-10-15 12:56:41,850 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 375 transitions. Word has length 359 [2018-10-15 12:56:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:41,851 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 375 transitions. [2018-10-15 12:56:41,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:56:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 375 transitions. [2018-10-15 12:56:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-15 12:56:41,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:41,853 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 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] [2018-10-15 12:56:41,853 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:41,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:41,854 INFO L82 PathProgramCache]: Analyzing trace with hash 954704434, now seen corresponding path program 34 times [2018-10-15 12:56:41,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5644 backedges. 0 proven. 5644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:43,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:43,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:56:43,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:56:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:56:43,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:43,822 INFO L87 Difference]: Start difference. First operand 374 states and 375 transitions. Second operand 71 states. [2018-10-15 12:56:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:46,490 INFO L93 Difference]: Finished difference Result 407 states and 408 transitions. [2018-10-15 12:56:46,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:56:46,500 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 369 [2018-10-15 12:56:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:46,502 INFO L225 Difference]: With dead ends: 407 [2018-10-15 12:56:46,502 INFO L226 Difference]: Without dead ends: 407 [2018-10-15 12:56:46,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:56:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-15 12:56:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 384. [2018-10-15 12:56:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-15 12:56:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2018-10-15 12:56:46,506 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 369 [2018-10-15 12:56:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:46,507 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2018-10-15 12:56:46,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:56:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2018-10-15 12:56:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 12:56:46,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:46,509 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 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] [2018-10-15 12:56:46,509 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:46,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:46,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1772196422, now seen corresponding path program 35 times [2018-10-15 12:56:46,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:48,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:48,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:56:48,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:56:48,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:56:48,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:48,291 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 73 states. [2018-10-15 12:56:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:51,743 INFO L93 Difference]: Finished difference Result 417 states and 418 transitions. [2018-10-15 12:56:51,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:56:51,743 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 379 [2018-10-15 12:56:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:51,745 INFO L225 Difference]: With dead ends: 417 [2018-10-15 12:56:51,745 INFO L226 Difference]: Without dead ends: 417 [2018-10-15 12:56:51,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:56:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-15 12:56:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 394. [2018-10-15 12:56:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-15 12:56:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 395 transitions. [2018-10-15 12:56:51,750 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 395 transitions. Word has length 379 [2018-10-15 12:56:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:51,750 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 395 transitions. [2018-10-15 12:56:51,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:56:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 395 transitions. [2018-10-15 12:56:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-15 12:56:51,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:51,753 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 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] [2018-10-15 12:56:51,753 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:51,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:51,753 INFO L82 PathProgramCache]: Analyzing trace with hash -796034726, now seen corresponding path program 36 times [2018-10-15 12:56:51,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6336 backedges. 0 proven. 6336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:54,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:54,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:56:54,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:56:54,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:56:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:56:54,363 INFO L87 Difference]: Start difference. First operand 394 states and 395 transitions. Second operand 75 states. [2018-10-15 12:56:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:57,548 INFO L93 Difference]: Finished difference Result 427 states and 428 transitions. [2018-10-15 12:56:57,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:56:57,557 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 389 [2018-10-15 12:56:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:57,559 INFO L225 Difference]: With dead ends: 427 [2018-10-15 12:56:57,559 INFO L226 Difference]: Without dead ends: 427 [2018-10-15 12:56:57,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:56:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-15 12:56:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 404. [2018-10-15 12:56:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-15 12:56:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 405 transitions. [2018-10-15 12:56:57,565 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 405 transitions. Word has length 389 [2018-10-15 12:56:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:57,566 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 405 transitions. [2018-10-15 12:56:57,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:56:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 405 transitions. [2018-10-15 12:56:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-15 12:56:57,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:57,568 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 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] [2018-10-15 12:56:57,568 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:57,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:57,572 INFO L82 PathProgramCache]: Analyzing trace with hash -857565330, now seen corresponding path program 37 times [2018-10-15 12:56:57,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6697 backedges. 0 proven. 6697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:59,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:59,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:56:59,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:56:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:56:59,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:56:59,812 INFO L87 Difference]: Start difference. First operand 404 states and 405 transitions. Second operand 77 states. [2018-10-15 12:57:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:02,927 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2018-10-15 12:57:02,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:57:02,928 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 399 [2018-10-15 12:57:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:02,930 INFO L225 Difference]: With dead ends: 437 [2018-10-15 12:57:02,930 INFO L226 Difference]: Without dead ends: 437 [2018-10-15 12:57:02,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:57:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-15 12:57:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 414. [2018-10-15 12:57:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-15 12:57:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 415 transitions. [2018-10-15 12:57:02,935 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 415 transitions. Word has length 399 [2018-10-15 12:57:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:02,936 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 415 transitions. [2018-10-15 12:57:02,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:57:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 415 transitions. [2018-10-15 12:57:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 12:57:02,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:02,938 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 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] [2018-10-15 12:57:02,938 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:02,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1849152382, now seen corresponding path program 38 times [2018-10-15 12:57:02,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7068 backedges. 0 proven. 7068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:05,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:05,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:57:05,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:57:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:57:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:57:05,143 INFO L87 Difference]: Start difference. First operand 414 states and 415 transitions. Second operand 79 states. [2018-10-15 12:57:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:08,793 INFO L93 Difference]: Finished difference Result 447 states and 448 transitions. [2018-10-15 12:57:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:57:08,794 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 409 [2018-10-15 12:57:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:08,795 INFO L225 Difference]: With dead ends: 447 [2018-10-15 12:57:08,795 INFO L226 Difference]: Without dead ends: 447 [2018-10-15 12:57:08,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:57:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-15 12:57:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 424. [2018-10-15 12:57:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-15 12:57:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2018-10-15 12:57:08,801 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 409 [2018-10-15 12:57:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:08,801 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2018-10-15 12:57:08,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:57:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2018-10-15 12:57:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 12:57:08,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:08,804 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 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] [2018-10-15 12:57:08,804 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:08,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash -95061866, now seen corresponding path program 39 times [2018-10-15 12:57:08,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7449 backedges. 0 proven. 7449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:11,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:11,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:57:11,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:57:11,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:57:11,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:11,080 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 81 states. [2018-10-15 12:57:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:14,850 INFO L93 Difference]: Finished difference Result 457 states and 458 transitions. [2018-10-15 12:57:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:57:14,851 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 419 [2018-10-15 12:57:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:14,853 INFO L225 Difference]: With dead ends: 457 [2018-10-15 12:57:14,854 INFO L226 Difference]: Without dead ends: 457 [2018-10-15 12:57:14,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:57:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-15 12:57:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 434. [2018-10-15 12:57:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:57:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 435 transitions. [2018-10-15 12:57:14,859 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 435 transitions. Word has length 419 [2018-10-15 12:57:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:14,859 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 435 transitions. [2018-10-15 12:57:14,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:57:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 435 transitions. [2018-10-15 12:57:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 12:57:14,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:14,862 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 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] [2018-10-15 12:57:14,862 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:14,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:14,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1569831850, now seen corresponding path program 40 times [2018-10-15 12:57:14,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7840 backedges. 0 proven. 7840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:17,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:17,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:57:17,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:57:17,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:57:17,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:17,061 INFO L87 Difference]: Start difference. First operand 434 states and 435 transitions. Second operand 83 states. [2018-10-15 12:57:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:20,862 INFO L93 Difference]: Finished difference Result 467 states and 468 transitions. [2018-10-15 12:57:20,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:57:20,863 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 429 [2018-10-15 12:57:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:20,865 INFO L225 Difference]: With dead ends: 467 [2018-10-15 12:57:20,865 INFO L226 Difference]: Without dead ends: 467 [2018-10-15 12:57:20,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:57:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-15 12:57:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 444. [2018-10-15 12:57:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-15 12:57:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 445 transitions. [2018-10-15 12:57:20,872 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 445 transitions. Word has length 429 [2018-10-15 12:57:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:20,872 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 445 transitions. [2018-10-15 12:57:20,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:57:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 445 transitions. [2018-10-15 12:57:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 12:57:20,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:20,875 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 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] [2018-10-15 12:57:20,875 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:20,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:20,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1651783102, now seen corresponding path program 41 times [2018-10-15 12:57:20,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8241 backedges. 0 proven. 8241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:23,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:23,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:57:23,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:57:23,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:57:23,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:23,212 INFO L87 Difference]: Start difference. First operand 444 states and 445 transitions. Second operand 85 states. [2018-10-15 12:57:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:27,168 INFO L93 Difference]: Finished difference Result 477 states and 478 transitions. [2018-10-15 12:57:27,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:57:27,168 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 439 [2018-10-15 12:57:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:27,171 INFO L225 Difference]: With dead ends: 477 [2018-10-15 12:57:27,171 INFO L226 Difference]: Without dead ends: 477 [2018-10-15 12:57:27,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:57:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-15 12:57:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 454. [2018-10-15 12:57:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-10-15 12:57:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 455 transitions. [2018-10-15 12:57:27,178 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 455 transitions. Word has length 439 [2018-10-15 12:57:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:27,178 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 455 transitions. [2018-10-15 12:57:27,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:57:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 455 transitions. [2018-10-15 12:57:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-10-15 12:57:27,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:27,181 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 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] [2018-10-15 12:57:27,181 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:27,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:27,181 INFO L82 PathProgramCache]: Analyzing trace with hash -740022574, now seen corresponding path program 42 times [2018-10-15 12:57:27,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8652 backedges. 0 proven. 8652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:30,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:30,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:57:30,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:57:30,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:57:30,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:30,320 INFO L87 Difference]: Start difference. First operand 454 states and 455 transitions. Second operand 87 states. [2018-10-15 12:57:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:34,359 INFO L93 Difference]: Finished difference Result 487 states and 488 transitions. [2018-10-15 12:57:34,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:57:34,360 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 449 [2018-10-15 12:57:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:34,362 INFO L225 Difference]: With dead ends: 487 [2018-10-15 12:57:34,362 INFO L226 Difference]: Without dead ends: 487 [2018-10-15 12:57:34,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:57:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-10-15 12:57:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 464. [2018-10-15 12:57:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-10-15 12:57:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2018-10-15 12:57:34,368 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 449 [2018-10-15 12:57:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:34,368 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2018-10-15 12:57:34,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:57:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2018-10-15 12:57:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-15 12:57:34,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:34,371 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 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] [2018-10-15 12:57:34,371 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:34,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:34,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1958268646, now seen corresponding path program 43 times [2018-10-15 12:57:34,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9073 backedges. 0 proven. 9073 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:37,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:37,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:57:37,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:57:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:57:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:37,127 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 89 states. [2018-10-15 12:57:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:41,742 INFO L93 Difference]: Finished difference Result 497 states and 498 transitions. [2018-10-15 12:57:41,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:57:41,743 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 459 [2018-10-15 12:57:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:41,745 INFO L225 Difference]: With dead ends: 497 [2018-10-15 12:57:41,745 INFO L226 Difference]: Without dead ends: 497 [2018-10-15 12:57:41,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:57:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-10-15 12:57:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 474. [2018-10-15 12:57:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-10-15 12:57:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 475 transitions. [2018-10-15 12:57:41,750 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 475 transitions. Word has length 459 [2018-10-15 12:57:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:41,750 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 475 transitions. [2018-10-15 12:57:41,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:57:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 475 transitions. [2018-10-15 12:57:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-15 12:57:41,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:41,752 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 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] [2018-10-15 12:57:41,752 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:41,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:41,753 INFO L82 PathProgramCache]: Analyzing trace with hash -742822406, now seen corresponding path program 44 times [2018-10-15 12:57:41,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 0 proven. 9504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:44,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:44,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:57:44,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:57:44,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:57:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:44,293 INFO L87 Difference]: Start difference. First operand 474 states and 475 transitions. Second operand 91 states. [2018-10-15 12:57:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:49,020 INFO L93 Difference]: Finished difference Result 507 states and 508 transitions. [2018-10-15 12:57:49,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:57:49,020 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 469 [2018-10-15 12:57:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:49,023 INFO L225 Difference]: With dead ends: 507 [2018-10-15 12:57:49,023 INFO L226 Difference]: Without dead ends: 507 [2018-10-15 12:57:49,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:57:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-10-15 12:57:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 484. [2018-10-15 12:57:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-15 12:57:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 485 transitions. [2018-10-15 12:57:49,029 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 485 transitions. Word has length 469 [2018-10-15 12:57:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:49,029 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 485 transitions. [2018-10-15 12:57:49,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:57:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 485 transitions. [2018-10-15 12:57:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 12:57:49,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:49,031 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 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] [2018-10-15 12:57:49,031 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:49,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash 530400270, now seen corresponding path program 45 times [2018-10-15 12:57:49,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9945 backedges. 0 proven. 9945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:52,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:52,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:57:52,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:57:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:57:52,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:52,034 INFO L87 Difference]: Start difference. First operand 484 states and 485 transitions. Second operand 93 states. [2018-10-15 12:57:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:56,928 INFO L93 Difference]: Finished difference Result 517 states and 518 transitions. [2018-10-15 12:57:56,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:57:56,929 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 479 [2018-10-15 12:57:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:56,932 INFO L225 Difference]: With dead ends: 517 [2018-10-15 12:57:56,932 INFO L226 Difference]: Without dead ends: 517 [2018-10-15 12:57:56,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:57:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-15 12:57:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 494. [2018-10-15 12:57:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-10-15 12:57:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 495 transitions. [2018-10-15 12:57:56,937 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 495 transitions. Word has length 479 [2018-10-15 12:57:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:56,938 INFO L481 AbstractCegarLoop]: Abstraction has 494 states and 495 transitions. [2018-10-15 12:57:56,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:57:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 495 transitions. [2018-10-15 12:57:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-10-15 12:57:56,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:56,940 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 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] [2018-10-15 12:57:56,940 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:56,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash -83128030, now seen corresponding path program 46 times [2018-10-15 12:57:56,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10396 backedges. 0 proven. 10396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:59,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:59,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:57:59,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:57:59,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:57:59,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:57:59,788 INFO L87 Difference]: Start difference. First operand 494 states and 495 transitions. Second operand 95 states. [2018-10-15 12:58:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:04,734 INFO L93 Difference]: Finished difference Result 527 states and 528 transitions. [2018-10-15 12:58:04,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:58:04,734 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 489 [2018-10-15 12:58:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:04,737 INFO L225 Difference]: With dead ends: 527 [2018-10-15 12:58:04,737 INFO L226 Difference]: Without dead ends: 527 [2018-10-15 12:58:04,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:58:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-15 12:58:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 504. [2018-10-15 12:58:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-15 12:58:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2018-10-15 12:58:04,743 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 489 [2018-10-15 12:58:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:04,743 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2018-10-15 12:58:04,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:58:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2018-10-15 12:58:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 12:58:04,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:04,746 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 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] [2018-10-15 12:58:04,746 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:04,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1352373558, now seen corresponding path program 47 times [2018-10-15 12:58:04,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:08,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:08,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:58:08,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:58:08,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:58:08,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:58:08,074 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 97 states. [2018-10-15 12:58:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:13,179 INFO L93 Difference]: Finished difference Result 537 states and 538 transitions. [2018-10-15 12:58:13,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:58:13,179 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 499 [2018-10-15 12:58:13,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:13,182 INFO L225 Difference]: With dead ends: 537 [2018-10-15 12:58:13,182 INFO L226 Difference]: Without dead ends: 537 [2018-10-15 12:58:13,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:58:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-15 12:58:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 514. [2018-10-15 12:58:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-10-15 12:58:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 515 transitions. [2018-10-15 12:58:13,189 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 515 transitions. Word has length 499 [2018-10-15 12:58:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:13,190 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 515 transitions. [2018-10-15 12:58:13,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:58:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 515 transitions. [2018-10-15 12:58:13,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-15 12:58:13,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:13,192 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 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] [2018-10-15 12:58:13,192 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:13,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:13,193 INFO L82 PathProgramCache]: Analyzing trace with hash 651464778, now seen corresponding path program 48 times [2018-10-15 12:58:13,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11328 backedges. 0 proven. 11328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:16,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:16,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:58:16,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:58:16,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:58:16,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:16,547 INFO L87 Difference]: Start difference. First operand 514 states and 515 transitions. Second operand 99 states. [2018-10-15 12:58:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:22,065 INFO L93 Difference]: Finished difference Result 547 states and 548 transitions. [2018-10-15 12:58:22,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:58:22,066 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 509 [2018-10-15 12:58:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:22,069 INFO L225 Difference]: With dead ends: 547 [2018-10-15 12:58:22,069 INFO L226 Difference]: Without dead ends: 547 [2018-10-15 12:58:22,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:58:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-10-15 12:58:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 524. [2018-10-15 12:58:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-15 12:58:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 525 transitions. [2018-10-15 12:58:22,075 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 525 transitions. Word has length 509 [2018-10-15 12:58:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:22,076 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 525 transitions. [2018-10-15 12:58:22,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:58:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 525 transitions. [2018-10-15 12:58:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 12:58:22,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:22,078 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 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] [2018-10-15 12:58:22,078 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:22,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1949155934, now seen corresponding path program 49 times [2018-10-15 12:58:22,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11809 backedges. 0 proven. 11809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:25,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:25,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:58:25,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:58:25,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:58:25,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:25,228 INFO L87 Difference]: Start difference. First operand 524 states and 525 transitions. Second operand 101 states. [2018-10-15 12:58:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:31,001 INFO L93 Difference]: Finished difference Result 557 states and 558 transitions. [2018-10-15 12:58:31,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:58:31,001 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 519 [2018-10-15 12:58:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:31,004 INFO L225 Difference]: With dead ends: 557 [2018-10-15 12:58:31,005 INFO L226 Difference]: Without dead ends: 557 [2018-10-15 12:58:31,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:58:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-10-15 12:58:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 534. [2018-10-15 12:58:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-10-15 12:58:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 535 transitions. [2018-10-15 12:58:31,012 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 535 transitions. Word has length 519 [2018-10-15 12:58:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:31,013 INFO L481 AbstractCegarLoop]: Abstraction has 534 states and 535 transitions. [2018-10-15 12:58:31,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:58:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 535 transitions. [2018-10-15 12:58:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-10-15 12:58:31,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:31,016 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 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] [2018-10-15 12:58:31,016 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:31,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash -217158798, now seen corresponding path program 50 times [2018-10-15 12:58:31,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12300 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:34,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:34,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:58:34,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:58:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:58:34,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:34,266 INFO L87 Difference]: Start difference. First operand 534 states and 535 transitions. Second operand 103 states. [2018-10-15 12:58:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:40,131 INFO L93 Difference]: Finished difference Result 567 states and 568 transitions. [2018-10-15 12:58:40,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:58:40,131 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 529 [2018-10-15 12:58:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:40,134 INFO L225 Difference]: With dead ends: 567 [2018-10-15 12:58:40,134 INFO L226 Difference]: Without dead ends: 567 [2018-10-15 12:58:40,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:58:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-10-15 12:58:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 544. [2018-10-15 12:58:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-15 12:58:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2018-10-15 12:58:40,140 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 529 [2018-10-15 12:58:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:40,141 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 545 transitions. [2018-10-15 12:58:40,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:58:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 545 transitions. [2018-10-15 12:58:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-10-15 12:58:40,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:40,145 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 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] [2018-10-15 12:58:40,145 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:40,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:40,145 INFO L82 PathProgramCache]: Analyzing trace with hash -171062394, now seen corresponding path program 51 times [2018-10-15 12:58:40,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12801 backedges. 0 proven. 12801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:43,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:43,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:58:43,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:58:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:58:43,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:43,745 INFO L87 Difference]: Start difference. First operand 544 states and 545 transitions. Second operand 105 states. [2018-10-15 12:58:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:49,888 INFO L93 Difference]: Finished difference Result 577 states and 578 transitions. [2018-10-15 12:58:49,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:58:49,888 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 539 [2018-10-15 12:58:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:49,890 INFO L225 Difference]: With dead ends: 577 [2018-10-15 12:58:49,890 INFO L226 Difference]: Without dead ends: 577 [2018-10-15 12:58:49,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:58:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-10-15 12:58:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 554. [2018-10-15 12:58:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-15 12:58:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 555 transitions. [2018-10-15 12:58:49,896 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 555 transitions. Word has length 539 [2018-10-15 12:58:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:49,896 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 555 transitions. [2018-10-15 12:58:49,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:58:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 555 transitions. [2018-10-15 12:58:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-10-15 12:58:49,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:49,899 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 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] [2018-10-15 12:58:49,899 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:49,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash 984818330, now seen corresponding path program 52 times [2018-10-15 12:58:49,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13312 backedges. 0 proven. 13312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:53,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:53,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:58:53,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:58:53,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:58:53,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:53,566 INFO L87 Difference]: Start difference. First operand 554 states and 555 transitions. Second operand 107 states. [2018-10-15 12:59:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:00,101 INFO L93 Difference]: Finished difference Result 587 states and 588 transitions. [2018-10-15 12:59:00,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:59:00,101 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 549 [2018-10-15 12:59:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:00,103 INFO L225 Difference]: With dead ends: 587 [2018-10-15 12:59:00,103 INFO L226 Difference]: Without dead ends: 587 [2018-10-15 12:59:00,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:59:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-10-15 12:59:00,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 564. [2018-10-15 12:59:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-10-15 12:59:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 565 transitions. [2018-10-15 12:59:00,110 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 565 transitions. Word has length 549 [2018-10-15 12:59:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:00,111 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 565 transitions. [2018-10-15 12:59:00,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:59:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 565 transitions. [2018-10-15 12:59:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 12:59:00,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:00,115 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 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] [2018-10-15 12:59:00,115 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:00,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:00,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1074417490, now seen corresponding path program 53 times [2018-10-15 12:59:00,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 13833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:03,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:03,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:59:03,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:59:03,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:59:03,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:59:03,901 INFO L87 Difference]: Start difference. First operand 564 states and 565 transitions. Second operand 109 states. [2018-10-15 12:59:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:10,187 INFO L93 Difference]: Finished difference Result 597 states and 598 transitions. [2018-10-15 12:59:10,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:59:10,188 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 559 [2018-10-15 12:59:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:10,190 INFO L225 Difference]: With dead ends: 597 [2018-10-15 12:59:10,190 INFO L226 Difference]: Without dead ends: 597 [2018-10-15 12:59:10,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:59:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-15 12:59:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 574. [2018-10-15 12:59:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-10-15 12:59:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 575 transitions. [2018-10-15 12:59:10,197 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 575 transitions. Word has length 559 [2018-10-15 12:59:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:10,197 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 575 transitions. [2018-10-15 12:59:10,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:59:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2018-10-15 12:59:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-10-15 12:59:10,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:10,200 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 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] [2018-10-15 12:59:10,200 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:10,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:10,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1749240382, now seen corresponding path program 54 times [2018-10-15 12:59:10,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14364 backedges. 0 proven. 14364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:14,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:14,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:59:14,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:59:14,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:59:14,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:14,239 INFO L87 Difference]: Start difference. First operand 574 states and 575 transitions. Second operand 111 states. [2018-10-15 12:59:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:20,754 INFO L93 Difference]: Finished difference Result 607 states and 608 transitions. [2018-10-15 12:59:20,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:59:20,755 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 569 [2018-10-15 12:59:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:20,757 INFO L225 Difference]: With dead ends: 607 [2018-10-15 12:59:20,757 INFO L226 Difference]: Without dead ends: 607 [2018-10-15 12:59:20,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:59:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-15 12:59:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 584. [2018-10-15 12:59:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-10-15 12:59:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 585 transitions. [2018-10-15 12:59:20,762 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 585 transitions. Word has length 569 [2018-10-15 12:59:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:20,763 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 585 transitions. [2018-10-15 12:59:20,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:59:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 585 transitions. [2018-10-15 12:59:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-15 12:59:20,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:20,766 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 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] [2018-10-15 12:59:20,766 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:20,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:20,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1138789930, now seen corresponding path program 55 times [2018-10-15 12:59:20,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14905 backedges. 0 proven. 14905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:24,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:59:24,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:59:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:59:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:24,801 INFO L87 Difference]: Start difference. First operand 584 states and 585 transitions. Second operand 113 states. [2018-10-15 12:59:32,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:32,257 INFO L93 Difference]: Finished difference Result 617 states and 618 transitions. [2018-10-15 12:59:32,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:59:32,257 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 579 [2018-10-15 12:59:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:32,260 INFO L225 Difference]: With dead ends: 617 [2018-10-15 12:59:32,260 INFO L226 Difference]: Without dead ends: 617 [2018-10-15 12:59:32,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:59:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-15 12:59:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 594. [2018-10-15 12:59:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-10-15 12:59:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 595 transitions. [2018-10-15 12:59:32,266 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 595 transitions. Word has length 579 [2018-10-15 12:59:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:32,266 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 595 transitions. [2018-10-15 12:59:32,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:59:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 595 transitions. [2018-10-15 12:59:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-10-15 12:59:32,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:32,269 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 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] [2018-10-15 12:59:32,270 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:32,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:32,270 INFO L82 PathProgramCache]: Analyzing trace with hash -484104982, now seen corresponding path program 56 times [2018-10-15 12:59:32,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15456 backedges. 0 proven. 15456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:36,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:36,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:59:36,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:59:36,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:59:36,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:36,529 INFO L87 Difference]: Start difference. First operand 594 states and 595 transitions. Second operand 115 states. [2018-10-15 12:59:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:43,950 INFO L93 Difference]: Finished difference Result 627 states and 628 transitions. [2018-10-15 12:59:43,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:59:43,950 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 589 [2018-10-15 12:59:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:43,952 INFO L225 Difference]: With dead ends: 627 [2018-10-15 12:59:43,952 INFO L226 Difference]: Without dead ends: 627 [2018-10-15 12:59:43,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:59:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-10-15 12:59:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 604. [2018-10-15 12:59:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-10-15 12:59:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 605 transitions. [2018-10-15 12:59:43,959 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 605 transitions. Word has length 589 [2018-10-15 12:59:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:43,959 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 605 transitions. [2018-10-15 12:59:43,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:59:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 605 transitions. [2018-10-15 12:59:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 12:59:43,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:43,962 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 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] [2018-10-15 12:59:43,963 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:43,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:43,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1388646142, now seen corresponding path program 57 times [2018-10-15 12:59:43,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 16017 backedges. 0 proven. 16017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:48,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:48,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:59:48,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:59:48,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:59:48,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:48,243 INFO L87 Difference]: Start difference. First operand 604 states and 605 transitions. Second operand 117 states. [2018-10-15 12:59:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:55,205 INFO L93 Difference]: Finished difference Result 637 states and 638 transitions. [2018-10-15 12:59:55,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:59:55,206 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 599 [2018-10-15 12:59:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:55,208 INFO L225 Difference]: With dead ends: 637 [2018-10-15 12:59:55,208 INFO L226 Difference]: Without dead ends: 637 [2018-10-15 12:59:55,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:59:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-10-15 12:59:55,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 614. [2018-10-15 12:59:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-10-15 12:59:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 615 transitions. [2018-10-15 12:59:55,215 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 615 transitions. Word has length 599 [2018-10-15 12:59:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:55,215 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 615 transitions. [2018-10-15 12:59:55,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:59:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 615 transitions. [2018-10-15 12:59:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-15 12:59:55,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:55,218 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 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] [2018-10-15 12:59:55,218 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:55,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:55,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1259966446, now seen corresponding path program 58 times [2018-10-15 12:59:55,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16588 backedges. 0 proven. 16588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:59,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:59,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:59:59,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:59:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:59:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:59:59,683 INFO L87 Difference]: Start difference. First operand 614 states and 615 transitions. Second operand 119 states. [2018-10-15 13:00:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:07,341 INFO L93 Difference]: Finished difference Result 647 states and 648 transitions. [2018-10-15 13:00:07,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 13:00:07,342 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 609 [2018-10-15 13:00:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:07,344 INFO L225 Difference]: With dead ends: 647 [2018-10-15 13:00:07,344 INFO L226 Difference]: Without dead ends: 647 [2018-10-15 13:00:07,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 13:00:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-10-15 13:00:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 624. [2018-10-15 13:00:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-15 13:00:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 625 transitions. [2018-10-15 13:00:07,350 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 625 transitions. Word has length 609 [2018-10-15 13:00:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:07,351 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 625 transitions. [2018-10-15 13:00:07,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 13:00:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 625 transitions. [2018-10-15 13:00:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-15 13:00:07,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:07,354 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 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] [2018-10-15 13:00:07,354 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:07,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:07,354 INFO L82 PathProgramCache]: Analyzing trace with hash -345995226, now seen corresponding path program 59 times [2018-10-15 13:00:07,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 17169 backedges. 0 proven. 17169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:12,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:12,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 13:00:12,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 13:00:12,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 13:00:12,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:00:12,058 INFO L87 Difference]: Start difference. First operand 624 states and 625 transitions. Second operand 121 states. [2018-10-15 13:00:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:20,215 INFO L93 Difference]: Finished difference Result 657 states and 658 transitions. [2018-10-15 13:00:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 13:00:20,216 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 619 [2018-10-15 13:00:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:20,218 INFO L225 Difference]: With dead ends: 657 [2018-10-15 13:00:20,218 INFO L226 Difference]: Without dead ends: 657 [2018-10-15 13:00:20,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:00:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-10-15 13:00:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 634. [2018-10-15 13:00:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-15 13:00:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 635 transitions. [2018-10-15 13:00:20,224 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 635 transitions. Word has length 619 [2018-10-15 13:00:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:20,224 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 635 transitions. [2018-10-15 13:00:20,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:00:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 635 transitions. [2018-10-15 13:00:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2018-10-15 13:00:20,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:20,227 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 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] [2018-10-15 13:00:20,227 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:20,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash -470116550, now seen corresponding path program 60 times [2018-10-15 13:00:20,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 17760 backedges. 0 proven. 17760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:24,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:24,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:00:24,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:00:24,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:00:24,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:24,977 INFO L87 Difference]: Start difference. First operand 634 states and 635 transitions. Second operand 123 states. [2018-10-15 13:00:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:32,749 INFO L93 Difference]: Finished difference Result 667 states and 668 transitions. [2018-10-15 13:00:32,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 13:00:32,749 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 629 [2018-10-15 13:00:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:32,752 INFO L225 Difference]: With dead ends: 667 [2018-10-15 13:00:32,752 INFO L226 Difference]: Without dead ends: 667 [2018-10-15 13:00:32,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:00:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-15 13:00:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 644. [2018-10-15 13:00:32,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-10-15 13:00:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 645 transitions. [2018-10-15 13:00:32,757 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 645 transitions. Word has length 629 [2018-10-15 13:00:32,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:32,758 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 645 transitions. [2018-10-15 13:00:32,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:00:32,758 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 645 transitions. [2018-10-15 13:00:32,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-15 13:00:32,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:32,761 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 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] [2018-10-15 13:00:32,761 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:32,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:32,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1819008334, now seen corresponding path program 61 times [2018-10-15 13:00:32,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18361 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:37,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:37,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:00:37,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:00:37,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:00:37,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:37,601 INFO L87 Difference]: Start difference. First operand 644 states and 645 transitions. Second operand 125 states. [2018-10-15 13:00:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:46,170 INFO L93 Difference]: Finished difference Result 677 states and 678 transitions. [2018-10-15 13:00:46,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 13:00:46,171 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 639 [2018-10-15 13:00:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:46,173 INFO L225 Difference]: With dead ends: 677 [2018-10-15 13:00:46,173 INFO L226 Difference]: Without dead ends: 677 [2018-10-15 13:00:46,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 13:00:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-10-15 13:00:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 654. [2018-10-15 13:00:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-15 13:00:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 655 transitions. [2018-10-15 13:00:46,179 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 655 transitions. Word has length 639 [2018-10-15 13:00:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:46,179 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 655 transitions. [2018-10-15 13:00:46,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:00:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 655 transitions. [2018-10-15 13:00:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-15 13:00:46,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:46,182 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 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] [2018-10-15 13:00:46,183 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:46,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash 106666594, now seen corresponding path program 62 times [2018-10-15 13:00:46,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18972 backedges. 0 proven. 18972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:51,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:51,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:00:51,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:00:51,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:00:51,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:51,258 INFO L87 Difference]: Start difference. First operand 654 states and 655 transitions. Second operand 127 states. [2018-10-15 13:00:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:59,763 INFO L93 Difference]: Finished difference Result 687 states and 688 transitions. [2018-10-15 13:00:59,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 13:00:59,764 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 649 [2018-10-15 13:00:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:59,767 INFO L225 Difference]: With dead ends: 687 [2018-10-15 13:00:59,767 INFO L226 Difference]: Without dead ends: 687 [2018-10-15 13:00:59,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:00:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-15 13:00:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 664. [2018-10-15 13:00:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-15 13:00:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 665 transitions. [2018-10-15 13:00:59,774 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 665 transitions. Word has length 649 [2018-10-15 13:00:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:59,775 INFO L481 AbstractCegarLoop]: Abstraction has 664 states and 665 transitions. [2018-10-15 13:00:59,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:00:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 665 transitions. [2018-10-15 13:00:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-10-15 13:00:59,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:59,778 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 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] [2018-10-15 13:00:59,778 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:59,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1151267210, now seen corresponding path program 63 times [2018-10-15 13:00:59,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 19593 backedges. 0 proven. 19593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:05,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:05,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:01:05,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:01:05,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:01:05,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:01:05,006 INFO L87 Difference]: Start difference. First operand 664 states and 665 transitions. Second operand 129 states. [2018-10-15 13:01:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:13,218 INFO L93 Difference]: Finished difference Result 697 states and 698 transitions. [2018-10-15 13:01:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:01:13,218 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 659 [2018-10-15 13:01:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:13,221 INFO L225 Difference]: With dead ends: 697 [2018-10-15 13:01:13,222 INFO L226 Difference]: Without dead ends: 697 [2018-10-15 13:01:13,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 13:01:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-10-15 13:01:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 674. [2018-10-15 13:01:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-10-15 13:01:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 675 transitions. [2018-10-15 13:01:13,228 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 675 transitions. Word has length 659 [2018-10-15 13:01:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:13,230 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 675 transitions. [2018-10-15 13:01:13,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:01:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 675 transitions. [2018-10-15 13:01:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-10-15 13:01:13,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:13,234 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 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] [2018-10-15 13:01:13,234 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:13,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:13,235 INFO L82 PathProgramCache]: Analyzing trace with hash -251430518, now seen corresponding path program 64 times [2018-10-15 13:01:13,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 20224 backedges. 0 proven. 20224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:18,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:18,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:01:18,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:01:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:01:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:01:18,590 INFO L87 Difference]: Start difference. First operand 674 states and 675 transitions. Second operand 131 states. [2018-10-15 13:01:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:27,992 INFO L93 Difference]: Finished difference Result 707 states and 708 transitions. [2018-10-15 13:01:27,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 13:01:27,993 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 669 [2018-10-15 13:01:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:27,995 INFO L225 Difference]: With dead ends: 707 [2018-10-15 13:01:27,995 INFO L226 Difference]: Without dead ends: 707 [2018-10-15 13:01:27,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:01:27,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-10-15 13:01:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 684. [2018-10-15 13:01:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2018-10-15 13:01:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 685 transitions. [2018-10-15 13:01:28,002 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 685 transitions. Word has length 669 [2018-10-15 13:01:28,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:28,002 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 685 transitions. [2018-10-15 13:01:28,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:01:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 685 transitions. [2018-10-15 13:01:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-10-15 13:01:28,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:28,006 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 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] [2018-10-15 13:01:28,006 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:28,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1018829726, now seen corresponding path program 65 times [2018-10-15 13:01:28,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 20865 backedges. 0 proven. 20865 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:33,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:33,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:01:33,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:01:33,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:01:33,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:33,511 INFO L87 Difference]: Start difference. First operand 684 states and 685 transitions. Second operand 133 states. [2018-10-15 13:01:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:43,190 INFO L93 Difference]: Finished difference Result 717 states and 718 transitions. [2018-10-15 13:01:43,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 13:01:43,191 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 679 [2018-10-15 13:01:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:43,193 INFO L225 Difference]: With dead ends: 717 [2018-10-15 13:01:43,193 INFO L226 Difference]: Without dead ends: 717 [2018-10-15 13:01:43,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:01:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-15 13:01:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 694. [2018-10-15 13:01:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-15 13:01:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 695 transitions. [2018-10-15 13:01:43,200 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 695 transitions. Word has length 679 [2018-10-15 13:01:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:43,200 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 695 transitions. [2018-10-15 13:01:43,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:01:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 695 transitions. [2018-10-15 13:01:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-10-15 13:01:43,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:43,204 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 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] [2018-10-15 13:01:43,204 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:43,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:43,204 INFO L82 PathProgramCache]: Analyzing trace with hash 938226866, now seen corresponding path program 66 times [2018-10-15 13:01:43,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21516 backedges. 0 proven. 21516 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:49,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:49,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:01:49,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:01:49,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:01:49,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:49,038 INFO L87 Difference]: Start difference. First operand 694 states and 695 transitions. Second operand 135 states. [2018-10-15 13:01:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:59,145 INFO L93 Difference]: Finished difference Result 727 states and 728 transitions. [2018-10-15 13:01:59,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 13:01:59,145 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 689 [2018-10-15 13:01:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:59,148 INFO L225 Difference]: With dead ends: 727 [2018-10-15 13:01:59,148 INFO L226 Difference]: Without dead ends: 727 [2018-10-15 13:01:59,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 13:01:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-15 13:01:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 704. [2018-10-15 13:01:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-10-15 13:01:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 705 transitions. [2018-10-15 13:01:59,154 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 705 transitions. Word has length 689 [2018-10-15 13:01:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:59,154 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 705 transitions. [2018-10-15 13:01:59,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:01:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 705 transitions. [2018-10-15 13:01:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-15 13:01:59,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:59,158 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 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] [2018-10-15 13:01:59,158 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:59,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1408304326, now seen corresponding path program 67 times [2018-10-15 13:01:59,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 22177 backedges. 0 proven. 22177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:04,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:04,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:02:04,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:02:04,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:02:04,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:02:04,977 INFO L87 Difference]: Start difference. First operand 704 states and 705 transitions. Second operand 137 states. [2018-10-15 13:02:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:14,369 INFO L93 Difference]: Finished difference Result 737 states and 738 transitions. [2018-10-15 13:02:14,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 13:02:14,370 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 699 [2018-10-15 13:02:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:14,373 INFO L225 Difference]: With dead ends: 737 [2018-10-15 13:02:14,374 INFO L226 Difference]: Without dead ends: 737 [2018-10-15 13:02:14,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:02:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-10-15 13:02:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 714. [2018-10-15 13:02:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-10-15 13:02:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 715 transitions. [2018-10-15 13:02:14,381 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 715 transitions. Word has length 699 [2018-10-15 13:02:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:14,381 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 715 transitions. [2018-10-15 13:02:14,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:02:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 715 transitions. [2018-10-15 13:02:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-10-15 13:02:14,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:14,385 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 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] [2018-10-15 13:02:14,385 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:14,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:14,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1374696486, now seen corresponding path program 68 times [2018-10-15 13:02:14,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 22848 backedges. 0 proven. 22848 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:20,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:20,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:02:20,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:02:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:02:20,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:02:20,556 INFO L87 Difference]: Start difference. First operand 714 states and 715 transitions. Second operand 139 states. [2018-10-15 13:02:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:30,686 INFO L93 Difference]: Finished difference Result 747 states and 748 transitions. [2018-10-15 13:02:30,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 13:02:30,686 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 709 [2018-10-15 13:02:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:30,689 INFO L225 Difference]: With dead ends: 747 [2018-10-15 13:02:30,689 INFO L226 Difference]: Without dead ends: 747 [2018-10-15 13:02:30,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:02:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-10-15 13:02:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 724. [2018-10-15 13:02:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-15 13:02:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 725 transitions. [2018-10-15 13:02:30,696 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 725 transitions. Word has length 709 [2018-10-15 13:02:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:30,697 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 725 transitions. [2018-10-15 13:02:30,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:02:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 725 transitions. [2018-10-15 13:02:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-15 13:02:30,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:30,700 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 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] [2018-10-15 13:02:30,701 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:30,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:30,701 INFO L82 PathProgramCache]: Analyzing trace with hash -478164498, now seen corresponding path program 69 times [2018-10-15 13:02:30,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 23529 backedges. 0 proven. 23529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:37,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:37,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:02:37,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:02:37,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:02:37,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:37,119 INFO L87 Difference]: Start difference. First operand 724 states and 725 transitions. Second operand 141 states. [2018-10-15 13:02:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:47,727 INFO L93 Difference]: Finished difference Result 757 states and 758 transitions. [2018-10-15 13:02:47,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 13:02:47,728 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 719 [2018-10-15 13:02:47,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:47,730 INFO L225 Difference]: With dead ends: 757 [2018-10-15 13:02:47,730 INFO L226 Difference]: Without dead ends: 757 [2018-10-15 13:02:47,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 13:02:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-15 13:02:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 734. [2018-10-15 13:02:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-10-15 13:02:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 735 transitions. [2018-10-15 13:02:47,736 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 735 transitions. Word has length 719 [2018-10-15 13:02:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:47,737 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 735 transitions. [2018-10-15 13:02:47,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:02:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 735 transitions. [2018-10-15 13:02:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-10-15 13:02:47,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:47,741 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 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] [2018-10-15 13:02:47,741 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:47,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -446152958, now seen corresponding path program 70 times [2018-10-15 13:02:47,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 24220 backedges. 0 proven. 24220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:54,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:54,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:02:54,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:02:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:02:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:54,202 INFO L87 Difference]: Start difference. First operand 734 states and 735 transitions. Second operand 143 states. [2018-10-15 13:03:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:04,615 INFO L93 Difference]: Finished difference Result 767 states and 768 transitions. [2018-10-15 13:03:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:03:04,616 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 729 [2018-10-15 13:03:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:04,619 INFO L225 Difference]: With dead ends: 767 [2018-10-15 13:03:04,619 INFO L226 Difference]: Without dead ends: 767 [2018-10-15 13:03:04,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 13:03:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-10-15 13:03:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 744. [2018-10-15 13:03:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-15 13:03:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 745 transitions. [2018-10-15 13:03:04,626 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 745 transitions. Word has length 729 [2018-10-15 13:03:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:04,626 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 745 transitions. [2018-10-15 13:03:04,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:03:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 745 transitions. [2018-10-15 13:03:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-15 13:03:04,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:04,630 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 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] [2018-10-15 13:03:04,630 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:04,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash -857707754, now seen corresponding path program 71 times [2018-10-15 13:03:04,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 24921 backedges. 0 proven. 24921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:11,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:11,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:03:11,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:03:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:03:11,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:03:11,205 INFO L87 Difference]: Start difference. First operand 744 states and 745 transitions. Second operand 145 states. [2018-10-15 13:03:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:22,449 INFO L93 Difference]: Finished difference Result 777 states and 778 transitions. [2018-10-15 13:03:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 13:03:22,450 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 739 [2018-10-15 13:03:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:22,453 INFO L225 Difference]: With dead ends: 777 [2018-10-15 13:03:22,453 INFO L226 Difference]: Without dead ends: 777 [2018-10-15 13:03:22,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 13:03:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-10-15 13:03:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 754. [2018-10-15 13:03:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-10-15 13:03:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 755 transitions. [2018-10-15 13:03:22,461 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 755 transitions. Word has length 739 [2018-10-15 13:03:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:22,461 INFO L481 AbstractCegarLoop]: Abstraction has 754 states and 755 transitions. [2018-10-15 13:03:22,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:03:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 755 transitions. [2018-10-15 13:03:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-15 13:03:22,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:22,466 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 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] [2018-10-15 13:03:22,466 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:22,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:22,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1360032214, now seen corresponding path program 72 times [2018-10-15 13:03:22,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 25632 backedges. 0 proven. 25632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:29,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:29,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:03:29,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:03:29,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:03:29,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:03:29,511 INFO L87 Difference]: Start difference. First operand 754 states and 755 transitions. Second operand 147 states. [2018-10-15 13:03:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:40,965 INFO L93 Difference]: Finished difference Result 787 states and 788 transitions. [2018-10-15 13:03:40,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 13:03:40,965 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 749 [2018-10-15 13:03:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:40,969 INFO L225 Difference]: With dead ends: 787 [2018-10-15 13:03:40,969 INFO L226 Difference]: Without dead ends: 787 [2018-10-15 13:03:40,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 13:03:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-10-15 13:03:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 764. [2018-10-15 13:03:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-10-15 13:03:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 765 transitions. [2018-10-15 13:03:40,978 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 765 transitions. Word has length 749 [2018-10-15 13:03:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:40,979 INFO L481 AbstractCegarLoop]: Abstraction has 764 states and 765 transitions. [2018-10-15 13:03:40,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 13:03:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 765 transitions. [2018-10-15 13:03:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-10-15 13:03:40,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:40,984 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 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] [2018-10-15 13:03:40,985 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:40,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:40,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1888282686, now seen corresponding path program 73 times [2018-10-15 13:03:40,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat