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/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:46:09,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:46:09,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:46:09,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:46:09,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:46:09,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:46:09,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:46:09,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:46:09,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:46:09,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:46:09,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:46:09,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:46:09,288 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:46:09,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:46:09,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:46:09,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:46:09,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:46:09,298 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:46:09,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:46:09,307 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:46:09,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:46:09,310 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:46:09,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:46:09,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:46:09,318 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:46:09,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:46:09,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:46:09,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:46:09,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:46:09,327 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:46:09,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:46:09,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:46:09,328 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:46:09,329 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:46:09,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:46:09,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:46:09,334 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 15:46:09,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:46:09,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:46:09,354 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:46:09,354 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:46:09,355 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:46:09,355 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:46:09,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:46:09,356 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:46:09,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:46:09,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:46:09,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:46:09,357 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:46:09,357 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:46:09,358 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:46:09,358 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:46:09,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:46:09,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:46:09,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:46:09,437 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:46:09,438 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:46:09,439 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl [2018-10-10 15:46:09,439 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl' [2018-10-10 15:46:09,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:46:09,519 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:46:09,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:46:09,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:46:09,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:46:09,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:09" (1/1) ... [2018-10-10 15:46:09,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:09" (1/1) ... [2018-10-10 15:46:09,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:09" (1/1) ... [2018-10-10 15:46:09,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:09" (1/1) ... [2018-10-10 15:46:09,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:09" (1/1) ... [2018-10-10 15:46:09,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:09" (1/1) ... [2018-10-10 15:46:09,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:09" (1/1) ... [2018-10-10 15:46:09,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:46:09,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:46:09,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:46:09,576 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:46:09,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:09" (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 15:46:09,645 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:46:09,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:46:09,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:46:10,242 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:46:10,243 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:46:10 BoogieIcfgContainer [2018-10-10 15:46:10,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:46:10,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:46:10,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:46:10,248 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:46:10,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:09" (1/2) ... [2018-10-10 15:46:10,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505bcda4 and model type standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:46:10, skipping insertion in model container [2018-10-10 15:46:10,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:46:10" (2/2) ... [2018-10-10 15:46:10,252 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i_8.bpl [2018-10-10 15:46:10,262 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:46:10,271 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:46:10,286 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:46:10,314 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:46:10,315 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:46:10,315 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:46:10,315 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:46:10,315 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:46:10,315 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:46:10,315 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:46:10,316 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:46:10,316 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:46:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-10 15:46:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 15:46:10,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:10,345 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 15:46:10,346 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:10,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:10,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1825826060, now seen corresponding path program 1 times [2018-10-10 15:46:10,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:11,202 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 15:46:11,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:46:11,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 15:46:11,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:46:11,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:46:11,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:46:11,226 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 12 states. [2018-10-10 15:46:11,881 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 15:46:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:12,543 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-10 15:46:12,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:46:12,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-10-10 15:46:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:12,560 INFO L225 Difference]: With dead ends: 85 [2018-10-10 15:46:12,560 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 15:46:12,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:46:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 15:46:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2018-10-10 15:46:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-10 15:46:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-10 15:46:12,606 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 30 [2018-10-10 15:46:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:12,607 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-10 15:46:12,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:46:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-10 15:46:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-10 15:46:12,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:12,610 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 15:46:12,610 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:12,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:12,610 INFO L82 PathProgramCache]: Analyzing trace with hash -560265094, now seen corresponding path program 1 times [2018-10-10 15:46:12,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:13,335 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 15:46:13,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:13,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:46:13,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:46:13,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:46:13,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:46:13,340 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 15 states. [2018-10-10 15:46:13,710 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 15:46:14,140 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 15:46:14,586 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-10 15:46:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:15,236 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 15:46:15,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:46:15,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-10 15:46:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:15,246 INFO L225 Difference]: With dead ends: 113 [2018-10-10 15:46:15,246 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 15:46:15,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:46:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 15:46:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2018-10-10 15:46:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-10 15:46:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-10 15:46:15,259 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 58 [2018-10-10 15:46:15,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:15,260 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-10 15:46:15,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:46:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-10 15:46:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 15:46:15,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:15,264 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 15:46:15,264 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:15,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash 477354728, now seen corresponding path program 2 times [2018-10-10 15:46:15,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:15,810 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 15:46:15,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:15,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:46:15,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:46:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:46:15,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:46:15,812 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 16 states. [2018-10-10 15:46:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:17,178 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-10 15:46:17,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:46:17,180 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-10-10 15:46:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:17,184 INFO L225 Difference]: With dead ends: 141 [2018-10-10 15:46:17,184 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 15:46:17,186 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 15:46:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 15:46:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2018-10-10 15:46:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 15:46:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-10 15:46:17,214 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 86 [2018-10-10 15:46:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:17,214 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-10 15:46:17,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:46:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-10 15:46:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-10 15:46:17,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:17,222 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 15:46:17,222 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:17,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:17,223 INFO L82 PathProgramCache]: Analyzing trace with hash -267264938, now seen corresponding path program 3 times [2018-10-10 15:46:17,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:18,606 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 15:46:18,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:18,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:46:18,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:46:18,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:46:18,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:46:18,608 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 17 states. [2018-10-10 15:46:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:20,555 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-10 15:46:20,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:46:20,556 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-10-10 15:46:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:20,559 INFO L225 Difference]: With dead ends: 169 [2018-10-10 15:46:20,559 INFO L226 Difference]: Without dead ends: 169 [2018-10-10 15:46:20,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:46:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-10 15:46:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2018-10-10 15:46:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 15:46:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-10 15:46:20,570 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 114 [2018-10-10 15:46:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:20,571 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-10 15:46:20,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:46:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-10 15:46:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-10 15:46:20,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:20,573 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 15:46:20,574 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:20,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:20,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1525189828, now seen corresponding path program 4 times [2018-10-10 15:46:20,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:21,394 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 15:46:21,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:21,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:46:21,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:46:21,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:46:21,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:46:21,396 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 18 states. [2018-10-10 15:46:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:23,023 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 15:46:23,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:46:23,024 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-10-10 15:46:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:23,026 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:46:23,026 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:46:23,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:46:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:46:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 171. [2018-10-10 15:46:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 15:46:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-10 15:46:23,038 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 142 [2018-10-10 15:46:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:23,038 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-10 15:46:23,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:46:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-10 15:46:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 15:46:23,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:23,042 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 15:46:23,042 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:23,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:23,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1982557234, now seen corresponding path program 5 times [2018-10-10 15:46:23,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:23,852 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 15:46:23,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:23,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:46:23,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:46:23,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:46:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:46:23,853 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 19 states. [2018-10-10 15:46:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:25,700 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-10 15:46:25,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:46:25,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 170 [2018-10-10 15:46:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:25,703 INFO L225 Difference]: With dead ends: 225 [2018-10-10 15:46:25,703 INFO L226 Difference]: Without dead ends: 225 [2018-10-10 15:46:25,704 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 15:46:25,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-10 15:46:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2018-10-10 15:46:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 15:46:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-10 15:46:25,713 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 170 [2018-10-10 15:46:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:25,714 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-10 15:46:25,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:46:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-10 15:46:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-10 15:46:25,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:25,718 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 15:46:25,718 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:25,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:25,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1389230752, now seen corresponding path program 6 times [2018-10-10 15:46:25,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:26,354 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:46:27,174 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 15:46:27,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:27,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:46:27,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:46:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:46:27,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:46:27,176 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 20 states. [2018-10-10 15:46:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:29,663 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-10 15:46:29,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:46:29,664 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 198 [2018-10-10 15:46:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:29,666 INFO L225 Difference]: With dead ends: 253 [2018-10-10 15:46:29,667 INFO L226 Difference]: Without dead ends: 253 [2018-10-10 15:46:29,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=380, Invalid=1260, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:46:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-10 15:46:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2018-10-10 15:46:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-10 15:46:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-10 15:46:29,676 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 198 [2018-10-10 15:46:29,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:29,676 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-10 15:46:29,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:46:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-10 15:46:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-10 15:46:29,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:29,680 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 15:46:29,681 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:29,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:29,681 INFO L82 PathProgramCache]: Analyzing trace with hash -645679090, now seen corresponding path program 7 times [2018-10-10 15:46:29,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:31,031 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 15:46:31,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:31,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:46:31,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:46:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:46:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:46:31,034 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 21 states. [2018-10-10 15:46:33,602 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-10 15:46:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:34,131 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-10 15:46:34,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:46:34,131 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 226 [2018-10-10 15:46:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:34,133 INFO L225 Difference]: With dead ends: 281 [2018-10-10 15:46:34,133 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 15:46:34,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:46:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 15:46:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 255. [2018-10-10 15:46:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 15:46:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-10 15:46:34,142 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 226 [2018-10-10 15:46:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:34,143 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-10 15:46:34,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:46:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-10 15:46:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 15:46:34,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:34,147 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 15:46:34,148 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:34,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:34,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1430248324, now seen corresponding path program 8 times [2018-10-10 15:46:34,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:35,186 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:46:36,377 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 15:46:36,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:36,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:46:36,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:46:36,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:46:36,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:46:36,379 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 22 states. [2018-10-10 15:46:37,551 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-10 15:46:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:39,387 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-10 15:46:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:46:39,389 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 254 [2018-10-10 15:46:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:39,391 INFO L225 Difference]: With dead ends: 309 [2018-10-10 15:46:39,391 INFO L226 Difference]: Without dead ends: 309 [2018-10-10 15:46:39,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:46:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-10 15:46:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2018-10-10 15:46:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 15:46:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-10 15:46:39,398 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 254 [2018-10-10 15:46:39,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:39,399 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-10 15:46:39,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:46:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-10 15:46:39,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-10 15:46:39,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:39,403 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 15:46:39,403 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:39,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:39,403 INFO L82 PathProgramCache]: Analyzing trace with hash -21577750, now seen corresponding path program 9 times [2018-10-10 15:46:39,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:40,315 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 15:46:40,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:40,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:46:40,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:46:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:46:40,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:46:40,317 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 23 states. [2018-10-10 15:46:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:43,453 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-10 15:46:43,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:46:43,453 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 282 [2018-10-10 15:46:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:43,455 INFO L225 Difference]: With dead ends: 337 [2018-10-10 15:46:43,456 INFO L226 Difference]: Without dead ends: 337 [2018-10-10 15:46:43,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:46:43,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-10 15:46:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 311. [2018-10-10 15:46:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-10 15:46:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-10 15:46:43,463 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 282 [2018-10-10 15:46:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:43,464 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-10 15:46:43,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:46:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-10 15:46:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-10 15:46:43,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:43,466 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 15:46:43,466 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:43,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2057631144, now seen corresponding path program 10 times [2018-10-10 15:46:43,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:44,790 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 15:46:44,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:44,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:46:44,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:46:44,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:46:44,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:46:44,792 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 24 states. [2018-10-10 15:46:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:48,218 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-10 15:46:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:46:48,218 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 310 [2018-10-10 15:46:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:48,220 INFO L225 Difference]: With dead ends: 365 [2018-10-10 15:46:48,220 INFO L226 Difference]: Without dead ends: 365 [2018-10-10 15:46:48,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=476, Invalid=1876, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:46:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-10 15:46:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 339. [2018-10-10 15:46:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-10 15:46:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-10 15:46:48,227 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 310 [2018-10-10 15:46:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:48,228 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-10 15:46:48,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:46:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-10 15:46:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-10 15:46:48,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:48,230 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 15:46:48,231 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:48,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:48,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1180730310, now seen corresponding path program 11 times [2018-10-10 15:46:48,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:50,465 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 15:46:50,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:50,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:46:50,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:46:50,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:46:50,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:46:50,467 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 25 states. [2018-10-10 15:46:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:54,591 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-10 15:46:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:46:54,591 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 338 [2018-10-10 15:46:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:54,594 INFO L225 Difference]: With dead ends: 393 [2018-10-10 15:46:54,594 INFO L226 Difference]: Without dead ends: 393 [2018-10-10 15:46:54,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:46:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-10 15:46:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 367. [2018-10-10 15:46:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-10 15:46:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-10 15:46:54,602 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 338 [2018-10-10 15:46:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:54,603 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-10 15:46:54,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:46:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-10 15:46:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-10 15:46:54,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:54,606 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 15:46:54,606 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:54,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:54,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2126861260, now seen corresponding path program 12 times [2018-10-10 15:46:54,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:55,754 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 15:46:55,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:55,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:46:55,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:46:55,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:46:55,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:46:55,756 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 26 states. [2018-10-10 15:47:00,301 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-10 15:47:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:00,646 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-10 15:47:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:47:00,646 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 366 [2018-10-10 15:47:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:00,649 INFO L225 Difference]: With dead ends: 421 [2018-10-10 15:47:00,649 INFO L226 Difference]: Without dead ends: 421 [2018-10-10 15:47:00,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:47:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-10 15:47:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 395. [2018-10-10 15:47:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-10 15:47:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-10 15:47:00,657 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 366 [2018-10-10 15:47:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:00,657 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-10 15:47:00,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:47:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-10 15:47:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-10 15:47:00,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:00,660 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 15:47:00,660 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:00,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:00,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1927478366, now seen corresponding path program 13 times [2018-10-10 15:47:00,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:01,704 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:47:03,004 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 15:47:03,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:03,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:47:03,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:47:03,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:47:03,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:47:03,006 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 27 states. [2018-10-10 15:47:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:08,567 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-10 15:47:08,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:47:08,568 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 394 [2018-10-10 15:47:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:08,570 INFO L225 Difference]: With dead ends: 449 [2018-10-10 15:47:08,570 INFO L226 Difference]: Without dead ends: 449 [2018-10-10 15:47:08,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=548, Invalid=2422, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:47:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-10 15:47:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 423. [2018-10-10 15:47:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-10 15:47:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-10 15:47:08,578 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 394 [2018-10-10 15:47:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:08,579 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-10 15:47:08,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:47:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-10 15:47:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-10 15:47:08,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:08,582 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 15:47:08,582 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:08,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1191507440, now seen corresponding path program 14 times [2018-10-10 15:47:08,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:09,708 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 15:47:10,615 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 15:47:10,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:10,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:47:10,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:47:10,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:47:10,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:47:10,617 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 28 states. [2018-10-10 15:47:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:16,272 INFO L93 Difference]: Finished difference Result 477 states and 477 transitions. [2018-10-10 15:47:16,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:47:16,273 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 422 [2018-10-10 15:47:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:16,276 INFO L225 Difference]: With dead ends: 477 [2018-10-10 15:47:16,276 INFO L226 Difference]: Without dead ends: 477 [2018-10-10 15:47:16,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=572, Invalid=2620, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:47:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-10 15:47:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 451. [2018-10-10 15:47:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-10 15:47:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-10 15:47:16,285 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 422 [2018-10-10 15:47:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:16,286 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-10 15:47:16,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:47:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-10 15:47:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-10 15:47:16,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:16,289 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 15:47:16,289 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:16,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:16,290 INFO L82 PathProgramCache]: Analyzing trace with hash 730349438, now seen corresponding path program 15 times [2018-10-10 15:47:16,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:16,993 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:47:19,955 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 15:47:19,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:19,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:47:19,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:47:19,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:47:19,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:47:19,957 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 29 states. [2018-10-10 15:47:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:26,130 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-10-10 15:47:26,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:47:26,131 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 450 [2018-10-10 15:47:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:26,134 INFO L225 Difference]: With dead ends: 505 [2018-10-10 15:47:26,134 INFO L226 Difference]: Without dead ends: 505 [2018-10-10 15:47:26,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=596, Invalid=2826, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:47:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-10 15:47:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 479. [2018-10-10 15:47:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-10 15:47:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-10 15:47:26,144 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 450 [2018-10-10 15:47:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:26,145 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-10 15:47:26,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:47:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-10 15:47:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-10 15:47:26,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:26,149 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 15:47:26,149 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:26,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1019730964, now seen corresponding path program 16 times [2018-10-10 15:47:26,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:27,793 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 15:47:27,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:27,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:47:27,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:47:27,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:47:27,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:47:27,795 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 30 states. [2018-10-10 15:47:28,007 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 15:47:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:34,944 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-10 15:47:34,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:47:34,944 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 478 [2018-10-10 15:47:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:34,947 INFO L225 Difference]: With dead ends: 533 [2018-10-10 15:47:34,948 INFO L226 Difference]: Without dead ends: 533 [2018-10-10 15:47:34,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=620, Invalid=3040, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:47:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-10 15:47:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 507. [2018-10-10 15:47:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-10 15:47:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2018-10-10 15:47:34,956 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 478 [2018-10-10 15:47:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:34,956 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 507 transitions. [2018-10-10 15:47:34,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:47:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 507 transitions. [2018-10-10 15:47:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-10 15:47:34,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:34,960 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 15:47:34,960 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:34,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:34,961 INFO L82 PathProgramCache]: Analyzing trace with hash -163694758, now seen corresponding path program 17 times [2018-10-10 15:47:34,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:37,010 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 15:47:37,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:37,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:47:37,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:47:37,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:47:37,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:47:37,012 INFO L87 Difference]: Start difference. First operand 507 states and 507 transitions. Second operand 31 states. [2018-10-10 15:47:41,030 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-10 15:47:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:44,293 INFO L93 Difference]: Finished difference Result 561 states and 561 transitions. [2018-10-10 15:47:44,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:47:44,294 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 506 [2018-10-10 15:47:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:44,297 INFO L225 Difference]: With dead ends: 561 [2018-10-10 15:47:44,297 INFO L226 Difference]: Without dead ends: 561 [2018-10-10 15:47:44,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=644, Invalid=3262, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:47:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-10 15:47:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 535. [2018-10-10 15:47:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-10 15:47:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 535 transitions. [2018-10-10 15:47:44,306 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 535 transitions. Word has length 506 [2018-10-10 15:47:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:44,307 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 535 transitions. [2018-10-10 15:47:44,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:47:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 535 transitions. [2018-10-10 15:47:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-10 15:47:44,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:44,311 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 15:47:44,311 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:44,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1299318328, now seen corresponding path program 18 times [2018-10-10 15:47:44,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:46,762 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 15:47:46,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:46,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:47:46,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:47:46,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:47:46,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:47:46,764 INFO L87 Difference]: Start difference. First operand 535 states and 535 transitions. Second operand 32 states. [2018-10-10 15:47:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:54,688 INFO L93 Difference]: Finished difference Result 589 states and 589 transitions. [2018-10-10 15:47:54,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:47:54,689 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 534 [2018-10-10 15:47:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:54,691 INFO L225 Difference]: With dead ends: 589 [2018-10-10 15:47:54,691 INFO L226 Difference]: Without dead ends: 589 [2018-10-10 15:47:54,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=668, Invalid=3492, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:47:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-10 15:47:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 563. [2018-10-10 15:47:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-10 15:47:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-10 15:47:54,700 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 534 [2018-10-10 15:47:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:54,701 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-10 15:47:54,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:47:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-10 15:47:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-10 15:47:54,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:54,705 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 15:47:54,705 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:54,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1037757238, now seen corresponding path program 19 times [2018-10-10 15:47:54,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:57,088 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 15:47:57,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:57,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:47:57,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:47:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:47:57,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:47:57,091 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 33 states. [2018-10-10 15:48:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:05,615 INFO L93 Difference]: Finished difference Result 617 states and 617 transitions. [2018-10-10 15:48:05,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:48:05,615 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 562 [2018-10-10 15:48:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:05,619 INFO L225 Difference]: With dead ends: 617 [2018-10-10 15:48:05,619 INFO L226 Difference]: Without dead ends: 617 [2018-10-10 15:48:05,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=692, Invalid=3730, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:48:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-10 15:48:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 591. [2018-10-10 15:48:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-10 15:48:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 591 transitions. [2018-10-10 15:48:05,628 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 591 transitions. Word has length 562 [2018-10-10 15:48:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:05,628 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 591 transitions. [2018-10-10 15:48:05,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:48:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 591 transitions. [2018-10-10 15:48:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-10-10 15:48:05,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:05,632 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 15:48:05,633 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:05,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash 362318756, now seen corresponding path program 20 times [2018-10-10 15:48:05,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:07,771 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 15:48:07,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:07,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:48:07,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:48:07,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:48:07,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:48:07,773 INFO L87 Difference]: Start difference. First operand 591 states and 591 transitions. Second operand 34 states. [2018-10-10 15:48:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:17,099 INFO L93 Difference]: Finished difference Result 645 states and 645 transitions. [2018-10-10 15:48:17,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:48:17,100 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 590 [2018-10-10 15:48:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:17,102 INFO L225 Difference]: With dead ends: 645 [2018-10-10 15:48:17,102 INFO L226 Difference]: Without dead ends: 645 [2018-10-10 15:48:17,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=716, Invalid=3976, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:48:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-10-10 15:48:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2018-10-10 15:48:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-10 15:48:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 619 transitions. [2018-10-10 15:48:17,111 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 619 transitions. Word has length 590 [2018-10-10 15:48:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:17,112 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 619 transitions. [2018-10-10 15:48:17,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:48:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 619 transitions. [2018-10-10 15:48:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-10 15:48:17,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:17,117 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 15:48:17,117 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:17,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash -822453486, now seen corresponding path program 21 times [2018-10-10 15:48:17,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:18,027 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:48:20,265 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 15:48:20,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:20,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:48:20,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:48:20,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:48:20,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:48:20,267 INFO L87 Difference]: Start difference. First operand 619 states and 619 transitions. Second operand 35 states. [2018-10-10 15:48:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:30,277 INFO L93 Difference]: Finished difference Result 673 states and 673 transitions. [2018-10-10 15:48:30,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:48:30,279 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 618 [2018-10-10 15:48:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:30,282 INFO L225 Difference]: With dead ends: 673 [2018-10-10 15:48:30,282 INFO L226 Difference]: Without dead ends: 673 [2018-10-10 15:48:30,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=740, Invalid=4230, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:48:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-10 15:48:30,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 647. [2018-10-10 15:48:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-10-10 15:48:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 647 transitions. [2018-10-10 15:48:30,291 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 647 transitions. Word has length 618 [2018-10-10 15:48:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:30,292 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 647 transitions. [2018-10-10 15:48:30,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:48:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 647 transitions. [2018-10-10 15:48:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-10 15:48:30,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:30,297 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 15:48:30,297 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:30,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash -151791232, now seen corresponding path program 22 times [2018-10-10 15:48:30,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:30,936 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:48:31,737 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:48:33,941 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 15:48:33,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:33,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:48:33,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:48:33,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:48:33,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:48:33,942 INFO L87 Difference]: Start difference. First operand 647 states and 647 transitions. Second operand 36 states. [2018-10-10 15:48:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:44,798 INFO L93 Difference]: Finished difference Result 701 states and 701 transitions. [2018-10-10 15:48:44,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:48:44,798 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 646 [2018-10-10 15:48:44,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:44,801 INFO L225 Difference]: With dead ends: 701 [2018-10-10 15:48:44,801 INFO L226 Difference]: Without dead ends: 701 [2018-10-10 15:48:44,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=764, Invalid=4492, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:48:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-10-10 15:48:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 675. [2018-10-10 15:48:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-10 15:48:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 675 transitions. [2018-10-10 15:48:44,809 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 675 transitions. Word has length 646 [2018-10-10 15:48:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:44,810 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 675 transitions. [2018-10-10 15:48:44,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:48:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 675 transitions. [2018-10-10 15:48:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-10 15:48:44,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:44,815 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 15:48:44,815 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:44,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash -231176466, now seen corresponding path program 23 times [2018-10-10 15:48:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:47,583 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 15:48:47,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:47,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:48:47,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:48:47,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:48:47,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:48:47,585 INFO L87 Difference]: Start difference. First operand 675 states and 675 transitions. Second operand 37 states. [2018-10-10 15:48:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:59,226 INFO L93 Difference]: Finished difference Result 729 states and 729 transitions. [2018-10-10 15:48:59,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:48:59,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 674 [2018-10-10 15:48:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:59,228 INFO L225 Difference]: With dead ends: 729 [2018-10-10 15:48:59,228 INFO L226 Difference]: Without dead ends: 729 [2018-10-10 15:48:59,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=788, Invalid=4762, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:48:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-10 15:48:59,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2018-10-10 15:48:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-10 15:48:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 703 transitions. [2018-10-10 15:48:59,236 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 703 transitions. Word has length 674 [2018-10-10 15:48:59,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:59,237 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 703 transitions. [2018-10-10 15:48:59,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:48:59,237 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 703 transitions. [2018-10-10 15:48:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-10-10 15:48:59,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:59,242 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 15:48:59,243 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:59,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:59,243 INFO L82 PathProgramCache]: Analyzing trace with hash -583277732, now seen corresponding path program 24 times [2018-10-10 15:48:59,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:49:02,197 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 15:49:02,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:49:02,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:49:02,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:49:02,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:49:02,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:49:02,199 INFO L87 Difference]: Start difference. First operand 703 states and 703 transitions. Second operand 38 states. [2018-10-10 15:49:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:49:14,789 INFO L93 Difference]: Finished difference Result 757 states and 757 transitions. [2018-10-10 15:49:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:49:14,789 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 702 [2018-10-10 15:49:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:49:14,792 INFO L225 Difference]: With dead ends: 757 [2018-10-10 15:49:14,792 INFO L226 Difference]: Without dead ends: 757 [2018-10-10 15:49:14,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=812, Invalid=5040, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:49:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-10 15:49:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 731. [2018-10-10 15:49:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-10-10 15:49:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 731 transitions. [2018-10-10 15:49:14,800 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 731 transitions. Word has length 702 [2018-10-10 15:49:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:49:14,801 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 731 transitions. [2018-10-10 15:49:14,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:49:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 731 transitions. [2018-10-10 15:49:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-10-10 15:49:14,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:49:14,806 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 15:49:14,807 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:49:14,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:49:14,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1815178954, now seen corresponding path program 25 times [2018-10-10 15:49:14,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:49:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:49:17,964 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 15:49:17,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:49:17,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:49:17,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:49:17,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:49:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:49:17,966 INFO L87 Difference]: Start difference. First operand 731 states and 731 transitions. Second operand 39 states. [2018-10-10 15:49:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:49:32,151 INFO L93 Difference]: Finished difference Result 785 states and 785 transitions. [2018-10-10 15:49:32,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:49:32,151 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 730 [2018-10-10 15:49:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:49:32,154 INFO L225 Difference]: With dead ends: 785 [2018-10-10 15:49:32,154 INFO L226 Difference]: Without dead ends: 785 [2018-10-10 15:49:32,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=836, Invalid=5326, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:49:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-10 15:49:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 759. [2018-10-10 15:49:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-10 15:49:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 759 transitions. [2018-10-10 15:49:32,161 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 759 transitions. Word has length 730 [2018-10-10 15:49:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:49:32,162 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 759 transitions. [2018-10-10 15:49:32,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:49:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 759 transitions. [2018-10-10 15:49:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-10 15:49:32,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:49:32,168 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 15:49:32,168 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:49:32,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:49:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash -888362696, now seen corresponding path program 26 times [2018-10-10 15:49:32,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:49:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:49:36,269 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 15:49:36,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:49:36,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:49:36,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:49:36,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:49:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:49:36,271 INFO L87 Difference]: Start difference. First operand 759 states and 759 transitions. Second operand 40 states. [2018-10-10 15:49:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:49:50,874 INFO L93 Difference]: Finished difference Result 813 states and 813 transitions. [2018-10-10 15:49:50,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:49:50,874 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 758 [2018-10-10 15:49:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:49:50,877 INFO L225 Difference]: With dead ends: 813 [2018-10-10 15:49:50,877 INFO L226 Difference]: Without dead ends: 813 [2018-10-10 15:49:50,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=860, Invalid=5620, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:49:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-10-10 15:49:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 787. [2018-10-10 15:49:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-10-10 15:49:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 787 transitions. [2018-10-10 15:49:50,886 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 787 transitions. Word has length 758 [2018-10-10 15:49:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:49:50,886 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 787 transitions. [2018-10-10 15:49:50,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:49:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 787 transitions. [2018-10-10 15:49:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2018-10-10 15:49:50,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:49:50,893 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 15:49:50,894 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:49:50,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:49:50,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2105610918, now seen corresponding path program 27 times [2018-10-10 15:49:50,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:49:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:49:54,485 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 15:49:54,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:49:54,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:49:54,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:49:54,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:49:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:49:54,487 INFO L87 Difference]: Start difference. First operand 787 states and 787 transitions. Second operand 41 states. [2018-10-10 15:50:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:50:09,453 INFO L93 Difference]: Finished difference Result 841 states and 841 transitions. [2018-10-10 15:50:09,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:50:09,454 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 786 [2018-10-10 15:50:09,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:50:09,456 INFO L225 Difference]: With dead ends: 841 [2018-10-10 15:50:09,456 INFO L226 Difference]: Without dead ends: 841 [2018-10-10 15:50:09,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=884, Invalid=5922, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:50:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-10 15:50:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 815. [2018-10-10 15:50:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-10-10 15:50:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 815 transitions. [2018-10-10 15:50:09,465 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 815 transitions. Word has length 786 [2018-10-10 15:50:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:50:09,466 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 815 transitions. [2018-10-10 15:50:09,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:50:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 815 transitions. [2018-10-10 15:50:09,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-10-10 15:50:09,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:50:09,473 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 15:50:09,473 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:50:09,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:50:09,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1057106708, now seen corresponding path program 28 times [2018-10-10 15:50:09,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:50:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:50:10,114 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:50:13,428 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 15:50:13,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:50:13,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:50:13,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:50:13,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:50:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:50:13,430 INFO L87 Difference]: Start difference. First operand 815 states and 815 transitions. Second operand 42 states. [2018-10-10 15:50:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:50:29,363 INFO L93 Difference]: Finished difference Result 869 states and 869 transitions. [2018-10-10 15:50:29,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:50:29,364 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 814 [2018-10-10 15:50:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:50:29,367 INFO L225 Difference]: With dead ends: 869 [2018-10-10 15:50:29,367 INFO L226 Difference]: Without dead ends: 869 [2018-10-10 15:50:29,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=908, Invalid=6232, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:50:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-10-10 15:50:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 843. [2018-10-10 15:50:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-10-10 15:50:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 843 transitions. [2018-10-10 15:50:29,375 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 843 transitions. Word has length 814 [2018-10-10 15:50:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:50:29,376 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 843 transitions. [2018-10-10 15:50:29,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:50:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 843 transitions. [2018-10-10 15:50:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2018-10-10 15:50:29,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:50:29,384 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 15:50:29,384 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:50:29,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:50:29,384 INFO L82 PathProgramCache]: Analyzing trace with hash -490507646, now seen corresponding path program 29 times [2018-10-10 15:50:29,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:50:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:50:33,171 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 15:50:33,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:50:33,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:50:33,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:50:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:50:33,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:50:33,172 INFO L87 Difference]: Start difference. First operand 843 states and 843 transitions. Second operand 43 states. [2018-10-10 15:50:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:50:49,710 INFO L93 Difference]: Finished difference Result 897 states and 897 transitions. [2018-10-10 15:50:49,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:50:49,711 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 842 [2018-10-10 15:50:49,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:50:49,713 INFO L225 Difference]: With dead ends: 897 [2018-10-10 15:50:49,714 INFO L226 Difference]: Without dead ends: 897 [2018-10-10 15:50:49,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=932, Invalid=6550, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:50:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-10-10 15:50:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 871. [2018-10-10 15:50:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-10-10 15:50:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 871 transitions. [2018-10-10 15:50:49,721 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 871 transitions. Word has length 842 [2018-10-10 15:50:49,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:50:49,721 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 871 transitions. [2018-10-10 15:50:49,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:50:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 871 transitions. [2018-10-10 15:50:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2018-10-10 15:50:49,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:50:49,728 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 15:50:49,729 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:50:49,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:50:49,729 INFO L82 PathProgramCache]: Analyzing trace with hash 867723504, now seen corresponding path program 30 times [2018-10-10 15:50:49,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:50:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:50:53,794 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 15:50:53,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:50:53,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:50:53,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:50:53,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:50:53,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:50:53,795 INFO L87 Difference]: Start difference. First operand 871 states and 871 transitions. Second operand 44 states. [2018-10-10 15:51:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:51:11,365 INFO L93 Difference]: Finished difference Result 925 states and 925 transitions. [2018-10-10 15:51:11,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:51:11,365 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 870 [2018-10-10 15:51:11,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:51:11,368 INFO L225 Difference]: With dead ends: 925 [2018-10-10 15:51:11,368 INFO L226 Difference]: Without dead ends: 925 [2018-10-10 15:51:11,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=956, Invalid=6876, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:51:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-10-10 15:51:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 899. [2018-10-10 15:51:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-10 15:51:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 899 transitions. [2018-10-10 15:51:11,378 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 899 transitions. Word has length 870 [2018-10-10 15:51:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:51:11,378 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 899 transitions. [2018-10-10 15:51:11,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:51:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 899 transitions. [2018-10-10 15:51:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-10-10 15:51:11,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:51:11,386 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 15:51:11,386 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:51:11,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:51:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash -728461730, now seen corresponding path program 31 times [2018-10-10 15:51:11,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:51:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:51:12,061 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:51:15,972 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 15:51:15,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:51:15,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:51:15,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:51:15,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:51:15,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:51:15,974 INFO L87 Difference]: Start difference. First operand 899 states and 899 transitions. Second operand 45 states. [2018-10-10 15:51:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:51:34,582 INFO L93 Difference]: Finished difference Result 953 states and 953 transitions. [2018-10-10 15:51:34,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:51:34,583 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 898 [2018-10-10 15:51:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:51:34,586 INFO L225 Difference]: With dead ends: 953 [2018-10-10 15:51:34,586 INFO L226 Difference]: Without dead ends: 953 [2018-10-10 15:51:34,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=980, Invalid=7210, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:51:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-10-10 15:51:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 927. [2018-10-10 15:51:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-10 15:51:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 927 transitions. [2018-10-10 15:51:34,594 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 927 transitions. Word has length 898 [2018-10-10 15:51:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:51:34,595 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 927 transitions. [2018-10-10 15:51:34,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:51:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 927 transitions. [2018-10-10 15:51:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-10-10 15:51:34,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:51:34,601 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 15:51:34,601 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:51:34,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:51:34,601 INFO L82 PathProgramCache]: Analyzing trace with hash 533422796, now seen corresponding path program 32 times [2018-10-10 15:51:34,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:51:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:51:39,416 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 15:51:39,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:51:39,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:51:39,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:51:39,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:51:39,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:51:39,419 INFO L87 Difference]: Start difference. First operand 927 states and 927 transitions. Second operand 46 states. [2018-10-10 15:51:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:51:58,941 INFO L93 Difference]: Finished difference Result 981 states and 981 transitions. [2018-10-10 15:51:58,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:51:58,947 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 926 [2018-10-10 15:51:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:51:58,950 INFO L225 Difference]: With dead ends: 981 [2018-10-10 15:51:58,950 INFO L226 Difference]: Without dead ends: 981 [2018-10-10 15:51:58,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1004, Invalid=7552, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:51:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-10 15:51:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 955. [2018-10-10 15:51:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-10 15:51:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 955 transitions. [2018-10-10 15:51:58,958 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 955 transitions. Word has length 926 [2018-10-10 15:51:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:51:58,959 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 955 transitions. [2018-10-10 15:51:58,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:51:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 955 transitions. [2018-10-10 15:51:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-10-10 15:51:58,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:51:58,965 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 15:51:58,966 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:51:58,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:51:58,966 INFO L82 PathProgramCache]: Analyzing trace with hash 126903866, now seen corresponding path program 33 times [2018-10-10 15:51:58,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:51:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:52:03,604 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 15:52:03,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:52:03,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:52:03,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:52:03,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:52:03,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:52:03,606 INFO L87 Difference]: Start difference. First operand 955 states and 955 transitions. Second operand 47 states. [2018-10-10 15:52:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:52:24,262 INFO L93 Difference]: Finished difference Result 1009 states and 1009 transitions. [2018-10-10 15:52:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:52:24,262 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 954 [2018-10-10 15:52:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:52:24,265 INFO L225 Difference]: With dead ends: 1009 [2018-10-10 15:52:24,265 INFO L226 Difference]: Without dead ends: 1009 [2018-10-10 15:52:24,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1028, Invalid=7902, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:52:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-10-10 15:52:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 983. [2018-10-10 15:52:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-10-10 15:52:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 983 transitions. [2018-10-10 15:52:24,273 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 983 transitions. Word has length 954 [2018-10-10 15:52:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:52:24,273 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 983 transitions. [2018-10-10 15:52:24,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:52:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 983 transitions. [2018-10-10 15:52:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-10-10 15:52:24,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:52:24,279 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 15:52:24,280 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:52:24,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:52:24,280 INFO L82 PathProgramCache]: Analyzing trace with hash -170452824, now seen corresponding path program 34 times [2018-10-10 15:52:24,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:52:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:52:26,059 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 15:52:29,849 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 15:52:29,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:52:29,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:52:29,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:52:29,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:52:29,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:52:29,851 INFO L87 Difference]: Start difference. First operand 983 states and 983 transitions. Second operand 48 states. [2018-10-10 15:52:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:52:51,373 INFO L93 Difference]: Finished difference Result 1037 states and 1037 transitions. [2018-10-10 15:52:51,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:52:51,373 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 982 [2018-10-10 15:52:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:52:51,377 INFO L225 Difference]: With dead ends: 1037 [2018-10-10 15:52:51,377 INFO L226 Difference]: Without dead ends: 1037 [2018-10-10 15:52:51,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1052, Invalid=8260, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:52:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-10-10 15:52:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1011. [2018-10-10 15:52:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-10 15:52:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1011 transitions. [2018-10-10 15:52:51,384 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1011 transitions. Word has length 982 [2018-10-10 15:52:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:52:51,385 INFO L481 AbstractCegarLoop]: Abstraction has 1011 states and 1011 transitions. [2018-10-10 15:52:51,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:52:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1011 transitions. [2018-10-10 15:52:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1011 [2018-10-10 15:52:51,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:52:51,391 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 15:52:51,391 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:52:51,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:52:51,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1403848170, now seen corresponding path program 35 times [2018-10-10 15:52:51,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:52:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:52:56,495 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 15:52:56,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:52:56,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:52:56,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:52:56,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:52:56,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:52:56,497 INFO L87 Difference]: Start difference. First operand 1011 states and 1011 transitions. Second operand 49 states. [2018-10-10 15:53:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:53:19,142 INFO L93 Difference]: Finished difference Result 1065 states and 1065 transitions. [2018-10-10 15:53:19,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:53:19,143 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1010 [2018-10-10 15:53:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:53:19,146 INFO L225 Difference]: With dead ends: 1065 [2018-10-10 15:53:19,146 INFO L226 Difference]: Without dead ends: 1065 [2018-10-10 15:53:19,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1076, Invalid=8626, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 15:53:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-10-10 15:53:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1039. [2018-10-10 15:53:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-10-10 15:53:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1039 transitions. [2018-10-10 15:53:19,154 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1039 transitions. Word has length 1010 [2018-10-10 15:53:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:53:19,154 INFO L481 AbstractCegarLoop]: Abstraction has 1039 states and 1039 transitions. [2018-10-10 15:53:19,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:53:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1039 transitions. [2018-10-10 15:53:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-10 15:53:19,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:53:19,161 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 15:53:19,161 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:53:19,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:53:19,162 INFO L82 PathProgramCache]: Analyzing trace with hash 611814020, now seen corresponding path program 36 times [2018-10-10 15:53:19,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:53:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:53:24,539 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 15:53:24,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:53:24,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:53:24,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:53:24,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:53:24,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:53:24,541 INFO L87 Difference]: Start difference. First operand 1039 states and 1039 transitions. Second operand 50 states. [2018-10-10 15:53:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:53:48,502 INFO L93 Difference]: Finished difference Result 1093 states and 1093 transitions. [2018-10-10 15:53:48,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:53:48,503 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1038 [2018-10-10 15:53:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:53:48,506 INFO L225 Difference]: With dead ends: 1093 [2018-10-10 15:53:48,506 INFO L226 Difference]: Without dead ends: 1093 [2018-10-10 15:53:48,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1100, Invalid=9000, Unknown=0, NotChecked=0, Total=10100 [2018-10-10 15:53:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-10 15:53:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1067. [2018-10-10 15:53:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2018-10-10 15:53:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1067 transitions. [2018-10-10 15:53:48,514 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1067 transitions. Word has length 1038 [2018-10-10 15:53:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:53:48,514 INFO L481 AbstractCegarLoop]: Abstraction has 1067 states and 1067 transitions. [2018-10-10 15:53:48,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:53:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1067 transitions. [2018-10-10 15:53:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2018-10-10 15:53:48,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:53:48,522 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 15:53:48,522 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:53:48,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:53:48,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1870154226, now seen corresponding path program 37 times [2018-10-10 15:53:48,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:53:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:53:54,490 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 15:53:54,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:53:54,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:53:54,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:53:54,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:53:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:53:54,491 INFO L87 Difference]: Start difference. First operand 1067 states and 1067 transitions. Second operand 51 states. [2018-10-10 15:54:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:54:19,688 INFO L93 Difference]: Finished difference Result 1121 states and 1121 transitions. [2018-10-10 15:54:19,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:54:19,688 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1066 [2018-10-10 15:54:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:54:19,692 INFO L225 Difference]: With dead ends: 1121 [2018-10-10 15:54:19,692 INFO L226 Difference]: Without dead ends: 1121 [2018-10-10 15:54:19,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1124, Invalid=9382, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:54:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-10-10 15:54:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1095. [2018-10-10 15:54:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-10-10 15:54:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1095 transitions. [2018-10-10 15:54:19,700 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1095 transitions. Word has length 1066 [2018-10-10 15:54:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:54:19,700 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 1095 transitions. [2018-10-10 15:54:19,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:54:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1095 transitions. [2018-10-10 15:54:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2018-10-10 15:54:19,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:54:19,708 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:54:19,708 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:54:19,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:54:19,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1773619104, now seen corresponding path program 38 times [2018-10-10 15:54:19,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:54:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:54:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 19798 backedges. 0 proven. 19798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:54:25,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:54:25,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:54:25,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:54:25,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:54:25,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:54:25,731 INFO L87 Difference]: Start difference. First operand 1095 states and 1095 transitions. Second operand 52 states.