java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:44:59,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:44:59,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:44:59,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:44:59,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:44:59,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:44:59,172 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:44:59,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:44:59,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:44:59,180 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:44:59,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:44:59,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:44:59,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:44:59,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:44:59,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:44:59,190 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:44:59,191 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:44:59,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:44:59,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:44:59,206 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:44:59,207 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:44:59,208 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:44:59,212 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:44:59,212 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:44:59,212 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:44:59,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:44:59,217 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:44:59,217 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:44:59,218 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:44:59,220 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:44:59,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:44:59,221 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:44:59,221 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:44:59,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:44:59,223 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:44:59,223 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:44:59,224 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 16:44:59,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:44:59,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:44:59,234 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:44:59,235 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:44:59,235 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:44:59,235 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:44:59,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:44:59,236 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:44:59,236 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:44:59,236 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:44:59,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:44:59,237 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:44:59,237 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:44:59,238 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:44:59,238 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:44:59,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:44:59,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:44:59,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:44:59,318 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:44:59,319 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:44:59,320 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl [2018-10-10 16:44:59,320 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl' [2018-10-10 16:44:59,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:44:59,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:44:59,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:44:59,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:44:59,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:44:59,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:59" (1/1) ... [2018-10-10 16:44:59,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:59" (1/1) ... [2018-10-10 16:44:59,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:59" (1/1) ... [2018-10-10 16:44:59,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:59" (1/1) ... [2018-10-10 16:44:59,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:59" (1/1) ... [2018-10-10 16:44:59,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:59" (1/1) ... [2018-10-10 16:44:59,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:59" (1/1) ... [2018-10-10 16:44:59,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:44:59,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:44:59,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:44:59,441 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:44:59,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 16:44:59,512 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:44:59,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:44:59,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:44:59,992 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:44:59,992 INFO L202 PluginConnector]: Adding new model standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:44:59 BoogieIcfgContainer [2018-10-10 16:44:59,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:44:59,993 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:44:59,993 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:44:59,995 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:44:59,999 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:44:59" (1/1) ... [2018-10-10 16:45:00,010 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:45:00,010 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:45:00,064 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:45:00,134 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:45:00,155 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:45:00,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:45:10,299 INFO L315 AbstractInterpreter]: Visited 58 different actions 120 times. Merged at 30 different actions 60 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-10-10 16:45:10,301 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:45:10,305 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:45:10,316 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_7|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:45:10,318 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_7|) |v_ULTIMATE.start_read~int_#ptr.offset_5|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:45:10,324 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_13|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:45:10,325 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_13|) |v_ULTIMATE.start_read~int_#ptr.offset_9|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:45:10,372 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-10 16:45:10,374 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:45:10,375 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:45:10,375 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:45:10,375 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:45:10,375 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:45:10,376 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:45:10,376 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:45:10,376 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:45:10,376 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:45:10,377 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:45:10,377 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:45:10,377 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:45:10,379 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:45:10,380 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:45:10,380 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:45:10,381 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:45:10,408 INFO L202 PluginConnector]: Adding new model standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:45:10 BasicIcfg [2018-10-10 16:45:10,409 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:45:10,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:45:10,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:45:10,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:45:10,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:59" (1/3) ... [2018-10-10 16:45:10,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396cef29 and model type standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:45:10, skipping insertion in model container [2018-10-10 16:45:10,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:44:59" (2/3) ... [2018-10-10 16:45:10,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396cef29 and model type standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:45:10, skipping insertion in model container [2018-10-10 16:45:10,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:45:10" (3/3) ... [2018-10-10 16:45:10,421 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:45:10,433 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:45:10,443 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:45:10,462 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:45:10,498 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:45:10,499 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:45:10,499 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:45:10,499 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:45:10,499 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:45:10,499 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:45:10,501 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:45:10,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:45:10,501 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:45:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-10 16:45:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 16:45:10,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:10,549 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] [2018-10-10 16:45:10,550 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:10,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:10,560 INFO L82 PathProgramCache]: Analyzing trace with hash 935810993, now seen corresponding path program 1 times [2018-10-10 16:45:10,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:11,425 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:45:12,571 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 16:45:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:12,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:45:12,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 16:45:12,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:45:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:45:12,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:45:12,964 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 12 states. [2018-10-10 16:45:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:14,655 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-10 16:45:14,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 16:45:14,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-10-10 16:45:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:14,668 INFO L225 Difference]: With dead ends: 85 [2018-10-10 16:45:14,668 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 16:45:14,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:45:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 16:45:14,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2018-10-10 16:45:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-10 16:45:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-10 16:45:14,722 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 30 [2018-10-10 16:45:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:14,723 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-10 16:45:14,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:45:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-10 16:45:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-10 16:45:14,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:14,727 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:14,728 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:14,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:14,728 INFO L82 PathProgramCache]: Analyzing trace with hash 465255713, now seen corresponding path program 1 times [2018-10-10 16:45:14,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:15,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:15,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:45:15,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:45:15,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:45:15,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:45:15,437 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 15 states. [2018-10-10 16:45:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:16,750 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 16:45:16,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:45:16,751 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-10 16:45:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:16,754 INFO L225 Difference]: With dead ends: 113 [2018-10-10 16:45:16,755 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 16:45:16,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:45:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 16:45:16,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2018-10-10 16:45:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-10 16:45:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-10 16:45:16,765 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 58 [2018-10-10 16:45:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:16,766 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-10 16:45:16,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:45:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-10 16:45:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 16:45:16,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:16,769 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:16,769 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:16,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash -276194671, now seen corresponding path program 2 times [2018-10-10 16:45:16,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:17,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:17,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:45:17,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:45:17,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:45:17,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:45:17,322 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 16 states. [2018-10-10 16:45:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:18,628 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-10 16:45:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 16:45:18,629 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-10-10 16:45:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:18,632 INFO L225 Difference]: With dead ends: 141 [2018-10-10 16:45:18,632 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 16:45:18,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:45:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 16:45:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2018-10-10 16:45:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 16:45:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-10 16:45:18,643 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 86 [2018-10-10 16:45:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:18,644 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-10 16:45:18,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:45:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-10 16:45:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-10 16:45:18,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:18,648 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:18,649 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:18,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:18,649 INFO L82 PathProgramCache]: Analyzing trace with hash 994996225, now seen corresponding path program 3 times [2018-10-10 16:45:18,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:19,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:19,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 16:45:19,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 16:45:19,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 16:45:19,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:45:19,296 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 17 states. [2018-10-10 16:45:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:21,368 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-10 16:45:21,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 16:45:21,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-10-10 16:45:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:21,372 INFO L225 Difference]: With dead ends: 169 [2018-10-10 16:45:21,372 INFO L226 Difference]: Without dead ends: 169 [2018-10-10 16:45:21,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:45:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-10 16:45:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2018-10-10 16:45:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 16:45:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-10 16:45:21,386 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 114 [2018-10-10 16:45:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:21,386 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-10 16:45:21,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 16:45:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-10 16:45:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-10 16:45:21,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:21,391 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:21,391 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:21,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2061124239, now seen corresponding path program 4 times [2018-10-10 16:45:21,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:22,060 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:45:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:22,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:22,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:45:22,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:45:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:45:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:45:22,526 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 18 states. [2018-10-10 16:45:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:24,160 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 16:45:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:45:24,168 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-10-10 16:45:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:24,170 INFO L225 Difference]: With dead ends: 197 [2018-10-10 16:45:24,170 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 16:45:24,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:45:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 16:45:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 171. [2018-10-10 16:45:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 16:45:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-10 16:45:24,182 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 142 [2018-10-10 16:45:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:24,182 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-10 16:45:24,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:45:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-10 16:45:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 16:45:24,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:24,186 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:24,186 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:24,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:24,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1361806049, now seen corresponding path program 5 times [2018-10-10 16:45:24,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:24,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:24,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:45:24,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:45:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:45:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:45:24,942 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 19 states. [2018-10-10 16:45:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:26,981 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-10 16:45:26,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:45:26,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 170 [2018-10-10 16:45:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:26,985 INFO L225 Difference]: With dead ends: 225 [2018-10-10 16:45:26,985 INFO L226 Difference]: Without dead ends: 225 [2018-10-10 16:45:26,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:45:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-10 16:45:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2018-10-10 16:45:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 16:45:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-10 16:45:26,998 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 170 [2018-10-10 16:45:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:26,999 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-10 16:45:26,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:45:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-10 16:45:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-10 16:45:27,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:27,003 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:27,003 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:27,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash 561758289, now seen corresponding path program 6 times [2018-10-10 16:45:27,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:28,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:28,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:45:28,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:45:28,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:45:28,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:45:28,370 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 20 states. [2018-10-10 16:45:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:30,812 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-10 16:45:30,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 16:45:30,812 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 198 [2018-10-10 16:45:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:30,815 INFO L225 Difference]: With dead ends: 253 [2018-10-10 16:45:30,815 INFO L226 Difference]: Without dead ends: 253 [2018-10-10 16:45:30,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=380, Invalid=1260, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:45:30,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-10 16:45:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2018-10-10 16:45:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-10 16:45:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-10 16:45:30,823 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 198 [2018-10-10 16:45:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:30,823 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-10 16:45:30,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:45:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-10 16:45:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-10 16:45:30,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:30,827 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:30,827 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:30,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:30,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1983018433, now seen corresponding path program 7 times [2018-10-10 16:45:30,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:31,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:31,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:45:31,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:45:31,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:45:31,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:45:31,667 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 21 states. [2018-10-10 16:45:34,389 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-10 16:45:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:34,824 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-10 16:45:34,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:45:34,826 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 226 [2018-10-10 16:45:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:34,829 INFO L225 Difference]: With dead ends: 281 [2018-10-10 16:45:34,829 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 16:45:34,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:45:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 16:45:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 255. [2018-10-10 16:45:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 16:45:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-10 16:45:34,838 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 226 [2018-10-10 16:45:34,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:34,838 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-10 16:45:34,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:45:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-10 16:45:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 16:45:34,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:34,841 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:34,841 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:34,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash -848583887, now seen corresponding path program 8 times [2018-10-10 16:45:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:35,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:35,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:45:35,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:45:35,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:45:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:45:35,991 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 22 states. [2018-10-10 16:45:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:39,105 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-10 16:45:39,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 16:45:39,106 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 254 [2018-10-10 16:45:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:39,108 INFO L225 Difference]: With dead ends: 309 [2018-10-10 16:45:39,108 INFO L226 Difference]: Without dead ends: 309 [2018-10-10 16:45:39,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:45:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-10 16:45:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2018-10-10 16:45:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 16:45:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-10 16:45:39,115 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 254 [2018-10-10 16:45:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:39,116 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-10 16:45:39,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:45:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-10 16:45:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-10 16:45:39,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:39,118 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:39,118 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:39,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1555871583, now seen corresponding path program 9 times [2018-10-10 16:45:39,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:39,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:39,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:45:39,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:45:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:45:39,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:45:39,967 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 23 states. [2018-10-10 16:45:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:43,328 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-10 16:45:43,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 16:45:43,328 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 282 [2018-10-10 16:45:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:43,330 INFO L225 Difference]: With dead ends: 337 [2018-10-10 16:45:43,331 INFO L226 Difference]: Without dead ends: 337 [2018-10-10 16:45:43,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:45:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-10 16:45:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 311. [2018-10-10 16:45:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-10 16:45:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-10 16:45:43,337 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 282 [2018-10-10 16:45:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:43,338 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-10 16:45:43,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:45:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-10 16:45:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-10 16:45:43,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:43,340 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:43,340 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:43,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:43,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1909810705, now seen corresponding path program 10 times [2018-10-10 16:45:43,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 0 proven. 1290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:44,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:44,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:45:44,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:45:44,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:45:44,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:45:44,390 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 24 states. [2018-10-10 16:45:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:48,079 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-10 16:45:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 16:45:48,080 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 310 [2018-10-10 16:45:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:48,082 INFO L225 Difference]: With dead ends: 365 [2018-10-10 16:45:48,082 INFO L226 Difference]: Without dead ends: 365 [2018-10-10 16:45:48,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=476, Invalid=1876, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:45:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-10 16:45:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 339. [2018-10-10 16:45:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-10 16:45:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-10 16:45:48,089 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 310 [2018-10-10 16:45:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:48,090 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-10 16:45:48,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:45:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-10 16:45:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-10 16:45:48,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:48,093 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:48,093 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:48,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1321337983, now seen corresponding path program 11 times [2018-10-10 16:45:48,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1573 backedges. 0 proven. 1573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:49,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:49,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:45:49,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:45:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:45:49,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:45:49,553 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 25 states. [2018-10-10 16:45:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:54,100 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-10 16:45:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:45:54,103 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 338 [2018-10-10 16:45:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:54,105 INFO L225 Difference]: With dead ends: 393 [2018-10-10 16:45:54,105 INFO L226 Difference]: Without dead ends: 393 [2018-10-10 16:45:54,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:45:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-10 16:45:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 367. [2018-10-10 16:45:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-10 16:45:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-10 16:45:54,113 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 338 [2018-10-10 16:45:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:54,113 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-10 16:45:54,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:45:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-10 16:45:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-10 16:45:54,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:54,116 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:54,116 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:54,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash -677836559, now seen corresponding path program 12 times [2018-10-10 16:45:54,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1884 backedges. 0 proven. 1884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:56,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:56,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:45:56,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:45:56,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:45:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:45:56,250 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 26 states. [2018-10-10 16:46:01,434 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-10 16:46:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:01,803 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-10 16:46:01,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 16:46:01,804 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 366 [2018-10-10 16:46:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:01,806 INFO L225 Difference]: With dead ends: 421 [2018-10-10 16:46:01,806 INFO L226 Difference]: Without dead ends: 421 [2018-10-10 16:46:01,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:46:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-10 16:46:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 395. [2018-10-10 16:46:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-10 16:46:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-10 16:46:01,814 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 366 [2018-10-10 16:46:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:01,815 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-10 16:46:01,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:46:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-10 16:46:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-10 16:46:01,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:01,817 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:01,818 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:01,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1493339745, now seen corresponding path program 13 times [2018-10-10 16:46:01,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:03,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:03,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:46:03,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:46:03,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:46:03,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:46:03,652 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 27 states. [2018-10-10 16:46:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:08,868 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-10 16:46:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 16:46:08,869 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 394 [2018-10-10 16:46:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:08,872 INFO L225 Difference]: With dead ends: 449 [2018-10-10 16:46:08,872 INFO L226 Difference]: Without dead ends: 449 [2018-10-10 16:46:08,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=548, Invalid=2422, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:46:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-10 16:46:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 423. [2018-10-10 16:46:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-10 16:46:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-10 16:46:08,881 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 394 [2018-10-10 16:46:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:08,883 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-10 16:46:08,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:46:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-10 16:46:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-10 16:46:08,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:08,886 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:08,886 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:08,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:08,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1483306031, now seen corresponding path program 14 times [2018-10-10 16:46:08,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2590 backedges. 0 proven. 2590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:10,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:10,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:46:10,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:46:10,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:46:10,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:46:10,495 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 28 states. [2018-10-10 16:46:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:16,521 INFO L93 Difference]: Finished difference Result 477 states and 477 transitions. [2018-10-10 16:46:16,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:46:16,521 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 422 [2018-10-10 16:46:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:16,523 INFO L225 Difference]: With dead ends: 477 [2018-10-10 16:46:16,523 INFO L226 Difference]: Without dead ends: 477 [2018-10-10 16:46:16,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=572, Invalid=2620, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 16:46:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-10 16:46:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 451. [2018-10-10 16:46:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-10 16:46:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-10 16:46:16,532 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 422 [2018-10-10 16:46:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:16,532 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-10 16:46:16,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:46:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-10 16:46:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-10 16:46:16,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:16,536 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:16,536 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:16,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:16,536 INFO L82 PathProgramCache]: Analyzing trace with hash 863043905, now seen corresponding path program 15 times [2018-10-10 16:46:16,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:18,323 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 16:46:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2985 backedges. 0 proven. 2985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:19,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:19,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:46:19,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:46:19,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:46:19,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:46:19,004 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 29 states. [2018-10-10 16:46:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:25,492 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-10-10 16:46:25,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 16:46:25,493 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 450 [2018-10-10 16:46:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:25,497 INFO L225 Difference]: With dead ends: 505 [2018-10-10 16:46:25,497 INFO L226 Difference]: Without dead ends: 505 [2018-10-10 16:46:25,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=596, Invalid=2826, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:46:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-10 16:46:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 479. [2018-10-10 16:46:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-10 16:46:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-10 16:46:25,506 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 450 [2018-10-10 16:46:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:25,506 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-10 16:46:25,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:46:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-10 16:46:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-10 16:46:25,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:25,510 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:25,510 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:25,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1789783729, now seen corresponding path program 16 times [2018-10-10 16:46:25,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:26,081 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:46:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3408 backedges. 0 proven. 3408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:27,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:27,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:46:27,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:46:27,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:46:27,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:46:27,638 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 30 states. [2018-10-10 16:46:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:35,004 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-10 16:46:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 16:46:35,005 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 478 [2018-10-10 16:46:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:35,007 INFO L225 Difference]: With dead ends: 533 [2018-10-10 16:46:35,007 INFO L226 Difference]: Without dead ends: 533 [2018-10-10 16:46:35,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=620, Invalid=3040, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 16:46:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-10 16:46:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 507. [2018-10-10 16:46:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-10 16:46:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2018-10-10 16:46:35,016 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 478 [2018-10-10 16:46:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:35,017 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 507 transitions. [2018-10-10 16:46:35,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:46:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 507 transitions. [2018-10-10 16:46:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-10 16:46:35,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:35,020 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:35,021 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:35,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:35,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1184279519, now seen corresponding path program 17 times [2018-10-10 16:46:35,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3859 backedges. 0 proven. 3859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:37,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:37,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:46:37,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:46:37,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:46:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:46:37,233 INFO L87 Difference]: Start difference. First operand 507 states and 507 transitions. Second operand 31 states. [2018-10-10 16:46:41,335 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-10 16:46:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:45,299 INFO L93 Difference]: Finished difference Result 561 states and 561 transitions. [2018-10-10 16:46:45,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:46:45,300 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 506 [2018-10-10 16:46:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:45,302 INFO L225 Difference]: With dead ends: 561 [2018-10-10 16:46:45,303 INFO L226 Difference]: Without dead ends: 561 [2018-10-10 16:46:45,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=644, Invalid=3262, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:46:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-10 16:46:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 535. [2018-10-10 16:46:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-10 16:46:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 535 transitions. [2018-10-10 16:46:45,310 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 535 transitions. Word has length 506 [2018-10-10 16:46:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:45,311 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 535 transitions. [2018-10-10 16:46:45,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:46:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 535 transitions. [2018-10-10 16:46:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-10 16:46:45,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:45,315 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:45,315 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:45,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:45,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1983958639, now seen corresponding path program 18 times [2018-10-10 16:46:45,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:46,033 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:46:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4338 backedges. 0 proven. 4338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:47,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:47,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:46:47,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:46:47,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:46:47,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:46:47,916 INFO L87 Difference]: Start difference. First operand 535 states and 535 transitions. Second operand 32 states. [2018-10-10 16:46:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:56,462 INFO L93 Difference]: Finished difference Result 589 states and 589 transitions. [2018-10-10 16:46:56,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 16:46:56,463 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 534 [2018-10-10 16:46:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:56,465 INFO L225 Difference]: With dead ends: 589 [2018-10-10 16:46:56,465 INFO L226 Difference]: Without dead ends: 589 [2018-10-10 16:46:56,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=668, Invalid=3492, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 16:46:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-10 16:46:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 563. [2018-10-10 16:46:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-10 16:46:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-10 16:46:56,473 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 534 [2018-10-10 16:46:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:56,474 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-10 16:46:56,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:46:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-10 16:46:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-10 16:46:56,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:56,478 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:56,478 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:56,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1137411841, now seen corresponding path program 19 times [2018-10-10 16:46:56,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:58,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:58,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 16:46:58,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 16:46:58,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 16:46:58,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:46:58,675 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 33 states. [2018-10-10 16:47:07,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:47:07,767 INFO L93 Difference]: Finished difference Result 617 states and 617 transitions. [2018-10-10 16:47:07,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:47:07,767 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 562 [2018-10-10 16:47:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:47:07,770 INFO L225 Difference]: With dead ends: 617 [2018-10-10 16:47:07,770 INFO L226 Difference]: Without dead ends: 617 [2018-10-10 16:47:07,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=692, Invalid=3730, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 16:47:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-10 16:47:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 591. [2018-10-10 16:47:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-10 16:47:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 591 transitions. [2018-10-10 16:47:07,779 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 591 transitions. Word has length 562 [2018-10-10 16:47:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:47:07,780 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 591 transitions. [2018-10-10 16:47:07,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 16:47:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 591 transitions. [2018-10-10 16:47:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-10-10 16:47:07,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:47:07,784 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:47:07,784 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:47:07,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:47:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1303008369, now seen corresponding path program 20 times [2018-10-10 16:47:07,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:47:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:47:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 5380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:47:10,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:47:10,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:47:10,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:47:10,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:47:10,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:47:10,202 INFO L87 Difference]: Start difference. First operand 591 states and 591 transitions. Second operand 34 states. [2018-10-10 16:47:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:47:20,110 INFO L93 Difference]: Finished difference Result 645 states and 645 transitions. [2018-10-10 16:47:20,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:47:20,110 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 590 [2018-10-10 16:47:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:47:20,112 INFO L225 Difference]: With dead ends: 645 [2018-10-10 16:47:20,113 INFO L226 Difference]: Without dead ends: 645 [2018-10-10 16:47:20,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=716, Invalid=3976, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 16:47:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-10-10 16:47:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2018-10-10 16:47:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-10 16:47:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 619 transitions. [2018-10-10 16:47:20,121 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 619 transitions. Word has length 590 [2018-10-10 16:47:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:47:20,122 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 619 transitions. [2018-10-10 16:47:20,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:47:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 619 transitions. [2018-10-10 16:47:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-10 16:47:20,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:47:20,126 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:47:20,126 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:47:20,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:47:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash 192387553, now seen corresponding path program 21 times [2018-10-10 16:47:20,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:47:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:47:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5943 backedges. 0 proven. 5943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:47:22,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:47:22,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:47:22,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:47:22,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:47:22,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:47:22,562 INFO L87 Difference]: Start difference. First operand 619 states and 619 transitions. Second operand 35 states. [2018-10-10 16:47:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:47:33,462 INFO L93 Difference]: Finished difference Result 673 states and 673 transitions. [2018-10-10 16:47:33,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 16:47:33,465 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 618 [2018-10-10 16:47:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:47:33,469 INFO L225 Difference]: With dead ends: 673 [2018-10-10 16:47:33,469 INFO L226 Difference]: Without dead ends: 673 [2018-10-10 16:47:33,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=740, Invalid=4230, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 16:47:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-10 16:47:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 647. [2018-10-10 16:47:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-10-10 16:47:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 647 transitions. [2018-10-10 16:47:33,477 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 647 transitions. Word has length 618 [2018-10-10 16:47:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:47:33,478 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 647 transitions. [2018-10-10 16:47:33,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:47:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 647 transitions. [2018-10-10 16:47:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-10 16:47:33,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:47:33,483 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:47:33,483 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:47:33,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:47:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash -548448431, now seen corresponding path program 22 times [2018-10-10 16:47:33,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:47:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:47:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6534 backedges. 0 proven. 6534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:47:36,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:47:36,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:47:36,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:47:36,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:47:36,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:47:36,553 INFO L87 Difference]: Start difference. First operand 647 states and 647 transitions. Second operand 36 states. [2018-10-10 16:47:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:47:48,063 INFO L93 Difference]: Finished difference Result 701 states and 701 transitions. [2018-10-10 16:47:48,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:47:48,064 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 646 [2018-10-10 16:47:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:47:48,066 INFO L225 Difference]: With dead ends: 701 [2018-10-10 16:47:48,066 INFO L226 Difference]: Without dead ends: 701 [2018-10-10 16:47:48,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=764, Invalid=4492, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 16:47:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-10-10 16:47:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 675. [2018-10-10 16:47:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-10 16:47:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 675 transitions. [2018-10-10 16:47:48,074 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 675 transitions. Word has length 646 [2018-10-10 16:47:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:47:48,075 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 675 transitions. [2018-10-10 16:47:48,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:47:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 675 transitions. [2018-10-10 16:47:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-10 16:47:48,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:47:48,080 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:47:48,080 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:47:48,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:47:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash 692948161, now seen corresponding path program 23 times [2018-10-10 16:47:48,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:47:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:47:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7153 backedges. 0 proven. 7153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:47:50,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:47:50,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:47:50,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:47:50,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:47:50,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:47:50,794 INFO L87 Difference]: Start difference. First operand 675 states and 675 transitions. Second operand 37 states. [2018-10-10 16:48:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:48:03,153 INFO L93 Difference]: Finished difference Result 729 states and 729 transitions. [2018-10-10 16:48:03,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:48:03,153 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 674 [2018-10-10 16:48:03,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:48:03,156 INFO L225 Difference]: With dead ends: 729 [2018-10-10 16:48:03,156 INFO L226 Difference]: Without dead ends: 729 [2018-10-10 16:48:03,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=788, Invalid=4762, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 16:48:03,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-10 16:48:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2018-10-10 16:48:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-10 16:48:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 703 transitions. [2018-10-10 16:48:03,166 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 703 transitions. Word has length 674 [2018-10-10 16:48:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:48:03,166 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 703 transitions. [2018-10-10 16:48:03,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:48:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 703 transitions. [2018-10-10 16:48:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-10-10 16:48:03,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:48:03,172 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:48:03,172 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:48:03,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:48:03,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1200503345, now seen corresponding path program 24 times [2018-10-10 16:48:03,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:48:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:48:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7800 backedges. 0 proven. 7800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:48:06,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:48:06,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:48:06,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:48:06,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:48:06,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:48:06,146 INFO L87 Difference]: Start difference. First operand 703 states and 703 transitions. Second operand 38 states. [2018-10-10 16:48:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:48:19,499 INFO L93 Difference]: Finished difference Result 757 states and 757 transitions. [2018-10-10 16:48:19,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 16:48:19,500 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 702 [2018-10-10 16:48:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:48:19,502 INFO L225 Difference]: With dead ends: 757 [2018-10-10 16:48:19,502 INFO L226 Difference]: Without dead ends: 757 [2018-10-10 16:48:19,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=812, Invalid=5040, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 16:48:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-10 16:48:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 731. [2018-10-10 16:48:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-10-10 16:48:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 731 transitions. [2018-10-10 16:48:19,511 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 731 transitions. Word has length 702 [2018-10-10 16:48:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:48:19,512 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 731 transitions. [2018-10-10 16:48:19,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:48:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 731 transitions. [2018-10-10 16:48:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-10-10 16:48:19,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:48:19,518 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:48:19,518 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:48:19,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:48:19,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1775411295, now seen corresponding path program 25 times [2018-10-10 16:48:19,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:48:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:48:20,303 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:48:20,744 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:48:21,494 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 16:48:21,837 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 16:48:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:48:24,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:48:24,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:48:24,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:48:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:48:24,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:48:24,443 INFO L87 Difference]: Start difference. First operand 731 states and 731 transitions. Second operand 39 states. [2018-10-10 16:48:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:48:39,582 INFO L93 Difference]: Finished difference Result 785 states and 785 transitions. [2018-10-10 16:48:39,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:48:39,582 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 730 [2018-10-10 16:48:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:48:39,585 INFO L225 Difference]: With dead ends: 785 [2018-10-10 16:48:39,585 INFO L226 Difference]: Without dead ends: 785 [2018-10-10 16:48:39,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=836, Invalid=5326, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 16:48:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-10 16:48:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 759. [2018-10-10 16:48:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-10 16:48:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 759 transitions. [2018-10-10 16:48:39,593 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 759 transitions. Word has length 730 [2018-10-10 16:48:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:48:39,593 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 759 transitions. [2018-10-10 16:48:39,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:48:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 759 transitions. [2018-10-10 16:48:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-10 16:48:39,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:48:39,600 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:48:39,600 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:48:39,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:48:39,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1866923281, now seen corresponding path program 26 times [2018-10-10 16:48:39,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:48:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:48:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9178 backedges. 0 proven. 9178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:48:42,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:48:42,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:48:42,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:48:42,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:48:42,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:48:42,980 INFO L87 Difference]: Start difference. First operand 759 states and 759 transitions. Second operand 40 states. [2018-10-10 16:48:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:48:58,575 INFO L93 Difference]: Finished difference Result 813 states and 813 transitions. [2018-10-10 16:48:58,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 16:48:58,575 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 758 [2018-10-10 16:48:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:48:58,578 INFO L225 Difference]: With dead ends: 813 [2018-10-10 16:48:58,578 INFO L226 Difference]: Without dead ends: 813 [2018-10-10 16:48:58,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=860, Invalid=5620, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 16:48:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-10-10 16:48:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 787. [2018-10-10 16:48:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-10-10 16:48:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 787 transitions. [2018-10-10 16:48:58,587 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 787 transitions. Word has length 758 [2018-10-10 16:48:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:48:58,588 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 787 transitions. [2018-10-10 16:48:58,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:48:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 787 transitions. [2018-10-10 16:48:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2018-10-10 16:48:58,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:48:58,595 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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] [2018-10-10 16:48:58,595 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:48:58,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:48:58,596 INFO L82 PathProgramCache]: Analyzing trace with hash 720835201, now seen corresponding path program 27 times [2018-10-10 16:48:58,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:48:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:48:59,213 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:49:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9909 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:49:02,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:49:02,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 16:49:02,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 16:49:02,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 16:49:02,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:49:02,986 INFO L87 Difference]: Start difference. First operand 787 states and 787 transitions. Second operand 41 states. [2018-10-10 16:49:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:49:19,369 INFO L93 Difference]: Finished difference Result 841 states and 841 transitions. [2018-10-10 16:49:19,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 16:49:19,369 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 786 [2018-10-10 16:49:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:49:19,372 INFO L225 Difference]: With dead ends: 841 [2018-10-10 16:49:19,372 INFO L226 Difference]: Without dead ends: 841 [2018-10-10 16:49:19,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=884, Invalid=5922, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 16:49:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-10 16:49:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 815. [2018-10-10 16:49:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-10-10 16:49:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 815 transitions. [2018-10-10 16:49:19,381 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 815 transitions. Word has length 786 [2018-10-10 16:49:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:49:19,382 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 815 transitions. [2018-10-10 16:49:19,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 16:49:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 815 transitions. [2018-10-10 16:49:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-10-10 16:49:19,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:49:19,389 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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] [2018-10-10 16:49:19,389 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:49:19,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:49:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash 525967345, now seen corresponding path program 28 times [2018-10-10 16:49:19,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:49:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:49:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10668 backedges. 0 proven. 10668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:49:23,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:49:23,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:49:23,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:49:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:49:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:49:23,074 INFO L87 Difference]: Start difference. First operand 815 states and 815 transitions. Second operand 42 states. [2018-10-10 16:49:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:49:40,211 INFO L93 Difference]: Finished difference Result 869 states and 869 transitions. [2018-10-10 16:49:40,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 16:49:40,211 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 814 [2018-10-10 16:49:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:49:40,214 INFO L225 Difference]: With dead ends: 869 [2018-10-10 16:49:40,214 INFO L226 Difference]: Without dead ends: 869 [2018-10-10 16:49:40,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=908, Invalid=6232, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 16:49:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-10-10 16:49:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 843. [2018-10-10 16:49:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-10-10 16:49:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 843 transitions. [2018-10-10 16:49:40,222 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 843 transitions. Word has length 814 [2018-10-10 16:49:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:49:40,223 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 843 transitions. [2018-10-10 16:49:40,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:49:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 843 transitions. [2018-10-10 16:49:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2018-10-10 16:49:40,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:49:40,230 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 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] [2018-10-10 16:49:40,230 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:49:40,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:49:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1601526431, now seen corresponding path program 29 times [2018-10-10 16:49:40,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:49:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:49:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11455 backedges. 0 proven. 11455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:49:44,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:49:44,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:49:44,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:49:44,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:49:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:49:44,031 INFO L87 Difference]: Start difference. First operand 843 states and 843 transitions. Second operand 43 states. [2018-10-10 16:50:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:50:02,123 INFO L93 Difference]: Finished difference Result 897 states and 897 transitions. [2018-10-10 16:50:02,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 16:50:02,123 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 842 [2018-10-10 16:50:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:50:02,126 INFO L225 Difference]: With dead ends: 897 [2018-10-10 16:50:02,126 INFO L226 Difference]: Without dead ends: 897 [2018-10-10 16:50:02,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=932, Invalid=6550, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 16:50:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-10-10 16:50:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 871. [2018-10-10 16:50:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-10-10 16:50:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 871 transitions. [2018-10-10 16:50:02,135 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 871 transitions. Word has length 842 [2018-10-10 16:50:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:50:02,136 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 871 transitions. [2018-10-10 16:50:02,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:50:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 871 transitions. [2018-10-10 16:50:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2018-10-10 16:50:02,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:50:02,144 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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] [2018-10-10 16:50:02,144 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:50:02,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:50:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash 10887889, now seen corresponding path program 30 times [2018-10-10 16:50:02,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:50:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:50:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12270 backedges. 0 proven. 12270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:50:06,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:50:06,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:50:06,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:50:06,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:50:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:50:06,570 INFO L87 Difference]: Start difference. First operand 871 states and 871 transitions. Second operand 44 states. [2018-10-10 16:50:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:50:25,764 INFO L93 Difference]: Finished difference Result 925 states and 925 transitions. [2018-10-10 16:50:25,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 16:50:25,764 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 870 [2018-10-10 16:50:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:50:25,767 INFO L225 Difference]: With dead ends: 925 [2018-10-10 16:50:25,767 INFO L226 Difference]: Without dead ends: 925 [2018-10-10 16:50:25,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=956, Invalid=6876, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 16:50:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-10-10 16:50:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 899. [2018-10-10 16:50:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-10 16:50:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 899 transitions. [2018-10-10 16:50:25,774 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 899 transitions. Word has length 870 [2018-10-10 16:50:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:50:25,775 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 899 transitions. [2018-10-10 16:50:25,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:50:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 899 transitions. [2018-10-10 16:50:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-10-10 16:50:25,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:50:25,783 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 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] [2018-10-10 16:50:25,784 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:50:25,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:50:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1882711999, now seen corresponding path program 31 times [2018-10-10 16:50:25,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:50:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:50:26,500 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:50:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 0 proven. 13113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:50:30,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:50:30,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 16:50:30,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 16:50:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 16:50:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:50:30,460 INFO L87 Difference]: Start difference. First operand 899 states and 899 transitions. Second operand 45 states. [2018-10-10 16:50:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:50:50,671 INFO L93 Difference]: Finished difference Result 953 states and 953 transitions. [2018-10-10 16:50:50,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 16:50:50,672 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 898 [2018-10-10 16:50:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:50:50,676 INFO L225 Difference]: With dead ends: 953 [2018-10-10 16:50:50,676 INFO L226 Difference]: Without dead ends: 953 [2018-10-10 16:50:50,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=980, Invalid=7210, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 16:50:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-10-10 16:50:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 927. [2018-10-10 16:50:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-10 16:50:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 927 transitions. [2018-10-10 16:50:50,684 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 927 transitions. Word has length 898 [2018-10-10 16:50:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:50:50,685 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 927 transitions. [2018-10-10 16:50:50,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 16:50:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 927 transitions. [2018-10-10 16:50:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-10-10 16:50:50,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:50:50,691 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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] [2018-10-10 16:50:50,691 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:50:50,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:50:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1676900943, now seen corresponding path program 32 times [2018-10-10 16:50:50,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:50:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:50:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13984 backedges. 0 proven. 13984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:50:55,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:50:55,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:50:55,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:50:55,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:50:55,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:50:55,832 INFO L87 Difference]: Start difference. First operand 927 states and 927 transitions. Second operand 46 states. [2018-10-10 16:51:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:51:17,099 INFO L93 Difference]: Finished difference Result 981 states and 981 transitions. [2018-10-10 16:51:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:51:17,099 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 926 [2018-10-10 16:51:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:51:17,103 INFO L225 Difference]: With dead ends: 981 [2018-10-10 16:51:17,103 INFO L226 Difference]: Without dead ends: 981 [2018-10-10 16:51:17,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1004, Invalid=7552, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 16:51:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-10 16:51:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 955. [2018-10-10 16:51:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-10 16:51:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 955 transitions. [2018-10-10 16:51:17,111 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 955 transitions. Word has length 926 [2018-10-10 16:51:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:51:17,112 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 955 transitions. [2018-10-10 16:51:17,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:51:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 955 transitions. [2018-10-10 16:51:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-10-10 16:51:17,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:51:17,120 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 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] [2018-10-10 16:51:17,120 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:51:17,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:51:17,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1905224481, now seen corresponding path program 33 times [2018-10-10 16:51:17,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:51:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:51:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14883 backedges. 0 proven. 14883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:51:21,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:51:21,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 16:51:21,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 16:51:21,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 16:51:21,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:51:21,830 INFO L87 Difference]: Start difference. First operand 955 states and 955 transitions. Second operand 47 states. [2018-10-10 16:51:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:51:44,250 INFO L93 Difference]: Finished difference Result 1009 states and 1009 transitions. [2018-10-10 16:51:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 16:51:44,250 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 954 [2018-10-10 16:51:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:51:44,253 INFO L225 Difference]: With dead ends: 1009 [2018-10-10 16:51:44,254 INFO L226 Difference]: Without dead ends: 1009 [2018-10-10 16:51:44,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1028, Invalid=7902, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 16:51:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-10-10 16:51:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 983. [2018-10-10 16:51:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-10-10 16:51:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 983 transitions. [2018-10-10 16:51:44,261 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 983 transitions. Word has length 954 [2018-10-10 16:51:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:51:44,261 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 983 transitions. [2018-10-10 16:51:44,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 16:51:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 983 transitions. [2018-10-10 16:51:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-10-10 16:51:44,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:51:44,268 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 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] [2018-10-10 16:51:44,269 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:51:44,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:51:44,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1517078673, now seen corresponding path program 34 times [2018-10-10 16:51:44,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:51:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:51:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 15810 backedges. 0 proven. 15810 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:51:49,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:51:49,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:51:49,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:51:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:51:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:51:49,778 INFO L87 Difference]: Start difference. First operand 983 states and 983 transitions. Second operand 48 states. [2018-10-10 16:52:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:52:13,379 INFO L93 Difference]: Finished difference Result 1037 states and 1037 transitions. [2018-10-10 16:52:13,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 16:52:13,385 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 982 [2018-10-10 16:52:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:52:13,389 INFO L225 Difference]: With dead ends: 1037 [2018-10-10 16:52:13,389 INFO L226 Difference]: Without dead ends: 1037 [2018-10-10 16:52:13,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1052, Invalid=8260, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 16:52:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-10-10 16:52:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1011. [2018-10-10 16:52:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-10 16:52:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1011 transitions. [2018-10-10 16:52:13,396 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1011 transitions. Word has length 982 [2018-10-10 16:52:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:52:13,397 INFO L481 AbstractCegarLoop]: Abstraction has 1011 states and 1011 transitions. [2018-10-10 16:52:13,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:52:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1011 transitions. [2018-10-10 16:52:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1011 [2018-10-10 16:52:13,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:52:13,403 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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] [2018-10-10 16:52:13,403 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:52:13,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:52:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1631543807, now seen corresponding path program 35 times [2018-10-10 16:52:13,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:52:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:52:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16765 backedges. 0 proven. 16765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:52:18,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:52:18,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 16:52:18,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 16:52:18,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 16:52:18,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:52:18,611 INFO L87 Difference]: Start difference. First operand 1011 states and 1011 transitions. Second operand 49 states. [2018-10-10 16:52:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:52:43,454 INFO L93 Difference]: Finished difference Result 1065 states and 1065 transitions. [2018-10-10 16:52:43,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 16:52:43,454 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1010 [2018-10-10 16:52:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:52:43,458 INFO L225 Difference]: With dead ends: 1065 [2018-10-10 16:52:43,458 INFO L226 Difference]: Without dead ends: 1065 [2018-10-10 16:52:43,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1076, Invalid=8626, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 16:52:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-10-10 16:52:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1039. [2018-10-10 16:52:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-10-10 16:52:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1039 transitions. [2018-10-10 16:52:43,465 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1039 transitions. Word has length 1010 [2018-10-10 16:52:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:52:43,466 INFO L481 AbstractCegarLoop]: Abstraction has 1039 states and 1039 transitions. [2018-10-10 16:52:43,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 16:52:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1039 transitions. [2018-10-10 16:52:43,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-10 16:52:43,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:52:43,473 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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] [2018-10-10 16:52:43,473 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:52:43,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:52:43,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2069435535, now seen corresponding path program 36 times [2018-10-10 16:52:43,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:52:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:52:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 17748 backedges. 0 proven. 17748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:52:48,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:52:48,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:52:48,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:52:48,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:52:48,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:52:48,993 INFO L87 Difference]: Start difference. First operand 1039 states and 1039 transitions. Second operand 50 states. [2018-10-10 16:53:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:53:15,095 INFO L93 Difference]: Finished difference Result 1093 states and 1093 transitions. [2018-10-10 16:53:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 16:53:15,096 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1038 [2018-10-10 16:53:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:53:15,099 INFO L225 Difference]: With dead ends: 1093 [2018-10-10 16:53:15,099 INFO L226 Difference]: Without dead ends: 1093 [2018-10-10 16:53:15,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1100, Invalid=9000, Unknown=0, NotChecked=0, Total=10100 [2018-10-10 16:53:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-10 16:53:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1067. [2018-10-10 16:53:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2018-10-10 16:53:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1067 transitions. [2018-10-10 16:53:15,109 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1067 transitions. Word has length 1038 [2018-10-10 16:53:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:53:15,110 INFO L481 AbstractCegarLoop]: Abstraction has 1067 states and 1067 transitions. [2018-10-10 16:53:15,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:53:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1067 transitions. [2018-10-10 16:53:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2018-10-10 16:53:15,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:53:15,119 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 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] [2018-10-10 16:53:15,119 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:53:15,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:53:15,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1346089185, now seen corresponding path program 37 times [2018-10-10 16:53:15,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:53:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:53:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18759 backedges. 0 proven. 18759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:53:20,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:53:20,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 16:53:20,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 16:53:20,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 16:53:20,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:53:20,742 INFO L87 Difference]: Start difference. First operand 1067 states and 1067 transitions. Second operand 51 states.